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.
@InProceedings{muscholl:LIPIcs.CSL.2016.3, author = {Muscholl, Anca}, title = {{Automated Synthesis: Going Distributed}}, 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 = {Talbot, Jean-Marc and Regnier, Laurent}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CSL.2016.3}, URN = {urn:nbn:de:0030-drops-65436}, doi = {10.4230/LIPIcs.CSL.2016.3}, annote = {Keywords: Concurrent programs, Distributed synthesis, Runtime monitoring} }
Feedback for Dagstuhl Publishing