SAT-Based Synthesis Methods for Safety Specs

  • Roderick Bloem
  • Robert Könighofer
  • Martina Seidl
Conference paper

DOI: 10.1007/978-3-642-54013-4_1

Volume 8318 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bloem R., Könighofer R., Seidl M. (2014) SAT-Based Synthesis Methods for Safety Specs. In: McMillan K.L., Rival X. (eds) Verification, Model Checking, and Abstract Interpretation. VMCAI 2014. Lecture Notes in Computer Science, vol 8318. Springer, Berlin, Heidelberg

Abstract

Automatic synthesis of hardware components from declarative specifications is an ambitious endeavor in computer aided design. Existing synthesis algorithms are often implemented with Binary Decision Diagrams (BDDs), inheriting their scalability limitations. Instead of BDDs, we propose several new methods to synthesize finite-state systems from safety specifications using decision procedures for the satisfiability of quantified and unquantified Boolean formulas (SAT-, QBF- and EPR-solvers). The presented approaches are based on computational learning, templates, or reduction to first-order logic. We also present an efficient parallelization, and optimizations to utilize reachability information and incremental solving. Finally, we compare all methods in an extensive case study. Our new methods outperform BDDs and other existing work on some classes of benchmarks, and our parallelization achieves a super-linear speedup.

Keywords

Reactive Synthesis SAT-Solving Quantified Boolean Formulas Effectively Propositional Logic 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Roderick Bloem
    • 1
  • Robert Könighofer
    • 1
  • Martina Seidl
    • 2
  1. 1.Institute for Applied Information Processing and Communications (IAIK)Graz University of TechnologyAustria
  2. 2.Institute for Formal Models and VerificationJohannes Kepler UniversityLinzAustria