![]() |
COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring. | ![]() |
University of Cambridge > Talks.cam > Computer Laboratory NetOS Group Talklets > Cake: a language for linking mismatched object code
Cake: a language for linking mismatched object codeAdd to your list(s) Download to your calendar using vCal
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:
Note that ex-directory lists are not shown. |
Other listsSt Catharine's College Amalgamated Societies Lecture Series Centre for Risk Studies - talks & events Type the title of a new list hereOther talksCognition in the wild: foraging hummingbirds and building nests Effective Conference Presentations and Networking Type I IFN induces CXCL13-driven B cell recruitment to the lung to enable tertiary GC formation Psychological predictors of risky online behaviour: The cases of online piracy and privacy New methods for genetic analysis A lifelong project in clay: Virtues of Unity |