License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license (CC BY-NC-ND 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2012.107
URN: urn:nbn:de:0030-drops-36671
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3667/
Go to the corresponding LIPIcs Volume Portal

Birkedal, Lars ; Sieczkowski, Filip ; Thamsborg, Jacob

A Concurrent Logical Relation

pdf-format:
13.pdf (0.5 MB)

Abstract

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.

BibTeX - Entry

@InProceedings{birkedal_et_al:LIPIcs:2012:3667,
  author =	{Lars Birkedal and Filip Sieczkowski and Jacob Thamsborg},
  title =	{{A Concurrent Logical Relation}},
  booktitle =	{Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL},
  pages =	{107--121},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-42-2},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{16},
  editor =	{Patrick C{\'e}gielski and Arnaud Durand},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2012/3667},
  URN =		{urn:nbn:de:0030-drops-36671},
  doi =		{10.4230/LIPIcs.CSL.2012.107},
  annote =	{Keywords: verification, logical relation, concurrency, type and effect system}
}

Keywords: verification, logical relation, concurrency, type and effect system
Collection: Computer Science Logic (CSL'12) - 26th International Workshop/21st Annual Conference of the EACSL
Issue Date: 2012
Date of publication: 03.09.2012

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI