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.3
URN: urn:nbn:de:0030-drops-65436
Go to the corresponding LIPIcs Volume Portal

Muscholl, Anca

Automated Synthesis: Going Distributed (Invited Talk)

LIPIcs-CSL-2016-3.pdf (0.2 MB)


Synthesis is particularly challenging for concurrent programs. At the same time it is a very promising approach, since concurrent programs are difficult to get right, or to analyze with traditional verification techniques. The talk provides an introduction to distributed synthesis in the setting of Mazurkiewicz traces, and its applications to decentralized runtime monitoring.

BibTeX - Entry

  author =	{Anca Muscholl},
  title =	{{Automated Synthesis: Going Distributed (Invited Talk)}},
  booktitle =	{25th EACSL Annual Conference on Computer Science Logic (CSL 2016)},
  pages =	{3:1--3:2},
  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 =		{},
  URN =		{urn:nbn:de:0030-drops-65436},
  doi =		{10.4230/LIPIcs.CSL.2016.3},
  annote =	{Keywords: Concurrent programs, Distributed synthesis, Runtime monitoring}

Keywords: Concurrent programs, Distributed synthesis, Runtime monitoring
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