Cake: a language for linking mismatched object code

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

• Stephen Kell (University of Cambridge)
• Tuesday 12 May 2009, 13:00-13:30
• Computer Laboratory, William Gates Building, Room FW11.

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

Conventional linkers and compilers do not adequately support composition of mismatched software components, since they implicitly assume components to be plug-compatible and homogeneous. Cake is a special-purpose linking language which complements conventional tools by describing correspondences (or relations) between mismatched preexisting components. I’ll briefly describe the benefits of the Cake language and the case-studies which have shaped its design.

[This is a five-minute practice talk for a short paper track at ICSE . Those who attended my longer CPRG talk on the same subject shouldn’t expect to learn much new from attending. I’ll be doing a further practice run-through of the longer talk immediately after the netos meeting, which any interested audience members are invited to stay for.]

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 talks
• Computer Laboratory, William Gates Building, Room FW11
• Interested Talks
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.