Improving the encoding of LTL model checking into SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2294 LNCS, Issue , 2002, Pages 196-207

  Cimatti, Alessandro ^a   Pistore, Marco ^a   Roveri, Marco ^a   Sebastiani, Roberto ^a,b  

^a ITC IRST   (Italy)

^b UNIVERSITY OF TRENTO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN ALGEBRA; DISTRIBUTED COMPUTER SYSTEMS; ENCODING (SYMBOLS); SIGNAL ENCODING;

BOOLEAN FORMULAE; BOUNDED MODEL CHECKING; ENCODINGS; HIGHER EFFICIENCY; LTL MODEL-CHECKING; LTL PROPERTY; PROPOSITIONAL SATISFIABILITY; REACHABILITY;

MODEL CHECKING;

EID: 84894614087     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47813-2_14     Document Type: Conference Paper

References (16)

1. P. A. Abdullah, P. Bjesse, and N. Een. Symbolic Reachability Analysis based on SAT-Solvers. In Sixth Int.nl Conf. on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'00), 2000.
2. A. Biere, A. Cimatti, E. M. Clarke, and Yunshan Zhu. Symbolic Model Checking without BDDs. In Proc. TACAS'99, pages 193-207, 1999.
3. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying safety proeprties of a power pc microprocessor using symbolic model checking without BDDs. In Proc CAV99, volume 1633 of LNCS, pages 60-71, Berlin, 1999. Springer.
4. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
5. J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic Model Checking: 1020 States and Beyond. Information and Computation, 98(2):142-170, June 1992.
6. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV : a new symbolic model checker. International Journal on Software Tools for Technology Transfer (STTT), 2(4), March 2000.
7. E. Clarke, O. Grumberg, and D. Long. Model Checking. In Proceedings of the International Summer School on Deductive Program Design, Marktoberdorf, Germany, 1994.
8. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finitestate concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, 1986.
9. F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proc. CAV'2001, LNCS, Berlin, 2001. Springer.
10. E. Giunchiglia and R. Sebastiani. Applying the Davis-Putnam procedure to nonclausal formulas. In Proc. AI*IA'99, number 1792 in Lecture Notes in Artificial Intelligence. Springer Verlag, 1999.
11. K.L. McMillan. Symbolic Model Checking. Kluwer Academic Publ., 1993.
12. D.A. Plaisted and S. Greenbaum. A Structure-preserving Clause Form Translation. Journal of Symbolic Computation, 2:293-304, 1986.
13. D. Sheridan and T. Walsh. Clause Forms Generated by Bounded Model Checking. In Proc. Eighth Workshop on Automated Reasoning: Bridging the Gap between Theory and Practice, University of York, March 2001.
14. O. Shtrichmann. Tuning SAT checkers for bounded model checking. In Conference of Computer Aided Verification, volume 1855 of LNCS, pages 480-494, Berlin, 2000. Springer.
15. M. Y. Vardi and P. Wolper. Automata-Theoretic Techniques for Modal Logics of Programs. Journal of Computer and System Sciences, 32:183-221, 1986.
16. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. In Proc. CAV'2000, volume 1855 of LNCS, pages 124-138, Berlin, 2000. Springer.