Languages, rewriting systems, and verification of infinite-state systems

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

Volumn 2076 LNCS, Issue , 2001, Pages 24-39

  Bouajjani, Ahmed ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84858747410     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48224-5_3     Document Type: Conference Paper

References (32)

1. P. Abdulla, A. Annichini, and A. Bouajjani. Symbolic Verification of Lossy Channel Systems: Application to the Bounded Retransmission Protocol. In TACAS'99. LNCS 1579, 1999.
2. P. Abdulla, L. Boasson, and A. Bouajjani. Effective Lossy Queue Languages. In ICALP'01. LNCS, Springer-Verlag, 2001.
3. Abdulla, A. Bouajjani, and B. Jonsson. On-the-fly Analysis of Systems with Unbounded, Lossy Fifo Channels. In CAV'98. LNCS 1427, 1998.
4. P.Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling Global Conditions in Parametrized System Verification. In CAV'99. LNCS 1633, 1999.
5. A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A Tool for Reachability Analysis of Complex Systems. In CAV'01. LNCS, Springer-Verlag, 2001.
6. P. Abdulla, K. Cer̄ans, B. Jonsson, and Y.-K. Tsay. General Decidability Theorems for Infinite-State Systems. In LICS'96. IEEE, 1996.
7. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Push down Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997.
8. B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDDs. In CAV'96. LNCS 1102, 1996.
9. B. Boigelot, P. Godefroid, B. Willems, and P. Wolper. The power of QDDs. In SAS'97. LNCS 1302, 1997.
10. A. Bouajjani and P. Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. In ICALP'97. LNCS 1256, 1997. Full version in TCS 221 (1/2), pp 221-250, 1999.
11. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular Model Checking. In CAV'00. LNCS 1855, 2000.
12. A. Bouajjani, A. Muscholl, and T. Touili. Permutation Rewriting and Algorithmic Verification. In LICS'01. IEEE, 2001.
13. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94. LNCS 818, 1994.
14. D. Caucal. On the Regular Structure of Prefix Rewriting. TCS, 106(1):61-86, 1992.
15. P. Cousot and R. Cousot. Static Determination of Dynamic Properties of Recursive Procedures. In IFIP Conf. on Formal Description of Programming Concepts. North-Holland Pub. , 1977.
16. Ǵerard Ćeće, Alain Finkel, and S. Purushothaman Iyer. Unreliable Channels Are Easier to Verify Than Perfect Channels. Inform. and Comput. , 124(1):20-31, 1996.
17. D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In CAV'01. LNCS, Springer-Verlag, 2001.
18. J. Esparza and J. Knoop. An automata-theoretic approach to interpro-cedural dataflow analysis. In FOSSACS'99. LNCS 1578, 1999.
19. J. Esparza and S. Schwoon. A BDD-based Model Checker for Recursive Programs. In CAV'01. LNCS, Springer-Verlag, 2001.
20. L. Fribourg and H. Olśen. Reachability sets of parametrized rings as regular languages. Electronic Notes in Theoretical Computer Science, 1997.
21. A. Finkel, S. Purushothaman Iyer, and G. Sutre. Well-abstracted transition systems. In CONCUR'00. LNCS 1877, 2000.
22. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity'97, 1997.
23. B. Jonsson and M. Nilsson. Transitive Closures of Regular Relations for Verifying Infinite-State Systems. In TACAS'00. LNCS 1785, 2000.
24. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In CAV'97. LNCS 1254, 1997.
25. D. Lugiez, and P. Schnoebelen. The regular viewpoint on PA-processes. In Theoretical Computer Science. to appear, 2001.
26. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite State Systems. PhD Thesis, Technische Universitaet Muenchen, April 1998.
27. R. Mayr. Undecidable Problems in Unreliable Computations. In LATIN'00. LNCS 1776, 2000.
28. F. Moller. Infinite results. In CONCUR'96. LNCS 1119, 1996.
29. A. Pnueli and E. Shahar. Liveness and acceleration in parametrized verification. In CAV'00. LNCS 1855, 2000.
30. J.-E. Pin and P. Weil. Polynomial closure and unambiguous product. Theory of Computing Systems, 30:383-422, 1997.
31. T. Touili. V́erification de Ŕeseaux Paraḿetŕes Baśee sur des Techniques de Ŕéecriture. MSc. Thesis (French DEA) report, Liafa Lab. , University of Paris 7, July 2000. http://verif. liafa. jussieu. fr/touili.
32. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In CAV'98. LNCS 1427, 1998.