Bounded model checking with SNF, alternating automata, and Büchi automata

Electronic Notes in Theoretical Computer Science

Volumn 119, Issue 2, 2005, Pages 83-101

  Sheridan, Daniel ^a  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

Author keywords

Alternating automata; Bounded model checking; B chi automata; LTL; SNF

Indexed keywords

AUTOMATION; ENCODING (SYMBOLS); FORMAL LOGIC; MATHEMATICAL MODELS; PROBLEM SOLVING;

BOUNDED MODEL CHECKING; BÜCHI AUTOMATA; LTL; SNF;

AUTOMATA THEORY;

EID: 14644394968     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.12.024     Document Type: Conference Paper

References (17)

1. A. Biere, A. Cimatti, E. Clarke, and Y. Zhu Symbolic model checking without BDDs W. Cleaveland Tools and Algorithms for the Construction and Analysis of Systems 5th International Conference, TACAS'99 Lecture Notes in Computer Science 1579 1999 193 207
2. A. Cimatti, E. Clarke, F. Giunchiglia, and M. Roveri NuSMV: a new Symbolic Model Verifier N. Halbwachs D. Peled Proceedings of the Eleventh Conference on Computer-Aided Verification (CAV'99) Lecture Notes in Computer Science number 1633 1999 495 499
3. A. Cimatti, M. Pistore, M. Roveri, and R. Sebastiani Improving the encoding of LTL model checking into SAT A. Cortesi Third International Workshop on Verification, Model Checking and Abstract Interpretation Lecture Notes in Computer Science 2294 2002 196 207
4. A. Cimatti, M. Roveri, and D. Sheridan Bounded verification of past LTL A.J. Hu A.K. Martin Formal Methods in Computer-Aided Design; 5th International Conference FMCAD 2004 Lecture Notes in Computer Science 2004
5. E.M. Clarke, D. Kroening, J. Ouaknine, and O. Strichman Completeness and complexity of bounded model checking B. Steffen G. Levi Verification, Model Checking, and Abstract Interpretation, 5th International Conference, Proceedings VMCAI 2004, Venice, January 11-13, 2004 Lecture Notes in Computer Science 2937 2004 85 96
6. L. de Moura, H. Rueß, and M. Sorea Lazy theorem proving for bounded model checking over infinite domains A. Voronkov Automated Deduction - CADE-18; 18th International Conference on Automated Deduction Lecture Notes in Computer Science 2392 2002 438 455
7. K. Etessami, and G.J. Holzmann Optimizing Büchi automata C. Palamidessi CONCUR 2000 - Concurrency Theory, 11th International Conference, Proceedings University Park, PA, USA, August 22-25, 2000 Lecture Notes in Computer Science 1877 2000 153 167
8. Fisher, M., A resolution method for temporal logic, in: Proceedings of the Twelfth International Joint Conference on Artificial Intelligence (IJCAI) (1991), pp. 99-104
9. A. Frisch, D. Sheridan, and T. Walsh A fixpoint based encoding for bounded model checking M.D. Aagaard J.W. O'Leary Formal Methods in Computer-Aided Design; 4th International Conference FMCAD 2002 Lecture Notes in Computer Science 2517 2002 238 254
10. C. Fritz Constructing Büchi automata from linear temporal logic using simulation relations for alternating Büchi automata O.H. Ibarra Z. Dang Implementation and Application of Automata. Eighth International Conference (CIAA 2003), Santa Barbara, CA, USA Lecture Notes in Computer Science 2759 2003 35 48
11. P. Gastin, and D. Oddoux Fast LTL to Büchi automata translation G. Berry H. Comon A. Finkel Proceedings of the 13th Conference on Computer Aided Verification (CAV'01) Lecture Notes in Computer Science number 2102 2001 53 65
12. Gerth, R., D. Peled, M. Vardi and P. Wolper, Simple on-the-fly automatic verification of linear temporal logic, in: P. Dembinski and M. Sredniawa, editors, Protocol Specification, Testing and Verification XV, Proceedings of the Fifteenth IFIP WG6.1 International Symposium on Protocol Specification, Testing and Verification, IFIP Conference Proceedings 38 (1995), pp. 3-18
13. T. Latvala, A. Biere, K. Heljanko, and T. Junttila Simple bounded LTL model checking A.J. Hu A.K. Martin Formal Methods in Computer-Aided Design; 5th International Conference FMCAD 2004 Lecture Notes in Computer Science 2004
14. A.J. Martin The design of a self-timed circuit for distributed mutual exclusion H. Fuchs Proceedings of the 1985 Chapel Hill Conference on VLSI 1985 245 260
15. Moskewicz, M., C. Madigan, Y. Zhao, L. Zhang and S. Malik, Chaff: Engineering an efficient SAT solver, in: 39th Design Automation Conference, Las Vegas, 2001, pp. 530-535
16. Sheridan, D., The optimality of a fast CNF conversion and its use with SAT, Technical Report APES-82-2002, APES Research Group (2004), available from http://www.dcs.st-and.ac.uk/~apes/apesreports.html
17. P. Wolper Constructing automata from temporal logic formulas: A tutorial Lectures on Formal Methods in Performance Analysis (First EEF/Euro Summer School on Trends in Computer Science) Lecture Notes in Computer Science 2090 2001 261 277