Verification of well-formed communicating recursive state machines

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

Volumn 3855 LNCS, Issue , 2006, Pages 412-426

  Bozzelli, Laura ^a   La Torre, Salvatore ^b   Peron, Adriano ^a  

^a UNIVERSITY OF NAPLES FEDERICO II   (Italy)

^b UNIVERSITY OF SALERNO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; AUTOMATA THEORY; COMMUNICATION; CONCURRENCY CONTROL; MATHEMATICAL MODELS; PROBLEM SOLVING;

COMMUNICATING RECURSIVE STATE MACHINES (CRSM); DECISION ALGORITHMS; MODULES; RECURSIVE STATE MACHINES (RSM);

RECURSIVE FUNCTIONS;

EID: 33745642477     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (18)

1. R. Alur, M. Benedikt, K. Etessami, P. Godefroid, T. Reps, and M. Yannakakis. Analysis of recursive state machines. To appear in ACM Transactions on Programming Languages and Systems, 2005.
2. R. Alur, K. Etessami, and P. Madhusudan. A Temporal Logic of Nested Calls and Returns. In Proc. of TACAS'04, pp. 467-481, 2004.
3. R. Alur, S. Kannan, and M. Yannakakis. Communicating hierarchical state machines. In Proc. of ICALP'99, LNCS 1644, pp. 169-178, 1999.
4. A. Bouajjani, J. Esparza, and O. Maler. Reachability Analysis of Pushdown Automata: Application to Model-Checking. In Proc. of CONCUR'97, LNCS 1243, pp. 135-150, 1997.
5. A. Bouajjani, J. Esparza, and T. Touili. A generic approach to the static analysis of concurrent programs with procedures. In Proc. of POPL'03, pp. 62-73, 2003.
6. A. Bouajjani and T. Touili. Reachability Analysis of Process Rewrite Systems. In Proc. of FSTTCS'03, LNCS 2914, pp. 74-87, 2003.
7. A. Bouajjani, M. Müller-Olm, and T. Touili. Regular Symbolic Analysis of Dynamic Networks of Pushdown Systems. In Proc. of CONCUR'05, LNCS 3653, pp. 473-487, 2005.
8. W.S. Brainerd. Tree generating regular systems. Information and Control, 14: pp. 217-231, 1969.
9. J. Esparza, and M. Nielsen, Decidability Issues for Petri Nets.In J. Inform. Process. Cybernet., EIK 30 (1994) 3, pp. 143-160.
10. J. Esparza and J. Knoop. An automata-theoretic approach to interprocedural parallel flow graphs. In Proc. of FoSSaCS.'99, LNCS 1578, 1999.
11. J. Esparza and A. Podelski. Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. In Proc., of POPL'00, pp. 1-11, 2000.
12. C. Löding. Infinite Graphs Generated by Tree Rewriting. Doctoral thesis, RWTH Aachen, 2003.
13. R. Mayr. Process Rewrite Systems. In Information and Computation, Vol. 156, 2000, pp. 264-286.
14. S. Qadeer and J. Rehof. Context-bounded model checking of concurrent software. In Proc. of TACAS'05, LNCS 3440, pp. 93-107, 2005.
15. W. Thomas. Automata on infinite objets. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B, pp. 133-191, 1990.
16. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2):183-221, 1986.
17. I. Walukiewicz. Pushdown processes: Games and Model Checking.In Int. Conf. on Computer Aided Verification, LNCS 1102, pages 62-74. Verlag, 1996.
18. URL: www.dia.unisa.it/professori/latorre/Papers/concaret.ps.gz