Linkage graphs and what they look like

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

• Stephen Kell (University of Cambridge)
• Tuesday 11 March 2008, 13:00-14:00
• Computer Laboratory, William Gates Building, Room FW11.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• 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
• bld31

Note that ex-directory lists are not shown.