Compiling concurrency correctly: cutting out the middle man

Hu, Liyang and Hutton, Graham (2010) Compiling concurrency correctly: cutting out the middle man. In: Symposium on Trends in Functional Programming (10th), 2-4 June 2009, Komárno, Slovakia.

PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (223kB) | Preview


The standard approach to proving compiler correctness for concurrent languages requires the use of multiple translations into an intermediate process calculus. We present a simpler approach that avoids the need for such an intermediate language, using a new method that allows us to directly establish a bisimulation between the source and target languages. We illustrate the technique on two small languages, using the Agda system to present and formally verify our compiler correctness proofs.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Selected papers from the Tenth Symposium on Trends in Functional Programming, Komarno, Slovakia, June 2009. Published in: Trends in functional programming. Vol. 10. Bristol : Intellect, 2011, ISBN: 9781841504056. pp. 17-32
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Depositing User: Hutton, Prof Graham
Date Deposited: 18 Mar 2015 16:02
Last Modified: 18 Oct 2017 17:13

Actions (Archive Staff Only)

Edit View Edit View