Transforming Undecidable Synthesis Problems into Decidable Problems

1 pages•Published: July 25, 2013

Abstract

Synthesis holds the promise to revolutionize the development of
complex systems by automating the translation from specifications to
implementations. Synthesis algorithms are based on the same level of
mathematical rigor as verification algorithms but can be applied at
earlier development stages, when only parts of the design are
available. Given a formal specification of the desired system
properties, for example in a temporal logic, we determine if the
partial design can be completed into a full design that satisfies the
properties.

For general distributed systems, the synthesis problem is undecidable.
However, there has been a sequence of discoveries where the
decidability was established for specific system architectures, such
as pipelines and rings, or other restrictions on the problem, such as
local specifications. Encouraged by these findings, new specification
languages like Coordination Logic aim for a uniform treatment of the
synthesis problem.

In this talk, I will review several techniques that transform
undecidable synthesis problems into decidable problems.

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2013. First International Workshop on Verification and Program Transformation, vol 16, pages 9.

Links:	https://easychair.org/publications/paper/kdc
	https://doi.org/10.29007/tj84