On computing reachability sets of process rewrite systems

Lecture Notes in Computer Science

Volumn 3467, Issue , 2005, Pages 484-499

  Bouajjani, Ahmed ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DIGITAL ARITHMETIC; INFORMATION RETRIEVAL SYSTEMS; LINEAR PROGRAMMING; MATHEMATICAL MODELS; PROBLEM SOLVING; SET THEORY; TECHNICAL WRITING;

APPROXIMATE ALGORITHMS; PROCESS REWRITE SYSTEMS (PRS); SEMILINEAR SETS; SYMBOLIC REACHABILITY;

COMPUTATION THEORY;

EID: 24944536280     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-32033-3_35     Document Type: Conference Paper

References (39)

1. P. Ammirati, G. Delzanno, P. Ganty, G. Geeraerts, J.-F. Raskin, and L. Van Begin. Babylon: An integrated toolkit for the specification and verification of parameterized systems. In SAVE'02, 2002.
2. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems. In CAV'00. LNCS 1855, 2000.
3. A. Annichini, A. Bouajjani, and M. Sighireanu. TReX: A Tool for Reachability Analysis of Complex Systems. In CAV'01. LNCS 2102, 2001.
4. T. Ball, S. Chaki, and S. K. Rajamani. Parameterized verification of multithreaded software libraries. In TACAS 2001, LNCS 2031, 2001.
5. T. Ball, A. Podelski, and S. K. Rajamani. Boolean and cartesian abstractions for model checking c programs. In TACAS 2001, LNCS 2031, 2001.
6. S. Bardin, A. Finkel, J. Leroux, and L. Petrucci. FAST: Fast Acceleration of Symbolic Transition systems. In CAV'03. LNCS 2725, 2003.
7. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In Proc. CAV'03. LNCS 2725, 2003.
8. B. Boigelot and P. Wolper. Symbolic Verification with Periodic Sets. In CAV'94. LNCS 818, 1994.
9. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997.
10. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In Proc. of the 30th ACM Symp. on Principles of Programming Languages, (POPL'03), 2003.
11. A. Bouajjani, J. Esparza, and T. Touili. Reachability Analysis of Synchronized PA Systems. In Proc. Infinity Workshop, 2004.
12. Ahmed Bouajjani and Tayssir Touili. Reachability Analysis of Process Rewrite Systems. In Proc. 23rd Intern. Conf. on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'03). LNCS 2914, 2003.
13. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets. Research report, 2001.
14. T. Bultan, R. Gerber, and C. League. Verifying Systems With Integer Constraints and Boolean Predicates: A Composite Approach. In Proc. of the Intern. Symp. on Software Testing and Analysis. ACM press, 1998.
15. D. Caucal. On the regular structure of prefix rewriting. Theoret. Comput. Sci., 106:61-86, 1992.
16. T. Colcombet. Rewriting in the partial algebra of typed terms modulo ac. In Electronic Notes in Theoretical Computer Science, volume 68. Elsevier Science Pub., Proc. Infinity Workshop, 2002.
17. Patrick Cousot and Nicholas Halbwachs. Automatic discovery of linear restraints among variables of a program. In POPL'78. ACM, 1978.
18. G. Delzanno, L. Van Begin, and J.-F. Raskin. Attacking symbolic state explosion in parametrized verification. In CAV'01, 2001.
19. G. Delzanno, L. Van Begin, and J.-F. Raskin. Toward the automated verification of multithreaded java programs. In TACAS 2002, 2002.
20. J. Esparza. Petri nets, commutative context-free grammars, and basic parallel processes. In Fundamentals of computation theory, volume 965 of LNCS, 1995.
21. J. Esparza. Grammars as processes. In Formal and Natural Computing. LNCS 2300, 2002.
22. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithm for model checking pushdown systems. In CAV'00, volume 1885 of LNCS, 2000.
23. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FOSSACS'99. LNCS 1578, 1999.
24. J. Esparza and S. Melzer. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16, 2000.
25. J. Esparza and M. Nielsen. Decidability issues for Petri nets - a survey. Bulletin of the EATCS, 52:85-107, 1994.
26. J. Esparza and S. Schwoon. A bdd-based model checker for recursive programs. In In Proc. of CAV'01, number 2102 in Lecture Notes in Computer Science, pages 324-336. Springer-Verlag, 2001.
27. Javier Esparza and Andreas Podelski. Efficient algorithms for pre * and post * on interprocedural parallel flow graphs. In Symposium on Principles of Programming Languages, pages 1-11, 2000.
28. A. Finkel and J. Leroux. How to compose Presburger-accelerations: Applications to broadcast protocols. In FSTTCS'02. LNCS 2556, 2002.
29. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity'97, 1997.
30. J. Hopcroft and J.-J. Pansiot. On The Reachability Problem for 5-Dimensional Vector Addition Systems. Theoret. Comput. Sci., 8, 1979.
31. The Liège Automata-based Symbolic Handler (LASH), 2001. Available at http://www.montefiore.ulg.ac.be/~boigelot/research/lash/.
32. D. Lugiez. Counting and equality constraints for multitree automata. In FoSSaCS 2003, pages 328-342, 2003.
33. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In Proc. 9th Int. Conf. Concurrency Theory (CONCUR'98), Nice, France, Sep. 1998, volume 1466, pages 50-66. Springer, 1998.
34. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, Techn. Univ. of Munich, 1998.
35. S. Qadeer, S.K. Rajamani, and J. Rehof. Procedure Summaries for Model Checking Multithreaded Software. In POPL'04. ACM, 2004.
36. Stefan Schwoon. Model-Checking Pushdown Systems. PhD thesis, Technische Universität München, 2002.
37. H. Seidl, Th. Schwentick, and A. Muscholl. Numerical Document Queries. In PODS'03. ACM press, 2003.
38. Tayssir Touili. Analyse symbolique de systèmes infinis basée sur les automates: Application à la vérification de systèmes paramétrés et dynamiques. Phd. thesis, University of Paris 7, 2003.
39. P. Wolper and B. Boigelot. Verifying Systems with Infinite but Regular State Spaces. In CAV'98. LNCS 1427, 1998.