Realizable and Unrealizable Specifications of Reactive Systems

Mart\'ın Abadi Leslie Lamport Pierre Wolper 1989 Realizable and Unrealizable Specifications of Reactive Systems editor = "Ausiello", 1–17 10.1007/BFb0035748 ARM Ltd. 1999 AMBAspecification (rev. 2) Available at www.arm.com Giorgio Ausiello Mariangiola Dezani-Ciancaglini Simona Ronchi Della Rocca 1989 Automata, Languages and Programming, 16th International Colloquium, (ICALP) LNCS 372 Springer Armin Biere Marijn Heule Hans van Maaren Toby Walsh 2009 Handbook of Satisfiability IOS Press Roderick Bloem Krishnendu Chatterjee Karin Greimel Thomas A. Henzinger Barbara Jobstmann 2010 Robustness in the Presence of Liveness editor = "Touili", 410–424 10.1007/978-3-642-14295-6_36 Roderick Bloem Alessandro Cimatti Karin Greimel Georg Hofferek Robert Könighofer Marco Roveri Viktor Schuppan Richard Seeber 2010 RATSY - A New Requirements Analysis Tool with Synthesis editor = "Touili", 425–429 10.1007/978-3-642-14295-6_37 Roderick Bloem Stefan Galler Barbara Jobstmann Nir Piterman Amir Pnueli Martin Weiglhofer 2007 Interactive presentation: Automatic hardware synthesis from specifications: a case study Rudy Lauwereins Jan Madsen DATE ACM 1188–1193 10.1145/1266366.1266622 Roderick Bloem Stefan Galler Barbara Jobstmann Nir Piterman Amir Pnueli Martin Weiglhofer 2007 Specify, Compile, Run: Hardware from PSL Electr. Notes Theor. Comput. Sci. 190 4 3–16 10.1016/j.entcs.2007.09.004 Roderick Bloem Barbara Jobstmann Martin Weiglhofer 2007 Anzu http://www.ist.tugraz.at/staff/jobstmann/anzu/ Randal E. Bryant 1986 Graph-Based Algorithms for Boolean Function Manipulation IEEE Trans. Computers 35 8 677–691 Franck Cassez Alexandre David Emmanuel Fleury Kim Guldstrand Larsen Didier Lime 2005 Efficient On-the-Fly Algorithms for the Analysis of Timed Games Mart\'ın Abadi Luca de Alfaro CONCUR LNCS 3653 Springer 66–80 10.1007/11539452_9 Lorenzo Clemente Richard Mayr 2010 Multipebble Simulations for Alternating Automata - (Extended Abstract) Paul Gastin François Laroussinie CONCUR LNCS 6269 Springer 297–312 10.1007/978-3-642-15375-4_21 Laurent Doyen Emmanuel Filiot Naiyong Jin Jean-François Raskin 2009 Acacia - LTL Realizability Check and Winning Strategy Synthesis using Antichains http://www.antichains.be/acacia/ Alexandre Duret-Lutz Denis Poitrenaud 2004 SPOT: An Extensible Model Checking Library Using Transition-Based Generalized Büchi Automata Doug DeGroot Peter G. Harrison Harry A. G. Wijshoff Zary Segall MASCOTS IEEE Computer Society 76–83 Rüdiger Ehlers 2010 Minimising Deterministic Büchi Automata Precisely Using SAT Solving Strichman Szeider 326–332 10.1007/978-3-642-14186-7_28 Rüdiger Ehlers 2010 Symbolic Bounded Synthesis editor = "Touili", 365–379 10.1007/978-3-642-14295-6_33 Rüdiger Ehlers 2010 Unbeast – Symbolic Bounded Synthesis http://react.cs.uni-saarland.de/tools/unbeast/ Rüdiger Ehlers Bernd Finkbeiner 2010 On the Virtue of Patience: Minimizing Büchi Automata van de Pol Weber 129–145 10.1007/978-3-642-16164-3_10 Cindy Eisner Dana Fisman 2006 A Practical Introduction to PSL (Series on Integrated Circuits and Systems) Springer-Verlag E. Allen Emerson A. Prasad Sistla 2000 Computer Aided Verification, 12th International Conference, CAV 2000, Chicago, IL, USA, July 15-19, 2000, Proceedings LNCS 1855 Springer Emanuel Falkenauer 1998 On Method Overfitting J. Heuristics 4 3 281–287 Emmanuel Filiot Naiyong Jin Jean-François Raskin 2009 An Antichain Algorithm for LTL Realizability Ahmed Bouajjani Oded Maler CAV LNCS 5643 Springer 263–277 10.1007/978-3-642-02658-4_22 Emmanuel Filiot Naiyong Jin Jean-François Raskin 2010 Compositional Algorithms for LTL Synthesis Ahmed Bouajjani Wei-Ngan Chin ATVA LNCS 6252 Springer 112–127 10.1007/978-3-642-15643-4_10 Bernd Finkbeiner Sven Schewe 2005 Uniform Distributed Synthesis LICS IEEE Computer Society 321–330 10.1109/LICS.2005.53 Michael J. Fischer Richard E. Ladner 1979 Propositional Dynamic Logic of Regular Programs J. Comput. Syst. Sci. 18 2 194–211 Riccardo Forth Paul Molitor 2000 An efficient heuristic for state encoding minimizing the BDD representations of the transistion relations of finite state machines ASP-DAC ACM 61–66 Paul Gastin Denis Oddoux 2001 Fast LTL to Büchi Automata Translation Gérard Berry Hubert Comon Alain Finkel CAV LNCS 2102 Springer 53–65 Allen Van Gelder Daniel Le Berre 2010 Pragmatics of SAT

