Empirically efficient verification for a class of infinite-state systems

Lecture Notes in Computer Science

Volumn 3440, Issue , 2005, Pages 77-92

  Bingham, Jesse ^a   Hu, Alan J ^a  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTABILITY AND DECIDABILITY; CONTEXT FREE GRAMMARS; CONVERGENCE OF NUMERICAL METHODS; ERROR ANALYSIS; MATHEMATICAL MODELS; PETRI NETS; PROBLEM SOLVING;

BROADCAST PROTOCOLS; ERROR STATES; VERIFICATION ALGORITHMS; WELL-STRUCTURED TRANSITION SYSTEMS (WSTS);

FINITE AUTOMATA;

EID: 24644508515     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31980-1_6     Document Type: Conference Paper

References (30)

1. P. Abdulla and B. Jonsson. Verifying programs with unreliable channels. In Proceedings of the Eighth Annual IEEE Symposium on Logic in Computer Science, pages 160-170, 1993.
2. P. A. Abdulla, K. Cerans, B. Jonsson, and T. Yih-Kuen. General decidability theorems for infinite-state systems. In 10th Annual IEEE Symp. on Logic in Computer Science (LICS'96), pages 313-321, 1996.
3. A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A tool for reachability analysis of complex systems. In Proc. 13th Intern. Conf. on Computer Aided Verification (CAV'01), 2001.
4. J. Bingham. A new approach to upward closed set backward reachability analysis. In 6th International Workshop on Verification of Infinite-State Systems (INFINITY), 2004.
5. J. Bingham and A. J. Hu. Empirically efficient verification for a class of infinite-state systems. Extended electronic version of this paper, Lecture Notes in Computer Science number 3440, http://www.springerlink.com/.
6. R. E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, C-35(8):677-691, August 1986.
7. 20 states and beyond. Information and Computation, 98(2), 1992.
8. C.T. Chou, P. K. Mannava, and S. Park. A simple method for parameterized verification of cache coherence protocols. In Formal Methods in Computer-Aided Design, 2004.
9. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Dexter Kozen, editor, Workshop on Logics of Programs, pages 52-71, May 1981. Published 1982 as Lecture Notes in Computer Science Number 131.
10. D. E. Culler, J. P. Singh, and A. Gupta. Parallel Computer Architecture: A Hardware/Software Approach. Morgan Kaufmann, 1998.
11. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In Proceedings of the 12th International Conference on Computer Aided Verification, July 2000.
12. G. Delzanno and J. F. Raskin. Symbolic representation of upward-closed sets. In 6th International Conference Tools and Algorithms for Construction and Analysis of Systems (TACAS), pages 426-440, 2000.
13. G. Delzanno, J. F. Raskin, and L. Van Begin. Attacking symbolic state explosion. In Proceedings of the 13th International Conference on Computer-Aided Verification (CAV), pages 298-310, 2001.
14. E. A. Emerson and V. Kahlon. Exact and efficient verification of parameterized cache coherence protocols. In 12th IFIP Advanced Research Working Conference on Correct Hardware Design and Verification Methods (CHARME), October 2003.
15. E. A. Emerson and V. Kahlon. Model checking guarded protocols. In Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 361-370, June 2003.
16. E. A. Emerson and V. Kahlon. Rapid parameterized model checking of snoopy cache protocols. In 9th International Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), pages 144-159, April 2003.
17. E. A. Emerson and K. S. Namjoshi. On model checking for non-deterministic infinite-state systems. In Proceedings of LICS 1998, pages 70-80, 1998.
18. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proceedings of LICS '99, pages 352-359, 1999.
19. A. Finkel. Reduction and covering of infinite reachability trees. Information and Computation, 89(2):144-179, 1990.
20. A. Finkel and Ph. Schnoebelen. Well structured transition systems everywhere! Theoretical Computer Science, 256(1-2): 63-92, 2001.
21. P. Ganty and L. Van Begin. Non deterministic automata for the efficient verification of infinite-state. presented at: CP+CV Workshop at European Joint Conferences on Theory and Practice of Software (ETAPS), 2004.
22. G. Geeraerts, J.-F. Raskin, and L. Van Begin. Expand, Enlarge and Check: new algorithms for the coverability problem of WSTS. In Proceedings of FSTTCS'04, 24th International Conference on Foundations of Software Technology and Theoretical Computer Science, Chennai, India, pages 287-298, 2004.
23. S. German. Personal correspondence. 2003.
24. T. A. Henzinger, P.-H. Ho, and H. Wong-Toi. Hytech: A model checker for hybrid systems. Software Tools for Technology Transfer, 1:110-122, 1997.
25. G. Higman. Ordering by divisibility in abstract algebras. Proceedings of the London Mathematical Society (3), 2(7):326-336, 1952.
26. S. K. Lahiri and R. E. Bryant. Constructing quantified invariants via predicate abstraction. In Proc. of 5th Intl. Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), pages 267-281, 2004. LNCS 2937.
27. L. Lamport. Specifying Systems: The TLA+ Language and Tools for Hardware and Software Engineers. Addision-Wesley, 2002.
28. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Proceedings of Tools and Algorithms for the Construction and Analysis of Systems (TACAS), pages 82-97, 2001.
29. J.-P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In 5th International Symposium on Programming, pages 337-351. Springer, 1981. Lecture Notes in Computer Science Number 137.
30. F. Somenzi. Colorado university decision diagram package (CUDD) webpage. http://vlsi.colorado.edu/~fabio/CUDD/cuddIntro.html.