A Concurrent Logical Relation

Lars Birkedal, Filip Sieczkowski, Jacob Junker Thamsborg

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-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
    JournalDagstuhl Seminar Proceedings
    Number of pages21
    Publication statusPublished - 2012


    • verification
    • logical relation
    • concurrency
    • type and effect system


    Dive into the research topics of 'A Concurrent Logical Relation'. Together they form a unique fingerprint.

    Cite this