Luca de Alfaro
Pritam Roy
2010
Solving games via three-valued abstraction refinement
Inf. Comput.
208
6
666–676
10.1016/j.ic.2009.05.007
Tomás Babiak
Mojmír Kretínský
Vojtech Rehák
Jan Strejcek
2012
LTL to Büchi Automata Translation: Fast and More Deterministic
TACAS
LNCS
7214
Springer
95–109
10.1007/978-3-642-28756-5_8
Adrian Balint
Daniel Diepold
Daniel Gall
Simon Gerber
Gregor Kapler
Robert Retz
2011
EDACC - An Advanced Platform for the Experiment Design, Administration and Analysis of Empirical Algorithms
LION 5. Selected Papers
LNCS
6683
Springer
586–599
10.1007/978-3-642-25566-3_46
R. Bloem
R. Könighofer
M. Seidl
2014
SAT-Based Synthesis Methods for Safety Specs
VMCAI
LNCS
8318
Springer
1–20
10.1007/978-3-642-54013-4_1
Aaron Bohy
Véronique Bruyère
Emmanuel Filiot
Naiyong Jin
Jean-François Raskin
2012
Acacia+, a Tool for LTL Synthesis
CAV
LNCS
7358
Springer
652–657
10.1007/978-3-642-31424-7_45
Robert K. Brayton
Alan Mishchenko
2010
ABC: An Academic Industrial-Strength Verification Tool
CAV
LNCS
6174
Springer
24–40
10.1007/978-3-642-14295-6_5
Romain Brenguier
Guillermo A. Pérez
Jean-François Raskin
Ocan Sankur
2014
AbsSynthe: abstract synthesis from succinct safety specifications
SYNT
EPTCS
157
Open Publishing Association
100–116
10.4204/EPTCS.157.11
Romain Brenguier
Guillermo A. Pérez
Jean-François Raskin
Ocan Sankur
2015
Compositional Algorithms for Succinct Safety Games
SYNT
EPTCS
202
Open Publishing Association
98–111
10.4204/EPTCS.202.7
Gianpiero Cabodi
Carmelo Loiacono
Marco Palena
Paolo Pasini
Denis Patti
Stefano Quer
Danilo Vendraminetto
Armin Biere
Keijo Heljanko
2016
Hardware Model Checking Competition 2014: An Analysis and Comparison of Solvers and Benchmarks
Journal on Satisfiability, Boolean Modeling and Computation
9
135–172
https://www.satassociation.org/jsat/index.php/jsat/article/download/129/111
Cristian S. Calude
Sanjay Jain
Bakhadyr Khoussainov
Wei Li
Frank Stephan
2017
Deciding parity games in quasipolynomial time
Hamed Hatami
Pierre McKenzie
Valerie King
Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2017, Montreal, QC, Canada, June 19-23, 2017
ACM
252–263
10.1145/3055399.3055409
Alonzo Church
1962
Logic, arithmetic and automata
Proceedings of the international congress of mathematicians
23–35
Alexandre Duret-Lutz
Alexandre Lewkowicz
Amaury Fauchille
Thibaud Michaud
Etienne Renault
Laurent Xu
2016
Spot 2.0 — a framework for LTL and ω-automata manipulation
Proceedings of the 14th International Symposium on Automated Technology for Verification and Analysis (ATVA'16)
LNCS
9938
Springer
122–129
10.1007/978-3-319-46520-3_8
Rüdiger Ehlers
2012
Symbolic bounded synthesis
Formal Methods in System Design
40
2
232–262
10.1007/s10703-011-0137-x
Peter Faymonville
Bernd Finkbeiner
Markus N. Rabe
Leander Tentrup
2017
Encodings of Bounded Synthesis
TACAS (1)
LNCS
10205
354–370
10.1007/978-3-662-54577-5_20
Peter Faymonville
Bernd Finkbeiner
Leander Tentrup
2017
BoSy: An Experimentation Framework for Bounded Synthesis
CAV (2)
LNCS
10427
Springer
325–332
10.1007/978-3-319-63390-9_17
Bernd Finkbeiner
Felix Klein
2016
Bounded Cycle Synthesis
CAV (1)
LNCS
9779
Springer
118–135
10.1007/978-3-319-41528-4_7
Bernd Finkbeiner
Markus N. Rabe
César Sánchez
2015
Algorithms for Model Checking HyperLTL and HyperCTL*
CAV
LNCS
9206
Springer
30–48
10.1007/978-3-319-21690-4_3
Bernd Finkbeiner
Sven Schewe
2013
Bounded synthesis
STTT
15
5-6
519–539
10.1007/s10009-012-0228-z
Johann Glaser
Clifford Wolf
2014
Methodology and Example-Driven Interconnect Synthesis for Designing Heterogeneous Coarse-Grain Reconfigurable Architectures
201–221
Springer International Publishing
Cham
10.1007/978-3-319-01418-0_12
Swen Jacobs
2014
Extended AIGER Format for Synthesis
CoRR
abs/1405.5793
http://arxiv.org/abs/1405.5793
Swen Jacobs
Roderick Bloem
2016
The Reactive Synthesis Competition: SYNTCOMP 2016 and Beyond
SYNT@CAV 2016
EPTCS
229
133–148
10.4204/EPTCS.229.11
Swen Jacobs
Roderick Bloem
Romain Brenguier
Rüdiger Ehlers
Timotheus Hell
Robert Könighofer
Guillermo A. Pérez
Jean-François Raskin
Leonid Ryzhyk
Ocan Sankur
Martina Seidl
Leander Tentrup
Adam Walker
2017
The first reactive synthesis competition (SYNTCOMP 2014)
STTT
19
3
367–390
10.1007/s10009-016-0416-3
Swen Jacobs
Roderick Bloem
Romain Brenguier
Ayrat Khalimov
Felix Klein
Robert Könighofer
Jens Kreber
Alexander Legg
Nina Narodytska
Guillermo A. Pérez
Jean-François Raskin
Leonid Ryzhyk
Ocan Sankur
Martina Seidl
Leander Tentrup
Adam Walker
2016
The 3rd Reactive Synthesis Competition (SYNTCOMP 2016): Benchmarks, Participants & Results
SYNT@CAV
EPTCS
229
149–177
10.4204/EPTCS.229.12
Swen Jacobs
Roderick Bloem
Romain Brenguier
Robert Könighofer
Guillermo A. Pérez
Jean-François Raskin
Leonid Ryzhyk
Ocan Sankur
Martina Seidl
Leander Tentrup
Adam Walker
2016
The Second Reactive Synthesis Competition (SYNTCOMP 2015)
SYNT
EPTCS
202
Open Publishing Association
27–57
10.4204/EPTCS.202.4
Swen Jacobs
Felix Klein
Sebastian Schirmer
2016
A High-Level LTL Synthesis Format: TLSF v1.1
SYNT@CAV 2016
EPTCS
229
112–132
10.4204/EPTCS.229.10
Mikolás Janota
William Klieber
Joao Marques-Silva
Edmund M. Clarke
2016
Solving QBF with counterexample guided refinement
Artif. Intell.
234
1–25
10.1016/j.artint.2016.01.004
Barbara Jobstmann
2007
Applications and Optimizations for LTL Synthesis
Graz University of Technology
Barbara Jobstmann
Roderick Bloem
2006
Optimizations for LTL Synthesis
FMCAD
IEEE Computer Society
117–124
10.1109/FMCAD.2006.22
Ayrat Khalimov
2015
Specification Format for Reactive Synthesis Problems
SYNT
EPTCS
202
Open Publishing Association
112–119
10.4204/EPTCS.202.8
Ayrat Khalimov
Swen Jacobs
Roderick Bloem
2013
PARTY Parameterized Synthesis of Token Rings
CAV
LNCS
8044
Springer
928–933
10.1007/978-3-642-39799-8_66
Ayrat Khalimov
Swen Jacobs
Roderick Bloem
2013
Towards Efficient Parameterized Synthesis
VMCAI
LNCS
7737
Springer
108–127
10.1007/978-3-642-35873-9_9
Alexander Legg
Nina Narodytska
Leonid Ryzhyk
2016
A SAT-Based Counterexample Guided Method for Unbounded Synthesis
CAV (2)
LNCS
9780
Springer
364–382
10.1007/978-3-319-41540-6_20
Jia Hui Liang
Vijay Ganesh
Pascal Poupart
Krzysztof Czarnecki
2016
Learning Rate Based Branching Heuristic for SAT Solvers
Nadia Creignou
Daniel Le Berre
Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings
Lecture Notes in Computer Science
9710
Springer
123–140
10.1007/978-3-319-40970-2_9
Donald A. Martin
1975
Borel Determinacy
Annals of Mathematics
102
2
363–371
Leonardo Mendonça de Moura
Nikolaj Bjørner
2008
Z3: An Efficient SMT Solver
TACAS
LNCS
4963
Springer
337–340
10.1007/978-3-540-78800-3_24
Roman R. Redziejowski
2012
An Improved Construction of Deterministic Omega-automaton Using Derivatives
Fundam. Inform.
119
3-4
393–406
10.3233/FI-2012-744
Olivier Roussel
2011
Controlling a Solver Execution with the runsolver Tool
JSAT
7
4
139–144
http://jsat.ewi.tudelft.nl/content/volume7/JSAT7_12_Roussel.pdf
Leonid Ryzhyk
Adam Walker
John Keys
Alexander Legg
Arun Raghunath
Michael Stumm
Mona Vij
2014
User-Guided Device Driver Synthesis
OSDI
USENIX Association
661–676
https://www.usenix.org/conference/osdi14/technical-sessions/presentation/ryzhyk
M. Seidl
R. Könighofer
2014
Partial witnesses from preprocessed quantified Boolean formulas
DATE'14
IEEE
1–6
10.7873/DATE2014.162
Leander Tentrup
2016
Solving QBF by Abstraction
CoRR
abs/1604.06752
http://arxiv.org/abs/1604.06752
Cong Tian
Jun Song
Zhenhua Duan
Zhao Duan
2015
LtlNfBa: Making LTL Translation More Practical
SOFL+MSVL
LNCS
9559
Springer
179–194
10.1007/978-3-319-31220-0_13
James C. Tiernan
1970
An efficient search algorithm to find the elementary circuits of a graph
Commun. ACM
13
12
722–726
10.1145/362814.362819
Cheng-Yin Wu
Chi-An Wu
Chien-Yu Lai
Chung-Yang R. Haung
2014
A Counterexample-Guided Interpolant Generation Algorithm for SAT-Based Model Checking
IEEE Trans. on CAD of Integrated Circuits and Systems
33
12
1846–1858
10.1109/TCAD.2014.2363395
Wieslaw Zielonka
1998
Infinite Games on Finitely Coloured Graphs with Applications to Automata on Infinite Trees
Theor. Comput. Sci.
200
1-2
135–183
10.1016/S0304-3975(98)00009-7