University of Cambridge > > Computer Laboratory NetOS Group Talklets > Linkage graphs and what they look like

Linkage graphs and what they look like

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

If you have a question about this talk, please contact Henry Robinson.

There is more structure to software than that made explicit by the programmer. It can be useful to recover this structure, for various purposes: fine-grained re-use, disaggregation, refactoring, visualisation and so on. I’ll talk briefly about some very rough work I’ve been doing on extracting, decomposing and visualising the linkage graphs of real programs. I’ll also mention my ideas on how to improve these, and am hoping that some smart people in the audience will have some even better ideas.

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