Regular symbolic analysis of dynamic networks of pushdown systems

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 473-487

  Bouajjani, Ahmed ^a   Müller Olm, Markus ^b   Touili, Tayssir ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b TU DORTMUND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; AUTOMATA THEORY; COMPUTATION THEORY;

BACKWARD REACHABILITY; MULTITHREADED PROGRAMS; PUSHDOWN SYSTEMS;

CONCURRENT ENGINEERING;

EID: 27244451169     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_36     Document Type: Conference Paper

References (19)

1. J. Baeten and W. Weijland. Process algebra. In Cambridge Tracts in Theoretical Computer Science, volume 18, 1990.
2. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model Checking. In CONCUR'97. LNCS 1243, 1997.
3. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In POPL'03. ACM, 2003.
4. A. Bouajjani, J. Esparza, and T. Touili. Reachability Analysis of Synchronised PA systems. In INFINITY'04, to appear in ENTCS, 2004.
5. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular Symbolic Analysis of Dynamic Networks of Pushdown Processes. Technical report, LIAFA lab No 2005-05, and University of Dortmund No 798, June 2005.
6. A. Bouajjani and T. Touili. Reachability Analysis of Process Rewrite Systems. In FSTTCS'03. LNCS 2914, 2003.
7. A. Bouajjani and T. Touili. On Computing Reachability Sets of Process Rewrite Systems. In RTA'05. LNCS, 2005.
8. A. Bruggemann-Klein, M. Murata, and D. Wood. Regular tree and regular hedge languages over unranked alphabets. Research report, 2001.
9. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural data-flow analysis. In FoSSaCS'99, volume 1578 of LNCS, 1999.
10. J. Esparza and A. Podelski. Efficient algorithms for pre* and post* on interprocedural parallel flow graphs. In POPL'00. ACM, 2000.
11. A. Finkel, B. Willems, and P. Wolper. A Direct Symbolic Approach to Model Checking Pushdown Systems. In Infinity'97, ENTCS 9. Elsevier Sci. Pub., 1997.
12. D. Lugiez and P. Schnoebelen. The regular viewpoint on PA-processes. Theoretical Computer Science, 274(1-2):89-115, 2002.
13. R. Mayr. Decidability and Complexity of Model Checking Problems for Infinite-State Systems. Phd. thesis, Technical University Munich, 1998.
14. M. Müller-Olm. Variations on Constants. Habilitationsschrift, Fachbereich Informatik, Universität Dortmund, 2002.
15. M. Müller-Olm. Precise interprocedural dependence analysis of parallel programs. Theoretical Computer Science, 311:325-388, 2004.
16. S. Qadeer, S. Rajamani, and J. Rehof. Procedure Summaries for Model Checking Multithreaded Software. In POPL'04, 2004.
17. S. Qadeer and J. Rehof. Context-Bounded Model-Checking of Concurrent Software. In TACAS'05. LNCS 3440, 2005.
18. H. Seidl and B. Steffen. Constraint-based inter-procedural analysis of parallel programs. In ESOP'2000. LNCS 1782, 2000.
19. T. Touili. Dealing with communication for dynamic multithreaded recursive programs. In 1st VISSAS workshop, March 2005. Invited Paper.