A generic framework for reasoning about dynamic networks of infinite-state processes

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

Volumn 4424 LNCS, Issue , 2007, Pages 690-705

  Bouajjani, Ahmed ^a   Jurski, Yan ^a   Sighireanu, Mihaela ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER NETWORKS; FORMAL LOGIC; INVARIANCE; PETRI NETS; PROBLEM SOLVING; COMPUTABILITY AND DECIDABILITY;

CONSTRAINED PETRI NETS (CPN); DYNAMIC NETWORKS; GENERIC FRAMEWORK; INFINITE DATA DOMAIN; INFINITE-STATE PROCESSES; INVARIANCE CHECKING; DYNAMIC NETWORK; FIRST ORDER LOGIC; GENERIC FRAMEWORKS; GENERIC MODELS; INFINITE STATE; ITS APPLICATIONS; REACHABILITY ANALYSIS; SATISFIABILITY PROBLEMS;

FINITE AUTOMATA; COLOR;

EID: 37149055478     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71209-1_54     Document Type: Conference Paper

References (31)

1. P. A. Abdulla, K. Cerans, B. Jonsson, and Y-K. Tsay. General decidability theorems for infinite-state systems. In Proc. of LICS'96, pages 313-321, 1996.
2. P. A. Abdulla and G. Delzanno. On the Coverability Problem for Constrained Multiset Rewriting. In Proc. of AVIS'06, Satellite workshop of ETAPS'06, Vienna, Austria, 2006.
3. P. A. Abdulla, B. Jonsson, M. Nilsson, and M. Saksena. A Survey of Regular Model Checking. In Proc. of CONCUR'04, volume 3170 of LNCS. Springer, 2004.
4. Parosh Aziz Abdulla and Bengt Jonsson. Verifying networks of timed processes (extended abstract). In Bernhard Steffen, editor, Proc. of TACAS'98, volume 1384 of LNCS, pages 298-312. Springer, 1998.
5. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. In Proc. of CAV'00. LNCS 1855, 2000.
6. T Arons, A. Pnueli, S. Ruah, J. Xu, and L.D. Zuck. Parameterized Verification with Automatically Computed Inductive Assertions. In Proc. of CAV'01, volume 2102 of LNCS. Springer, 2001.
7. Bernard Boigelot. Symbolic Methods for Exploring Infinite State Space. PhD thesis, Faculté des Sciences, Université de Liège, volume 189, 1999.
8. M. Bojanczyk, C. David, A. Muscholl, Th. Schwentick, and L. Segoufin. Two-variable logic on data trees and XML reasoning. In Proc. of PODS'06. ACM, 2006.
9. M. Bojanczyk, A. Muscholl, Th. Schwentick, L. Segoufin, and C. David. Two-variable logic on words with data. In Proc. of LICS'06. IEEE, 2006.
10. E. Borger, E. Gradei, and Y. Gurevich. The Classical Decision Problem. Perspectives of Mathematical Logic. Springer-Verlag, 1997. Second printing (Universitext) 2001.
11. A. Bouajjani, J. Esparza, and O. Maler. Reachability analysis of pushdown automata: Application to model-checking. In Proc. of CONCUR'97, volume 1243 of LNCS, pages 135-150. Springer, 1997.
12. A. Bouajjani, P. Habermehl, and T. Vojnar. Abstract Regular Model Checking. In Proc. of CAV'04, volume 3114 of LNCS. Springer, 2004.
13. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular Model Checking. In Proc. of CAV'00, volume 1855 of LNCS. Springer, 2000.
14. A. Bouajjani, Y Jurski, and M. Sighireanu. A generic framework for reasoning about dynamic networks of infinite-state processes. Technical Report 2007-01, LIAFA lab, January 2007. Available at http: //www.liafa.jussieu.fr/ ∼abou/publis.html.
15. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular symbolic analysis of dynamic networks of pushdown systems. In Proc. of CONCUR'05, volume 3653 of LNCS. Springer, 2005.
16. A. Bouajjani and T. Touili. On computing reachability sets of process rewrite systems. In Proc. of RTA'05, volume 3467 of LNCS. Springer, 2005.
17. Ahmed Bouajjani. Languages, Rewriting systems, and Verification of Infinte-State Systems. In Proc. of ICALP'01, volume 2076 of LNCS. Springer Pub., 2001.
18. M. Bozzano and G. Delzanno. Beyond Parameterized Verification. In Proc. of TACAS'02, volume 2280 of LNCS, Grenoble, France, 2002. Springer Pub.
19. A. R. Bradley, Z. Manna, and H. B. Sipma. What's decidable about arrays ? In Proc. of VMCAI'06, volume 3855 of LNCS. Springer, 2006.
20. E. M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. TOPLAS, 19(5), 1997.
21. G. Delzanno. An assertional language for the verification of systems parametric in several dimensions. Electr. Notes Theor. Comput. Sci., 50(4), 2001.
22. G. Delzanno, J.-F. Raskin, and L. Van Begin. Towards the automated verification of multithreaded java programs. In TACAS, volume 2280 of LNCS, pages 173-187. Springer, 2002.
23. S. Demri and R. Lazic. LTL with the freeze quantifier and register automata. In Proc. of LICS'06. IEEE, 2006.
24. E. A. Emerson and K. S. Namjoshi. On model checking for non-deterministic infinite-state systems. In LICS'98. IEEE, 1998.
25. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In Proceedings of LICS '99, pages 352-359. IEEE Computer Society, 1999.
26. 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.
27. A. Finkel and Ph. Schnoebelen. Well-structured transition systems everywhere! Theor. Comput. Sci., 256(1-2):63-92, 2001.
28. C. Flanagan, S.N. Freund, and S. Qadeer. Thread-modular verification for shared-memory programs. In Proc. of ESOP'02, pages 262-277. LNCS 2305, 2002.
29. S. M. German and P. A. Sistla. Reasoning about systems with many processes. JACM, 39(3), 1992.
30. P. Wolper and B. Boigelot. Verifying systems with infinite but regular state spaces. In Proc. of CAV98, volume 1427 of LNCS. Springer, 1998.
31. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In Proc. Intern. Workshop on Automatic Verification Methods for Finite State Systems. LNCS 407, 1989.