A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes-Reference-Cited by-同舟云学术

A Generic Framework for Reasoning about Dynamic Networks of Infinite-State Processes

Published:2009-04-22 Issue:2 Volume:5 Page:
ISSN:1860-5974
Container-title:Logical Methods in Computer Science
language:en
Short-container-title:Log.Meth.Comput.Sci.

Author:

Bouajjani Ahmed,Drăgoi Cezara,Enea Constantin,Jurski Yan,Sighireanu Mihaela

Publisher

Centre pour la Communication Scientifique Directe (CCSD)

Subject

General Computer Science,Theoretical Computer Science

Reference38 articles.

1. A. Annichini, E. Asarin, and A. Bouajjani. Symbolic techniques for parametric reasoning about counter and clock systems. InProceedings of CAV}, volume 1855 of {\em LNCS, pages 419-434. Springer-Verlag, July 2000.

2. P. A. Abdulla and G. Delzanno. On the Coverability Problem for Constrained Multiset Rewriting. InProceedings of AVIS, Satellite workshop of ETAPS, 2006.

3. P. A. Abdulla, G. Delzanno, N. Ben Henda, and A. Rezine. Regular model checking without transducers (on efficient verification of parameterized systems). InProceedings of TACAS}, volume 4424 of {\em LNCS, pages 721-736. Springer-Verlag, 2007.

4. P. A. Abdulla, N. Ben Henda, G. Delzanno, and A. Rezine. Handling parameterized systems with non-atomic global conditions. InProceedings of VMCAI}, volume 4905 of {\em LNCS, pages 22-36. Springer-Verlag, 2008.

5. P. A. Abdulla and B. Jonsson. Verifying networks of timed processes (extended abstract). InProceedings of TACAS}, volume 1384 of {\em LNCS, pages 298-312. Springer-Verlag, 1998.

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

1. Reachability Predicates for Graph Assertions;Lecture Notes in Computer Science;2016