Control Flow Analysis for the Join Calculus

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

• Peter Calvert (University of Cambridge)
• Friday 22 June 2012, 15:15-16:15
• SS03, Computer Laboratory.

If you have a question about this talk, please contact Dominic Orchard.

Since first being described, the Join Calculus has been incorporated into a variety of languages as an alternative concurrency primitive. While there has been some work on efficient library implementation of the calculus, there has been little on statically analysing and transforming it. This work explores adapting conventional analysis techniques to the Join Calculus. In particular, we present three variations of control flow analysis for a flattened version, and consider two important optimisations: inlining and queue bounding.

This is a practice talk for SAS 2012 . Joint work with Alan Mycroft.

This talk is part of the Computer Laboratory Programming Research Group Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Computer Laboratory Programming Research Group Seminar
• Computer Laboratory talks
• SS03, Computer Laboratory
• School of Technology

Note that ex-directory lists are not shown.