Benefits of bounded model checking at an industrial setting

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

Volumn 2102, Issue , 2001, Pages 436-453

  Copty, Fady ^a   Fix, Limor ^a   Fraer, Ranan ^a   Giunchiglia, Enrico ^b   Kamhi, Gila ^a   Tacchella, Armando ^b   Vardi, Moshe Y ^c  

^a INTEL CORPORATION   (United States)

^b UNIVERSITY OF GENOA   (Italy)

^c Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS; FORECASTING; FORMAL LOGIC; PRODUCTIVITY;

BOUNDED MODEL CHECKING; BRANCHING HEURISTICS; INDUSTRIAL SETTINGS; INDUSTRIAL STRENGTH; LEARNING TECHNIQUES; MODEL VARIABLES; PROPOSITIONAL SATISFIABILITY; SATISFIABILITY SOLVERS;

MODEL CHECKING;

EID: 84958760528     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44585-4_43     Document Type: Conference Paper

References (27)

1. P. A. Abdulla, P. Bjesse, and N. E'en. Symbolic reachability analisys based on SAT solvers. In Proc. of the 6th International Conference of Tools and Algorithms for Construction and Analisys of Systems (TACAS 2000), volume 1785 of LNCS, pages 411-425, Berlin, 2000. Springer.
2. R. Armoni, L. Fix, R. Gerth, B. Ginsburg, T. Kanza, S. Mador-Haim, E. Singerman, A. M. Y. Vardi. ForSpec: A Formal Temporal Specification Language, Submitted to ICCAD'01
3. I. Beer, S. Ben-David, C. Eisner, A. Landver. "RuleBase: An industry-oriented formal verification tool". In Proc. Design Automation Conference 1996 (DAC'96).
4. I. Beer, C. Eisner, D. Geist, L. Gluhovsky, T. Heyman, A. Landver, P. Paanah, Y. Rodeh, G. Ronin, Y. Wolfsthal. "RuleBase: Model Checking at IBM", Proceedings of CAV'97.
5. J.R. Burch, E.M. Clarke, and K.L. McMillan. Symbolic model checking: 1020 states and beyond.Information and Computation, 98:142-170, 1992.
6. Armin Biere, Edmund Clarke, Richard Raimi, and Yunshan Zhu. "Verifying Safety Properties of a PowerPC Microprocessor Using Symbolic Model Checking without BDDs". Proc. of Computer Aided Verification, 1999 (CAV'99).
7. A. Biere, A Cimatti, E. M. Clarke, and Y. Zhu. "Symbolic model checking without BDDs". TACAS'99
8. A. Biere, A. Cimatti, E. Clarke, M. Fujita, and Y. Zhu. Symbolic model checking using SAT procedures instead of BDDs. In Proc. of the 36th Conference on Design Automation (DAC '99), pages 317-320. ACM Press, 1999.
9. R. E. Bryant. Symbolic Boolean manipulation with ordered binary-decision diagrams. ACM Computing Surveys, 24(3):293-318, September 1992.
10. R. J. Bayardo, Jr. and R. C. Schrag, "Using CSP Look-Back Techniques to Solve Real-World SAT Instances", pages 203-208, Proc. AAAI, 1997.
11. M. Davis and G. Logemann and D. Loveland, "A machine program for theorem proving", Journal of the ACM, vol. 5, 1962.
12. R. Dechter, "Enhancement Schemes for Constraint Processing: Backjumping, Learning, and Cutset Decomposition", Artificial Intelligence, pages 273-312, vol. 41, n.3, 1990.
13. R. Fraer, G. Kamhi, B. Ziv, M. Vardi, L. Fix, "Efficient Reachability Computation Both for Verification and Falsification", Proceedings of International Conference on Computer-Aided Design, (CAV'00).
14. J.W. Freeman, "Improvements to propositional satisfiability search algorithms", PhD Thesis. University of Pennsylvania, 1995.
15. K.L. McMillan. Symbolic Model Checking: an Approach to the State Explosion Problem. Kluwer Academic Publishers, 1993.
16. D.A. Plaisted and S. Greenbaum, "A Structure-preserving Clause Form Translation", Journal of Symbolic Computation, vol.2, pages=293-304, 1986.
17. Prover 4.0 Application Programming Reference Manual, Prover Technology AB, 2000. PPI-01-ARM-1.
18. P. Prosser, "Hybrid algorithms for the constraint satisfaction problem", Computational Intelligence, vol. 9, n. 3, pages 268-299, 1993.
19. O. Shtrichman, "Tuning SAT checkers for Bounded Model-Checking" Proc. Of Computer Aided Verification, 2000 (CAV'00).
20. M. Sheeran, S. Singh and G. Staalmarck, "Checking safety properties using induction and a SAT solver" Proceedings of Formal Methods in Computer Aided Design 2000 (FMCAD00)
21. J.P. Marques Silva and Karem A. Sakallah. GRASP - a new search algorithm for satisfiability.Technical report, University of Michigan, April 1996.
22. M. Sheeran and G. Stalmarck. A tutorial on Stalmarck's proof procedure for propositional logic. In Proc. of the 2nd International Conference on Formal Methods in Computer Aided Design (FMCAD '98), volume 1522 of LNCS, pages 82-99, Berlin, 1998. Springer.
23. G. Stalmarck. System for Determining Propositional Logic Theorems by Applying Values and Rules to Triplets that are Generated From Boolean Formula. Swedish Patent No. 467076 (approved 1992), US Patent No. 5276897 (1994), European Patent No. 0403454 (1995), 1989.
24. A. Tacchella. "SAT Based decision procedures for knowledge representation and Formal Verification". PhD Thesis. University of Genova. 2000.
25. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining Decision Diagrams and SAT Procedures for Efficient Symbolic Model Checking. In Proc. of the 12th International Conference on Computer Aided Verification (CAV 2000), volume 1855 of LNCS, pages 124-138, Berlin, 2000. Springer.
26. J. Yang, A. Tiemeyer. " Lazy Symbolic Model Checking". DAC'00.
27. H. Zhang. SATO: An efficient propositional prover. In William McCune, editor, Proceedings of the 14th International Conference on Automated deduction, volume 1249 of LNAI, pages 272-275, Berlin, July13-17 1997. Springer.