![[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 11 March 2008, 13:00-14:00
Linkage graphs and what they look like
- đ¤ Speaker: Stephen Kell (University of Cambridge)
- đ Date & Time: Tuesday 11 March 2008, 13:00 - 14:00
- đ Venue: Computer Laboratory, William Gates Building, Room FW11
Questions? Contact
Henry Robinson
Abstract
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.
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.