Abstract regular model checking

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

Volumn 3114, Issue , 2004, Pages 372-386

  Bouajjani, Ahmed ^a   Habermehl, Peter ^a   Vojnar, Tomáš ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b BRNO UNIVERSITY OF TECHNOLOGY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; AUTOMATA THEORY; COMPUTER AIDED ANALYSIS; TRANSDUCERS;

INFINITE STATE SYSTEMS; LINKED DATA STRUCTURES; MODELLING SYSTEMS; NOVEL APPLICATIONS; REGULAR MODEL CHECKING;

MODEL CHECKING;

EID: 35048901593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_29     Document Type: Article

References (30)

1. P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. In Proc. of TACAS, volume 1579 of LNCS. Springer, 1999.
2. P. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In Proc. of CAV'98, volume 1427 of LNCS. Springer, 1998.
3. P.A. Abdulla, J. d'Orso, B. Jonsson, and M. Nilsson. Algorithmic improvements in regular model checking. In Proc. of CAV'03, volume 2725 of LNCS. Springer, 2003.
4. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Proc. of CAV'96, volume 1102 of LNCS. Springer, 1996.
5. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. of CAV'94, volume 818 of LNCS, pages 55-67. Springer, 1994.
6. T. Ball and S. K. Rajamani. The SLAM toolkit. In Proc. CAV'01, LNCS. Springer, 2001.
7. K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S systems to verify parameterized networks. In Proc. of TACAS, volume 1785 of LNCS. Springer, 2000.
8. S. Bensalem, Y. Lakhnech, and S. Owre. Computing abstractions of infinite state systems compositionally and automatically. In Proc. of CAV'98, LNCS. Springer, 1998.
9. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In Proc. CAV'03, volume 2725 of LNCS. Springer, 2003.
10. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. of CONCUR'97, LNCS. Springer, 1997.
11. A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of Fifo-Channel Systems with Nonregular Sets of Configurations. Theoretical Computer Science, 221(1-2), 1999.
12. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In Proc. of CAV'00, volume 1855 of LNCS. Springer, 2000.
13. S. Chaki, E. Clarke, A. Groce, J. Ouaknine, O. Strichman, and K. Yorav. Efficient verification of sequential and concurrent c programs. Formal Methods in System Design, 2004. To appear.
14. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Proc. CAV'00, volume 1855 of LNCS. Springer, 2000.
15. D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In Proc. CAV'01, volume 2102 of LNCS. Springer, 2001.
16. S. Das and D.L. Dill. Counter-example based predicate discovery in predicate abstraction. In Formal Methods in Computer-Aided Design, 2002.
17. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithms for model checking pushdown systems. In Proc. of CAV'00, volume 1855 of LNCS. Springer, 2000.
18. A. Finkel and J. Leroux. How to compose presburger-accelerations: Applications to broadcast protocols. In Proc. of FST&TCS'02, volume 2556 of LNCS. Springer, 2002.
19. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Software verification with Blast. In Proc. of 10th SPIN Workshop, volume 2648 of LNCS. Springer, 2003.
20. T.A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In Proc. of POPL'02. ACM Press, 2002.
21. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In Proc. of TACAS'00, volume 1785 of LNCS. Springer, 2000.
22. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. Theoretical Computer Science, 256(1-2), 2001.
23. M. Nilsson. Regular Model Checking. Licentiate Thesis, Uppsala University, Sweden, 2000.
24. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0,1,infinity)-counter abstraction. In Proc. of CAV'02, volume 2404 of LNCS. Springer, 2002.
25. S. Sagiv, T.W. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24(3), 2002.
26. H. Saïdi. Model checking guided abstraction and analysis. In Proc. of SAS'00, volume 1824 of LNCS. Springer, 2000.
27. Stefan Schwoon. Model-Checking Pushdown Systems. PhD thesis, Technische Universität München, 2002.
28. T. Touili. Widening techniques for regular model checking. ENTCS, 50, 2001.
29. G. van Noord. FSA6.2, 2004. http://odur.let.rug.nl/∼vannoord/Fsa/
30. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In Proc. of CAV'98, volume 1427, 1998.