A Concurrent Logical Relation

Authors Lars Birkedal, Filip Sieczkowski, Jacob Thamsborg

Thumbnail PDF


  • Filesize: 495 kB
  • 15 pages

Document Identifiers

Author Details

Lars Birkedal
Filip Sieczkowski
Jacob Thamsborg

Cite AsGet BibTex

Lars Birkedal, Filip Sieczkowski, and Jacob Thamsborg. A Concurrent Logical Relation. In Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL. Leibniz International Proceedings in Informatics (LIPIcs), Volume 16, pp. 107-121, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


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.
  • verification
  • logical relation
  • concurrency
  • type and effect system


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads
Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail