<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en">
	<id>https://murray.cds.caltech.edu/index.php?action=history&amp;feed=atom&amp;title=Synthesis_from_multi-paradigm_specifications</id>
	<title>Synthesis from multi-paradigm specifications - Revision history</title>
	<link rel="self" type="application/atom+xml" href="https://murray.cds.caltech.edu/index.php?action=history&amp;feed=atom&amp;title=Synthesis_from_multi-paradigm_specifications"/>
	<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Synthesis_from_multi-paradigm_specifications&amp;action=history"/>
	<updated>2026-09-17T09:37:42Z</updated>
	<subtitle>Revision history for this page on the wiki</subtitle>
	<generator>MediaWiki 1.44.2</generator>
	<entry>
		<id>https://murray.cds.caltech.edu/index.php?title=Synthesis_from_multi-paradigm_specifications&amp;diff=19631&amp;oldid=prev</id>
		<title>Murray: htdb2wiki: creating page for 2015c_fmh15-synt.html</title>
		<link rel="alternate" type="text/html" href="https://murray.cds.caltech.edu/index.php?title=Synthesis_from_multi-paradigm_specifications&amp;diff=19631&amp;oldid=prev"/>
		<updated>2016-05-15T05:39:24Z</updated>

		<summary type="html">&lt;p&gt;htdb2wiki: creating page for 2015c_fmh15-synt.html&lt;/p&gt;
&lt;p&gt;&lt;b&gt;New page&lt;/b&gt;&lt;/p&gt;&lt;div&gt;{{HTDB paper&lt;br /&gt;
| authors = Ioannis  Filippidis, Richard M. Murray and Gerard J. Holzmann&lt;br /&gt;
| title = Synthesis from multi-paradigm specifications&lt;br /&gt;
| source = Submitted, 2015 Workshop on Synthesis (SYNT)&lt;br /&gt;
| year = 2015&lt;br /&gt;
| type = Conference Paper&lt;br /&gt;
| funding = TerraSwarm&lt;br /&gt;
| url = http://resolver.caltech.edu/CaltechCDSTR:2015.003&lt;br /&gt;
| abstract = &lt;br /&gt;
This work proposes a language for describing reactive synthesis problems that integrates imperative and declarative elements. The semantics is defined in terms of two-player turn-based infinite games with full information. Currently, synthesis tools accept linear temporal logic (LTL) as input, but this description is less structured and does not facilitate the expression of sequential constraints. This motivates the use of a structured programming language to specify synthesis problems. Transition systems and guarded commands serve as imperative constructs, expressed in a syntax based on that of the modeling language Promela. The syntax allows defining which player controls data and control flow, and separating a program into assumptions and guarantees. These notions are necessary for input to game solvers. The integration of imperative and declarative paradigms allows using the paradigm that is most appropriate for expressing each requirement. The declarative part is expressed in the LTL fragment of generalized reactivity(1), which admits efficient synthesis algorithms. The implementation translates Promela to input for the Slugs synthesizer and is written in Python.&lt;br /&gt;
| flags = &lt;br /&gt;
| filetype = link&lt;br /&gt;
| tag = fmh15-synt&lt;br /&gt;
| id = 2015c&lt;br /&gt;
}}&lt;/div&gt;</summary>
		<author><name>Murray</name></author>
	</entry>
</feed>