Reachability Analysis of Process Rewrite Systems-Reference-Cited by-同舟云学术

Reachability Analysis of Process Rewrite Systems

Published:2003 Issue: Volume: Page:74-87
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Bouajjani Ahmed,Touili Tayssir

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-24597-1_7

Reference12 articles.

1. Lecture Notes in Computer Science;A. Bouajjani,1997

2. Bouajjani, A., Esparza, J., Touili, T.: A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. In: POPL 2003 (2003)

3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on (1997), http://www.grappa.univ-lille3.fr/tata

4. Dauchet, M., Tison, S.: The theory of ground rewrite systems is decidable. In: LICS 1990 (1990)

5. Lecture Notes in Computer Science;J. Esparza,2000

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Context-Bounded Analysis For Concurrent Programs With Dynamic Creation of Threads;Logical Methods in Computer Science;2011-11-23

2. Widening techniques for regular tree model checking;International Journal on Software Tools for Technology Transfer;2011-08-03

3. Refining the Process Rewrite Systems Hierarchy via Ground Tree Rewrite Systems;CONCUR 2011 – Concurrency Theory;2011

4. Verifying Multithreaded Recursive Programs with Integer Variables;Electronic Notes in Theoretical Computer Science;2009-07

5. Verifying Parallel Programs with Dynamic Communication Structures;Implementation and Application of Automata;2009