Workshop at the Federated Logic Conference (FLoC) 2010, Edinburgh

Naghmeh Ghafari Alan J. Hu Zvonimir Rakamaric 2010 Context-Bounded Translations for Concurrent Software: An Empirical Evaluation van de Pol Weber 227–244 10.1007/978-3-642-16164-3_17 Yashdeep Godhal Krishnendu Chatterjee Thomas A. Henzinger 2010 Synthesis of AMBA AHB from Formal Specification CoRR abs/1001.2811 http://arxiv.org/abs/1001.2811 Wilsin Gosti Tiziano Villa Alexander Saldanha Alberto L. Sangiovanni-Vincentelli 2007 FSM Encoding for BDD Representations Applied Mathematics and Computer Science 17 1 113–124 10.2478/v10006-007-0011-6 Erich Grädel Wolfgang Thomas Thomas Wilke 2002 Automata, Logics, and Infinite Games: A Guide to Current Research LNCS 2500 Springer Karin Greimel Roderick Bloem Barbara Jobstmann Moshe Y. Vardi 2008 Open Implication Luca Aceto Ivan Damgård Leslie Ann Goldberg Magnús M. Halldórsson Anna Ingólfsdóttir Igor Walukiewicz ICALP (2) LNCS 5126 Springer 361–372 10.1007/978-3-540-70583-3_30 Aidan Harding Mark Ryan Pierre-Yves Schobbens 2005 A New Algorithm for Strategy Synthesis in LTL Games Nicolas Halbwachs Lenore D. Zuck TACAS LNCS 3440 Springer 477–492 Thomas A. Henzinger Nir Piterman 2006 Solving Games Without Determinization Zoltán Ésik CSL LNCS 4207 Springer 395–410 10.1007/11874683_26 IBM Research RuleBase formal verification tool tutorial https://www.research.ibm.com/haifa/projects/verification/RB_Homepage/ Barbara Jobstmann Roderick Bloem 2006 Lily - a LInear Logic sYnthesizer http://www.iaik.tugraz.at/content/research/design_verification/lily/ Barbara Jobstmann Roderick Bloem 2006 Optimizations for LTL Synthesis FMCAD IEEE Computer Society 117–124 10.1109/FMCAD.2006.22 Barbara Jobstmann Stefan Galler Martin Weiglhofer Roderick Bloem 2007 Anzu: A Tool for Property Synthesis Werner Damm Holger Hermanns CAV LNCS 4590 Springer 258–262 10.1007/978-3-540-73368-3_29 Joachim Klein Christel Baier 2006 Experiments with deterministic ω-automata for formulas of linear temporal logic Theor. Comput. Sci. 363 2 182–195 10.1016/j.tcs.2006.07.022 Uri Klein Amir Pnueli 2010 Revisiting Synthesis of GR(1) Specifications HVC LNCS 6504 Stephan Kottler 2010 SAT Solving with Reference Points Strichman Szeider 143–157 10.1007/978-3-642-14186-7_13 James H. Kukula Thomas R. Shiple 2000 Building Circuits from Relations Emerson Sistla 113–123 Orna Kupferman 2006 Avoiding Determinization LICS IEEE Computer Society 243–254 10.1109/LICS.2006.15 Orna Kupferman Nir Piterman Moshe Y. Vardi 2006 Safraless Compositional Synthesis Thomas Ball Robert B. Jones CAV LNCS 4144 Springer 31–44 10.1007/11817963_6 Orna Kupferman Moshe Y. Vardi 1999 Church's problem revisited Bulletin of Symbolic Logic 5 2 245–263 http://www.math.ucla.edu/~asl/bsl/0502/0502-004.ps Orna Kupferman Moshe Y. Vardi 2001 Model Checking of Safety Properties Formal Methods in System Design 19 3 291–314 Orna Kupferman Moshe Y. Vardi 2001 Synthesizing Distributed Systems LICS Orna Kupferman Moshe Y. Vardi 2005 Safraless Decision Procedures FOCS IEEE 531–542 10.1109/SFCS.2005.66 Xinxin Liu Scott A. Smolka 1998 Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract) Kim G. Larsen Sven Skyum Glynn Winskel ICALP LNCS 1443 Springer 53–66 10.1007/978-3-540-64781-2_53 A. Morgenstern 2010 Symbolic Controller Synthesis for LTL Specifications Department of Computer Science, University of Kaiserslautern, Germany A. Morgenstern K. Schneider 2010 Exploiting the Temporal Logic Hierarchy and the Non-Confluence Property for Efficient LTL Synthesis A. Montanari M. Napoli M. Parente GandALF EPTCS 25 89–102 10.4204/EPTCS.25.11 Silvia M. Müller Wolfgang J. Paul 2000 Computer architecture: complexity and correctness Springer Alexander Nadel Vadim Ryvchin 2010 Assignment Stack Shrinking Strichman Szeider 375–381 10.1007/978-3-642-14186-7_35 Carsten Sinz (organiser) SAT-Race 2010 http://baldur.iti.uka.de/sat-race-2010/ Ian Parberry 1994 A Guide for New Referees in Theoretical Computer Science Inf. Comput. 112 1 96–116 Nir Piterman Amir Pnueli Yaniv Sa'ar 2006 Synthesis of Reactive(1) Designs E. Allen Emerson Kedar S. Namjoshi VMCAI LNCS 3855 Springer 364–380 10.1007/11609773_24 Amir Pnueli 1977 The Temporal Logic of Programs FOCS IEEE 46–57 Amir Pnueli Roni Rosner 1989 On the Synthesis of a Reactive Module POPL 179–190 Amir Pnueli Roni Rosner 1989 On the Synthesis of an Asynchronous Reactive Module editor = "Ausiello", 652–671 Amir Pnueli Yaniv Sa'ar Lenore D. Zuck 2010 Jtlv: A Framework for Developing Verification Algorithms editor = "Touili", 171–174 10.1007/978-3-642-14295-6_18 Jaco van de Pol Michael Weber 2010 Model Checking Software - 17th International SPIN Workshop, Enschede, The Netherlands, September 27-29, 2010 LNCS 6349 Springer 10.1007/978-3-642-16164-3 Kristin Y. Rozier Moshe Y. Vardi 2010 LTL satisfiability checking STTT 12 2 123–137 10.1007/s10009-010-0140-3 Shmuel Safra 1989 Complexity of Automata on Infinite Objects Weizmann Institute of Science, Rehovot, Israel Sven Schewe Bernd Finkbeiner 2007 Bounded Synthesis Kedar S. Namjoshi Tomohiro Yoneda Teruo Higashino Yoshio Okamura ATVA LNCS 4762 Springer 474–488 10.1007/978-3-540-75596-8_33 Saqib Sohail Fabio Somenzi 2009 Safety first: A two-stage algorithm for LTL games FMCAD IEEE 77–84 10.1109/FMCAD.2009.5351138 Saqib Sohail Fabio Somenzi Kavita Ravi 2008 A Hybrid Algorithm for LTL Games Francesco Logozzo Doron Peled Lenore D. Zuck VMCAI LNCS 4905 Springer 309–323 10.1007/978-3-540-78163-9_26 Fabio Somenzi 2009 CUDD: CU Decision Diagram Package Release 2.4.2 Fabio Somenzi Roderick Bloem 2000 Efficient Büchi Automata from LTL Formulae Emerson Sistla 248–263 Ofer Strichman Stefan Szeider 2010 Theory and Applications of Satisfiability Testing (SAT) LNCS 6175 Springer 10.1007/978-3-642-14186-7 Walter F. Tichy 1998 Should Computer Scientists Experiment More? IEEE Computer 31 5 32–40 Tayssir Touili Byron Cook Paul Jackson 2010 The 22nd International Conference on Computer Aided Verification (CAV) LNCS 6174 Springer 10.1007/978-3-642-14295-6 Moshe Y. Vardi 1995 An Automata-Theoretic Approach to Linear Temporal Logic Faron Moller Graham M. Birtwistle Banff Higher Order Workshop LNCS 1043 Springer Moshe Y. Vardi Larry J. Stockmeyer 1985 Improved Upper and Lower Bounds for Modal Logics of Programs: Preliminary Report STOC ACM 240–251