Bounded model checking for past LTL

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

Volumn 2619, Issue , 2003, Pages 18-33

  Benedetti, Marco ^a   Cimatti, Alessandro ^a  

^a ITC IRST   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ENCODING (SYMBOLS); SEMANTICS; TEMPORAL LOGIC;

APPLICATION AREA; BOUNDED MODEL CHECKING; ENCODING SCHEMES; EXPERIMENTAL EVALUATION; FUTURE TEMPORAL LOGIC; LINEAR TEMPORAL LOGIC; REACTIVE SYSTEM; REQUIREMENT ENGINEERING;

MODEL CHECKING;

EID: 35248854973     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_3     Document Type: Article

References (25)

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. F. Bacchus and F. Kabanza. Control Strategies in Planning. In Proc. of the AAAI Spring Symposium Series on Extending Theories of Action: Formal Theory and Practical Applications, pages 5-10, Stanford University, CA, USA, March 1995.
3. J. Baumgartner, A. Kuehlmann, and J. Abraham. Property Checking via Structural Analysis. In Proc. CAV'02, volume 2404, pages 151-165, 2002.
4. M. Benedetti and A. Cimatti. Bounded Model Checking for Past LTL. Technical Report 0301-05, ITC-Irst, Trente, Italy, 2003.
5. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu. Symbolic Model Checking without BDDs. LNCS, 1579:193-207, 1999.
6. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic Model Checking Using SAT Procedures instead of BDDs. In Proc. DAC'99, pages 317-320, 1999.
7. A. Biere, E. Clarke, R. Raimi, and Y. Zhu. Verifying Safety Properties of a Power PC Microprocessor Using Symbolic Model Checking without BDDs. In Proc CAV99, volume 1633 of LNCS. Springer, 1999.
8. J. Castro, M. Kolp, and J. Mylopoulos. A Requirements-Driven Development Methodology. In Proc. of the 13th Int.nl Conf. on Advanced Information Systems Engineering, 2001.
9. A. Cimatti, E. M. Clarke, E. Giunchiglia, F. Giunchiglia, M. Pistore, M. Roveri, R. Sebastiani, and A. Tacchella. NuSMV 2: An OpenSource Tool for Symbolic Model Checking. In Proc. of Int.nl Conf. on Computer-Aided Verification (CAV 2002), 2002.
10. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifier. In N. Halbwachs and D. Peled, editors, Proceedings Eleventh Conference on Computer-Aided Verification (CAV'99), number 1633 in LNCS, pages 495-499, 1999.
11. A. Cimatti, E. Giunchiglia, M. Roveri, M. Pistore, R. Sebastiani, and A. Tacchella. Integrating BDD-based and SAT-based Symbolic Model Checking. In Proceeding of 4th International Workshop on Frontiers of Combining Systems (FroCoS'2002), 2002.
12. E. Clarke, O. Grumberg, and K. Hamaguchi. Another Look at LTL Model Checking. Formal Methods in System Design, 10:47-71, 1997.
13. F. Copty, L. Fix, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Proceedings of CAV 2001, pages 436-453, 2001.
14. E.A. Emerson. Temporal and Modal Logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 995-1072. Elsevier Science Publisher B.V., 1990.
15. A. Fuxman. Formal Analysis of Early Requirements Specifications. PhD thesis, University of Toronto, Toronto, Canada, 2001.
16. Dov Gabbay. The Declarative Past and Imperative Future. In Proceedings of the Colloquium on Temporal Logic and Specifications, volume 398, pages 409-448. Springer-Verlag, 1987.
17. S. Gnesi, D. Latella, and G. Lenzini. Formal Verification of Cryptographic Protocols using History Dependent Automata. In Proc. of the 4th Workshop on Sistemi Distribuiti: Algoritmi, Architetture e Linguaggi, 1999.
18. O. Kupferman, N. Piterman, and M. Vardi. Extended Temporal Logic Revisited. In Proc. 12th Int.nl Conf. on Concurrency Theory, number 2154 in LNCS, pages 519-534, 2001.
19. F. Laroussinie and Ph. Schnoebelen. A Hierarchy of Temporal Logics with Past. Theoretical Computer Science, 148:303-324, 1995.
20. M. W. Moskewicz, C. F. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. of the 38th Design Automation Conference, 2001.
21. M. Sheeran, S. Singh, and G. Stalmarck. Checking safety properties using induction and a SAT-solver. In Proc. Int.nl Conf. on Formal Methods in Computer-Aided Design, 2000.
22. O. Shtrichmann. Tuning SAT Checkers for Bounded Model Checking. In Proc. CAV'2000, volume 1855 of LNCS. Springer, 2000.
23. A. van Lamsweerde. Goal-Oriented Requirements Engineering: A Guided Tour. In Proc. 5th IEEE International Symposium on Requirements Engineering, pages 249-263, 2001.
24. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In Proceedings of the First Annual Symposium on Logic in Computer Science, 1986.
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. CAV'2000, volume 1855 of LNCS, pages 124-138. Springer, 2000.