Symbolic systems, explicit properties: On hybrid approaches for LTL symbolic model checking

Lecture Notes in Computer Science

Volumn 3576, Issue , 2005, Pages 350-363

  Sebastian, Roberto ^a   Tonetta, Stefano ^a   Vardi, Moshe Y ^b  

^a UNIVERSITY OF TRENTO   (Italy)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

STATE SPACES; SYMBOLIC STATES;

ENCODING (SYMBOLS); NUMERICAL METHODS; SEMANTICS;

MATHEMATICAL MODELS;

EID: 26444612045     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. A. Biere, C. Artho, and V. Schuppan. Liveness Checking as Safety Checking. Electr. Notes Theor. Comput. Sci., 66(2), 2002.
2. A. Biere, E. M. Clarke, and Y. Zhu. Multiple State and Single State Tableaux for Combining Local and Global Model Checking. In Correct System Design, pp 163-179, 1999.
3. R. Bloera, K. Ravi, and F. Somenzi. Efficient Decision Procedures for Model Checking of Linear Time Logic Properties. In CAV, pp 222-235, 1999.
4. R. K. Brayton, G. D. Hachtel, A. Sangiovanni-Vincentelli, F. Somenzi, A. Aziz, S. T. Cheng, S. Edwards, S. Khatri, Y. Kukimoto, A. Pardo, S. Qadeer, R. K. Ranjan, S. Sarwary, T. R. Shiple, G. Swamy, and T. Villa. VIS: a System for Verification and Synthesis. In CAV, pp 428-432, 1996.
5. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. Computers, 35(8):677-691, 1986.
6. 20 States and Beyond. Information and Computation, 98(2): 142-170, 1992.
7. A. Cimatti, E.M. Clarke, F. Giunchiglia, and M. Roveri. NUSMV: a new Symbolic Model Verifier. In CAV, pp 495 - 499, 1999.
8. A. Cimatti, M. Roveri, and P. Bertoli. Searching Powerset Automata by Combining Explicit-State and Symbolic Model Checking. In TACAS, pp 313-327, 2001.
9. E. M. Clarke, O. Grumberg, and K. Hamaguchi. Another Look at LTL Model Checking. Formal Methods in System Design, 10(1):47-71, 1997.
10. C. Courcoubetis, M.Y. Vardi, P. Wolper, and M. Yannakakis. Memory-Efficient Algorithms for the Verification of Temporal Properties. Formal Methods in System Design, 1(2/3):275-288, 1992.
11. N. Daniele, F. Guinchiglia, and M.Y. Vardi. Improved automata generation for linear temporal logic. In CAV, pp 249-260, 1999.
12. E.A. Emerson and C.L. Lei. Efficient Model Checking in Fragments of the Propositional μ-Calculus. In LICS, pp 267-278, 1986.
13. K. Etessami and G. J. Holzmann. Optimizing Biichi Automata. In CONCUR, pp 153-167, 2000.
14. K. Etessami, T. Wilke, and R. A. Schuller. Fair Simulation Relations, Parity Games, and State Space Reduction for Büchi Automata. In ICALP, pp 694-707, 2001.
15. K. Fisler, R. Fraer, G. Kamhi, M.Y. Vardi, and Z. Yang. Is there a best symbolic cycle-detection algorithm? In TACAS, pp 420-434, 2001.
16. R. Fraer, G. Kamhi, B. Ziv, M. Y. Vardi, and L. Fix. Prioritized Traversal: Efficient Reachability Analysis for Verification and Falsification. In CAV, pp 389-402, 2000.
17. C. Fritz and T. Wilke. State Space Reductions for Alternating Büchi Automata. In FSTTCS, pp 157-168, 2002.
18. P. Gastin and D. Oddoux. Fast LTL to Büchi Automata Translation. In CAV, pp 53-65, 2001.
19. D. Giannakopoulou and F. Lerda. From States to Transitions: Improving Translation of LTL Formulae to Büchi Automata. In FORTE, pp 308-326, 2002.
20. P. Godefroid and G. J. Holzmann. On the Verification of Temporal Properties. In PSTV, pp 109-124, 1993.
21. S. Gurumurthy, R. Bloem, and F. Somenzi. Fair Simulation Minimization. In CAV, pp 610-624, 2002.
22. G. J. Holzmann. The SPIN model checker: Primer and reference manual. Addison Wesley, 2003.
23. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann Publishers Inc., 1996.
24. H. Ochi, K. Yasuoka, and S. Yajima. Breadth-first manipulation of very large binary-decision diagrams. In ICCAD, pp 48-55, 1993.
25. Doron Peled. Combining Partial Order Reductions with On-the-fly Model-Checking. In CAV, pp 377-390, 1994.
26. A. Pnueli. The temporal logic of programs. In FOCS, pp 46-57, 1977.
27. K. Ravi, R. Bloem, and F. Somenzi. A Comparative Study of Symbolic Algorithms for the Computation of Fair Cycles. In FMCAD, pp 143-160, 2000.
28. R. Sebastiani, E. Singerman, S. Tonetta, and M. Y. Vardi. GSTE is Partitioned Model Checking. In CAV, pp 229-241, 2004.
29. R. Sebastiani and S. Tonetta. "More Deterministic" vs. "Smaller" Büchi Automata for Efficient LTL Model Checking. In CHARME, pp 126-140, 2003.
30. F. Somenzi and R. Bloem. Efficient Büchi Automata from LTL Formulae. In CAV, pp 247-263, 2000.
31. A. Valmari. Error Detection by Reduced Reachability Graph Generation. In ATPN, 1988.
32. M.Y. Vardi and P. Wolper. An Automata-Theoretic Approach to Automatic Program Verification. In LICS, pp 332-344, 1986.
33. M.Y. Vardi and P. Wolper. Reasoning about Infinite Computations. Information and Computation, 115(1):1-37, 1994.
34. J. Yang and C.-J.H. Seger. Generalized Symbolic Trajectory Evaluation - Abstraction in Action. In FMCAD, pp 70-87, 2002.