![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Tuesday 28 April 2009, 13:00-13:30
Structure and Interpretation of Computer Programs!
- đ¤ Speaker: Ganesh Narayanaswamy, University of Cambridge
- đ Date & Time: Tuesday 28 April 2009, 13:00 - 13:30
- đ Venue: Computer Laboratory, William Gates Building, Room FW11
Questions? Contact
Stephen Kell
Abstract
Call graphs depict static, caller-callee relation between “functions” in a program; with most source and target languages supporting functions 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-theoretic features—across versions, program domains and source languages. This work is an attempt to throw light on statistical, algebraic and topological structure of call graphs.
Series This talk is part of the Computer Laboratory NetOS Group Talklets series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory NetOS Group Talklets
- Computer Laboratory, William Gates Building, Room FW11
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- School of Technology
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.