2026-07-20T05:58:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3667 2024-03-06T10:34:20Z ddc:004 open_access

A Concurrent Logical Relation Birkedal, Lars Sieczkowski, Filip Thamsborg, Jacob verification logical relation concurrency type and effect system 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. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Lars Birkedal and Filip Sieczkowski and Jacob Thamsborg 2012 Is Part Of LIPIcs, Volume 16, Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL (2012) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.CSL.2012.107 urn:nbn:de:0030-drops-36671 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2012.107 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode