University of Cambridge > > Computer Laboratory NetOS Group Talklets > Structure and Interpretation of Computer Programs!

Structure and Interpretation of Computer Programs!

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Stephen Kell.

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.

This talk is part of the Computer Laboratory NetOS Group Talklets series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2021, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity