Aarhus University Seal / Aarhus Universitets segl

A Concurrent Logical Relation

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

We present a logical relation for showing the correctness of program transformations based on a new type-and-effect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation.
We show how to use our model to verify a number of interesting program transformations that rely on effect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and effects of the expressions. To the best of our knowledge, this is the first such result for a concurrent higher-order language with higher-order store and
dynamic memory allocation.
Original languageEnglish
Title of host publicationComputer Science Logic 2012 : 26th International Workshop. 21th Annual Conference of the EACSL. CSL’12, September 3–6, 2012, Fontainebleau, Franc
EditorsPatrick Cégielski, Arnaud Durand
Number of pages21
PublisherSchloss Dagstuhl--Leibniz-Zentrum für Informatik
Publication year2012
ISBN (print) 978-3-939897-42-2
Publication statusPublished - 2012
Externally publishedYes
SeriesLeibniz International Proceedings in Informatics

See relations at Aarhus University Citationformats

Download statistics

No data available

ID: 81377743