Reachability analysis of process rewrite systems

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

Volumn 2914, Issue , 2003, Pages 74-87

  Bouajjani, Ahmed ^a   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

FORESTRY; MULTITASKING; PETRI NETS; SOFTWARE ENGINEERING;

MULTI-THREADED PROGRAMS; PARALLEL COMPOSITION; PROCESS REWRITE SYSTEMS; PUSHDOWN SYSTEMS; REACHABILITY ANALYSIS; REACHABILITY SET; SEQUENTIAL COMPOSITIONS; STRUCTURAL EQUIVALENCE;

AUTOMATA THEORY;

COMPUTER PROGRAMS; MODELS; TREES;

EID: 35248872936     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24597-1_7     Document Type: Article

References (12)

1. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997.
2. A. Bouajjani, J. Esparza, and T. Touili. A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. In POPL'03, 2003.
3. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 1997.
4. M. Dauchet and S. Tison. The theory of ground rewrite systems is decidable. In LICS'90, 1990.
5. J. Esparza, D. Hansel, P. Rossmanith, and S. Schwoon. Efficient algorithm for model checking pushdown systems. In CAV'00, volume 1885 of LNCS, 2000.
6. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FOSSACS'99. LNCS 1578, 1999.
7. J. Esparza and A. Podelski. Efficient Algorithms for Pre * and Post * on Interprocedural Parallel Flow Graphs. In POPL'00, 2000.
8. J. Esparza. Grammars as processes. In Formal and Natural Computing. LNCS 2300, 2002.
9. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity'97, volume 9 of ENTCS, 1997.
10. R. Gilleron and A. Deruyver. The Reachability Problem for Ground TRS and Some Extensions. In TAPSOFT'89. LNCS 351, 1989.
11. D. Lugiez and Ph. Schnoebelen. The regular viewpoint on PA-processes. In CONCUR'98. LNCS 1466, 1998.
12. R. Mayr. Decidability and complexity of model checking problems for infinite-state systems. Phd. thesis, TU Munich, 1998.