License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.CSL.2016.26
URN: urn:nbn:de:0030-drops-65669
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6566/
Go to the corresponding LIPIcs Volume Portal

Berger, Ulrich

Extracting Non-Deterministic Concurrent Programs

pdf-format:
LIPIcs-CSL-2016-26.pdf (0.5 MB)

Abstract

We introduce an extension of intuitionistic fixed point logic by a modal operator facilitating the extraction of non-deterministic concurrent programs from proofs. We apply this extension to program extraction in computable analysis, more precisely, to computing with Tsuiki's infinite Gray code for real numbers.

BibTeX - Entry

@InProceedings{berger:LIPIcs:2016:6566,
  author =	{Ulrich Berger},
  title =	{{Extracting Non-Deterministic Concurrent Programs}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{26:1--26:21},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-022-4},
  ISSN =	{1868-8969},
  year =	{2016},
  volume =	{62},
  editor =	{Jean-Marc Talbot and Laurent Regnier},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2016/6566},
  URN =		{urn:nbn:de:0030-drops-65669},
  doi =		{10.4230/LIPIcs.CSL.2016.26},
  annote =	{Keywords: Proof theory, realizability, program extraction, non-determinism,  concurrency, computable analysis}
}

Keywords: Proof theory, realizability, program extraction, non-determinism, concurrency, computable analysis
Collection: 25th EACSL Annual Conference on Computer Science Logic (CSL 2016)
Issue Date: 2016
Date of publication: 29.08.2016

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