[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.5555/2840819.2840930acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
tutorial

Property-Directed Synthesis of Reactive Systems from Safety Specifications

Published: 02 November 2015 Publication History

Abstract

Reactive system synthesis from safety specifications is a promising approach to the correct-by-construction methodology. The synthesis process is often divided into two separate steps: First, check specification realizability by computing the winning region of states under a game-theoretic interpretation; second, synthesize the implementation circuit based on the computed winning region if the specification is realizable. Moreover, recent results suggest that methods based on satisfiability (SAT) solving outperform those based on Binary Decision Diagrams (BDDs) especially on large benchmark instances. In this paper, we focus on the the winning region computation and propose a SAT-based algorithm. By adopting the concepts from the state-of-the-art model checking algorithm property directed reachability (PDR, a.k.a. IC3), we aim at devising an efficient computation method for automatic controller synthesis. Experimental results on the benchmarks from the synthesis competition (SyntComp 2014) show that our proposed algorithm outperforms the existing SAT-based and QBF-based methods by some margin.

References

[1]
Berkeley logic synthesis and verification group. ABC: A system for sequential synthesis and verification, http://www.eecs.berkeley.edu/~alanmi/abc/.
[2]
V. Balabanov and J.-H. R. Jiang. Resolution proofs and Skolem functions in QBF evaluation and applications. In Proceedings of the International Conference on Computer Aided Verification (CAV), pages 149--164, 2011.
[3]
V. Balabanov and J.-H. R. Jiang. Unified qbf certification and its applications. Formal Methods in System Design, 41(1):45--65, 2012.
[4]
M. Benedetti. sKizzo: A suite to evaluate and certify QBFs. In Proceedings of the International Conference on Automated Deduction (CADE), pages 369--376, 2005.
[5]
R. Bloem, U. Egly, P. Klampfl, R. Könighofer, and F. Lonsing. SAT-based methods for circuit synthesis. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD), pages 31--34, 2014.
[6]
R. Bloem, S. J. Galler, B. Jobstmann, N. Piterman, A. Pnueli, and M. Weiglhofer. Specify, compile, run: Hardware from PSL. Electronic Notes in Theoretical Computer Science (ENTCS), 190(4):3--16, 2007.
[7]
R. Bloem, B. Jobstmann, N. Piterman, A. Pnueli, and Y. Sa'ar. Synthesis of reactive(1) designs. Journal of Computer and System Sciences, 78(3):911--938, 2012.
[8]
R. Bloem, R. Könighofer, and M. Seidl. SAT-based synthesis methods for safety specs. In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 1--20, 2014.
[9]
A. R. Bradley. SAT-based model checking without unrolling. In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 70--87, 2011.
[10]
N. Eén, A. Mishchenko, and R. Brayton. Efficient implementation of property directed reachability. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD), pages 125--134, 2011.
[11]
N. Eén and N. Sörensson. An extensible SAT-solver. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 502--518, 2003.
[12]
R. Ehlers. Symbolic bounded synthesis. In Proceedings of the International Conference on Computer Aided Verification (CAV), pages 365--379, 2010.
[13]
M. Janota and J. P. M. Silva. Abstraction-based algorithm for 2QBF. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 230--244, 2011.
[14]
J.-H. Jiang, C.-C. Lee, A. Mishchenko, and C.-Y. Huang. To SAT or not to SAT: Scalable exploration of functional dependency. IEEE Transactions on Computers, 59(4):457--467, April 2010.
[15]
F. Lonsing and A. Biere. DepQBF: A dependency-aware QBF solver. Journal on Satisfiability, Boolean Modeling and Computation (JSAT), 7(2-3):71--76, 2010.
[16]
A. Morgenstern, M. Gesell, and K. Schneider. Solving games using incremental induction. In Proceedings of the International Conference on Integrated Formal Methods (IFM), pages 177--191, 2013.
[17]
N. Narodytska, A. Legg, F. Bacchus, L. Ryzhyk, and A. Walker. Solving games without controllable predecessor. In Proceedings of the International Conference on Computer Aided Verification (CAV), pages 533--540, 2014.
[18]
T. Nopper and C. Scholl. Approximate symbolic model checking for incomplete designs. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD), pages 290--305, 2004.
[19]
A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), pages 179--190, 1989.
[20]
S. Sohail and F. Somenzi. Safety first: A two-stage algorithm for LTL games. In Proceedings of the International Conference on Formal Methods in Computer-Aided Design (FMCAD), pages 77--84, 2009.
[21]
S. Sohail, F. Somenzi, and K. Ravi. A hybrid algorithm for LTL games. In Proceedings of the International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI), pages 309--323, 2008.
[22]
S. Staber and R. Bloem. Fault localization and correction with QBF. In Proceedings of the International Conference on Theory and Applications of Satisfiability Testing (SAT), pages 355--368, 2007.
[23]
G. Tseitin. On the complexity of derivation in propositional calculus. In Studies in Constructive Mathematics and Mathematical Logic, pages 466--483, 1970.

Cited By

View all
  • (2017)The first reactive synthesis competition (SYNTCOMP 2014)International Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0416-319:3(367-390)Online publication date: 1-Jun-2017

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '15: Proceedings of the IEEE/ACM International Conference on Computer-Aided Design
November 2015
955 pages
ISBN:9781467383899
  • General Chair:
  • Diana Marculescu,
  • Program Chair:
  • Frank Liu

Sponsors

Publisher

IEEE Press

Publication History

Published: 02 November 2015

Check for updates

Qualifiers

  • Tutorial
  • Research
  • Refereed limited

Conference

ICCAD '15
Sponsor:

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2017)The first reactive synthesis competition (SYNTCOMP 2014)International Journal on Software Tools for Technology Transfer (STTT)10.1007/s10009-016-0416-319:3(367-390)Online publication date: 1-Jun-2017

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media