BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Structure and Interpretation of Computer Programs! - Ganesh Naraya
 naswamy\, University of Cambridge
DTSTART:20090428T120000Z
DTEND:20090428T123000Z
UID:TALK18199@talks.cam.ac.uk
CONTACT:Stephen Kell
DESCRIPTION:Call graphs depict static\, caller-callee relation between "fu
 nctions" in a program\; with most source and target languages supporting f
 unctions as primitive unit of composition\, call graphs naturally form the
  fundamental control flow representation available to understand\, develop
 \, analyse and test software. Given their universality and usefulness\, it
  is imperative to ask if call graphs exhibit any intrinsic\, graph-theoret
 ic features -- across versions\, program domains and source languages. Thi
 s work is an attempt to throw light on statistical\, algebraic and topolog
 ical structure of call graphs. 
LOCATION:Computer Laboratory\, William Gates Building\, Room FW11
END:VEVENT
END:VCALENDAR