]> 2026-07-01T00:41:50+00:00 Synthesis from multi-paradigm specifications 0 en 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. Ioannis Filippidis, Richard M. Murray and Gerard J. Holzmann 2015c Submitted, 2015 Workshop on Synthesis (SYNT) fmh15-synt Conference Paper 2016-05-15T05:39:24Z 2457523.7356944 Synthesis from multi-paradigm specifications Title 102 en Title