A survey of regular model checking

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

Volumn 3170, Issue , 2004, Pages 35-48

  Abdulla, Parosh Aziz ^a   Jonsson, Bengt ^a   Nilsson, Marcus ^a   Saksena, Mayank ^a  

^a Dept of Information Technology ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SURVEYS;

ALGORITHMIC VERIFICATION; FINITE STATE PROCESS; FINITE STATE TRANSDUCERS; INFINITE STATE SYSTEMS; PARAMETERIZED SYSTEM; REGULAR MODEL CHECKING; TRANSITION RELATIONS; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 35048892463     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_3     Document Type: Article

References (35)

1. h Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 305-318, 1998.
2. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
3. th Int. Conf. on Computer Aided Verification, 2004. to appear.
4. th Int. Conf. on Concurrency Theory, volume 2421 of Lecture Notes in Computer Science, pages 116-130, 2002.
5. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 236-248, 2003.
6. [BCMD92] J.R. Burch, E.M. Clarke, K.L. McMillan, and D.L. Dill. Symbolic model checking: 1020 states and beyond. Information and Computation, 98:142-170, 1992.
7. [BEM97] A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In Proc. Intern. Conf. on Concurrency Theory (CONCUR'97). LNCS 1243, 1997.
8. th Int. Conf. on Computer Aided Verification, volume 1102 of Lecture Notes in Computer Science, pages 1-12. Springer Verlag, 1996.
9. [BGWW97] B. Boigelot, P. Godefroid, B. Willems, and P.'Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, Lecture Notes in Computer Science. Springer Verlag, 1997.
10. th International Colloquium on Automata, Languages, and Programming, volume 1256 of Lecture Notes in Computer Science, 1997.
11. th nt. Conf. on Computer Aided Verification, 2004. to appear.
12. th Int. Con/, on Computer Aided Verification, volume 1855 of Lecture Notes in Computer Science, pages 403-418. Springer Verlag, 2000.
13. [BK98] D.A. Basin and N. Klarlund. Automata based symbolic reasoning in hardware verification. Formal Methods in Systems Design, 13(3):255-288, November 1998.
14. th Int. Conf. on Computer Aided Verification, volume 2725 of Lecture Notes in Computer Science, pages 223-235, 2003.
15. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 2988 of Lecture Notes in Computer Science, pages 561-575. Springer Verlag, 2004.
16. th Int. Conf. on Computer Aided Verification, volume 2404 of Lecture Notes in Computer Science, 2002.
17. th Int. Conf. on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 55-67. Springer Verlag, 1994.
18. [Cau92] Didier Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(l):61-86, Nov. 1992.
19. [CES86] E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specification. ACM Trans, on Programming Languages and Systems, 8(2):244-263, April 1986.
20. [CJ98] H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In CAV'98. LNCS 1427, 1998.
21. [DLS01] D. Dams, Y. Lakhnech, and M. Stoffen. Iterating transducers. In G. Berry, H. Comon, and A. Finkel, editors, Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, 2001.
22. [ES01] J. Esparza and S. Schwoon. A BDD-based model checker for recursive programs. In Berry, Comon, and Finkel, editors, Proc. 13 Int. Conf. on Computer Aided Verification, volume 2102 of Lecture Notes in Computer Science, pages 324-336, 2001.
23. [FP01] Dana Fisman and Amir Pnueli. Beyond regular model checking. In Proc. 21th Conference on the Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, December 2001.
24. [FWV/97] A. Finkel, B. Willems, , and P. Wolper. A direct symbolic approach to model checking pushdown systems (extended abstract). In Proc. Infinity'97, Electronic Notes in Theoretical Computer Science, Bologna, Aug. 1997.
25. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1019 of Lecture Notes in Computer Science, 1996.
26. th Int. Conf. on Tools and Algorithms for the Construction and Analysis of Systems, volume 1785 of Lecture Notes in Computer Science, 2000.
27. [KMM+01] Y. Resten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256:93-112, 2001.
28. th International Colloquium on Automata, Languages, and Programming, volume 1443 of Lecture Notes in Computer Science, pages 1-16. Springer Verlag, 1998.
29. [Lam94] L. Lamport. The temporal logic of actions. ACM Trans, on Programming Languages and Systems, 16(3):872-923, May 1994.
30. [PS81] G.E. Peterson and M.E. Stickel. Myths about the mutai exclusion problem. Information Processing Letters, 12(3):115-116, June 1981.
31. [QS82] J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in cesar. In 5th International Symposium on Programming, Turin, volume 137 of Lecture Notes in Computer Science, pages 337-352. Springer Verlag, 1982.
32. [Tou01] T. Touili. Regular Model Checking using Widening Techniques. Electronic Notes in Theoretical Computer Science, 50(4), 2001.
33. Proc. Workshop on Verification of Parametrized Systems (VEPAS'01, ), Crete, July, 2001.
34. st IEEE Int. Symp. on Logic in Computer Science, pages 332-344, June 1986.
35. [WB98] Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th Int. Conf. on Computer Aided Verification, volume 1427 of Lecture Notes in Computer Science, pages 88-97, Vancouver, July 1998. Springer Verlag.