Regular model checking

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

Volumn 1855, Issue , 2000, Pages 403-418

  Bouajjani, Ahmed ^a   Jonsson, Bengt ^b   Nilsson, Marcus ^b   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b Dept of Computer Systems ^*  (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; PARAMETERIZATION; TOPOLOGY;

ALGORITHMIC VERIFICATION; COMPLEMENTARY TECHNIQUES; INFINITE STATE SYSTEMS; PARAMETERIZED SYSTEM; REGULAR MODEL CHECKING; REGULAR PROPERTIES; TRANSITION RELATIONS; TRANSITIVE CLOSURE;

MODEL CHECKING;

EID: 84944413844     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_31     Document Type: Conference Paper

References (24)

1. Parosh Aziz Abdulla, Ahmed Bouajjani, and Bengt Jonsson. On-the-fly analysis of systems with unbounded, lossy _fo channels. In Proc. 10th CAV, volume 1427 of LNCS, pages 305-318, 1998.
2. Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In Proc. 11th CAV, volume 1633 of LNCS, pages 134-145, 1999.
3. 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.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pus- hdown Automata: Application to Model Checking. In Proc. CONCUR '97. LNCS 1243, 1997.
5. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In Alur and Henzin- ger, editors, Proc. 8th CAV, volume 1102 of LNCS, pages 1-12. Springer Verlag, 1996.
6. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In Proc. of the Fourth International Static Analysis Symposium, LNCS. Springer Verlag, 1997.
7. A. Bouajjani and P. Habermehl. Symbolic reachability analysis of fifo- channel systems with nonregular sets of configurations. In Proc. ICALP '97, volume 1256 of LNCS, 1997.
8. B. Boigelot and P. Wolper. Symbolic verification with periodic sets. In Proc. 6th CAV, volume 818 of LNCS, pages 55-67. Springer Verlag, 1994.
9. Didier Caucal. On the regular structure of prefix rewriting. Theoretical Computer Science, 106(1):61-86, Nov. 1992.
10. P. Cousot and R. Cousot. Abstract interpretation: A unified model for static analysis of programs by construction or approximation of fixpoints. In Proc. 4th POPL, pages 238-252, 1977.
11. Patrick Cousot and Nicholas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78. ACM, 1978.
12. H. Comon and Y. Jurski. Multiple counters automata, safety analysis and presburger arithmetic. In CAV'98. LNCS 1427, 1998.
13. L. Fribourg and H. Olsén. Reachability sets of parametrized rings as regular languages. In Proc. 2nd INFINITY'97, volume 9 of Electronical Notes in Theoretical Computer Science. Elsevier Science Publishers, July 1997.
14. 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.
15. N. Halbwachs. Delay Analysis in Synchronous Programs. In CAV'93. LNCS 697, 1993.
16. J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic second-order logic in practice. In Proc. TACAS '95, 1th TACAS, volume 1019 of LNCS, 1996.
17. Bengt Jonsson and Marcus Nilsson. Transitive closures of regular relati- ons for verifying infinite-state systems. In Proc. TACAS '00, 6th TACAS, LNCS, 2000. to appear.
18. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. 9th CAV, volume 1254, pages 424-435, Haifa, Israel, 1997. Springer Verlag.
19. P. Kelb, T. Margaria, M. Mendler, and C. Gsottberger. Mosel: A flexible toolset for monadic second-order logic. In Proc. TACAS '97, Enschede (NL), volume 1217 of LNCS (LNCS), pages 183-202, Heidelberg, Germany, March 1997. Springer-Verlag.
20. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In 24th POPL, Paris, January 1997.
21. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In Proc. 12th CAV, 2000. In this Volume.
22. A. Prasad Sistla. Parametrized verification of linear networks using au- tomata as invariants. In O. Grumberg, editor, Proc. 9th CAV, volume 1254 of LNCS, pages 412-423, Haifa, Israel, 1997. Springer Verlag.
23. M. Y. Vardi and P. Wolper. An automata-theoretic approach to au- tomatic program verification. In Proc. 1st LICS, pages 332-344, June 1986.
24. Pierre Wolper and Bernard Boigelot. Verifying systems with infinite but regular state spaces. In Proc. 10th CAV, volume 1427 of LNCS, pages 88-97, Vancouver, July 1998. Springer Verlag.