Verification by network decomposition

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

Volumn 3170, Issue , 2004, Pages 276-291

  Clarke, Edmund ^a   Talupur, Muralidhar ^a   Touili, Tayssir ^a   Veith, Helmut ^b  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

ARBITRARY NETWORKS; CONSTANT SIZES; GENERAL NETWORKS; HOMOGENEOUS PROCESS; LARGE NETWORKS; NETWORK DECOMPOSITION; RING TOPOLOGY; SMALL NETWORKS;

MODEL CHECKING;

EID: 33749545831     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28644-8_18     Document Type: Article

References (26)

1. P. A. Abdulla, B. Jonsson, M. Nilsson, and J. d'Orso. Regular model-checking made simple and efficient. In In Proceedings 13th International Conference on Concurrency Theory (CONCUR), volume 2421 of Lecture Notes in Computer Science, pages 116-130. Springer-Verlag, 2002.
2. K. Apt and D. Kozen. Limits for automatic verification of finite state concurrent systems. Information Processing Letters, 15:307-309, 1986.
3. T. Arons, A. Pnueli, S. Ruah, and L. Zuck. Parameterized verification with automatically computed inductive assertions. In Proc. 13th Intl. Conf. Computer Aided Verification (CAV), 2001.
4. B. Boigelot, A. Legay, and P. Wolper. Iterating transducers in the large. In 15th Intern. Conf. on Computer Aided Verification (CAV'03). LNCS, Springer-Verlag, 2003.
5. A. Bouajjani, P. Habermehl, and T. Vojnar. Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. In Proceedings of CONCUR'03, 2003.
6. A. Bouajjani, B. Jonsson, M. Nilsson, and T. Touili. Regular model checking. In 12th Intern. Conf. on Computer Aided Verification (CAV'00). LNCS, Springer-Verlag, 2000.
7. A. Bouajjani and T. Touili. Extrapolating tree transformations. In 14th Intern. Conj. on Computer Aided Verification (CAV'02). LNCS, Springer-Verlag, 2002.
8. M. C. Browne, E. M. Clarke, and O. Grumberg. Characterizing finite kripke structures in propositional temporal logic. Theoretical Computer Science, 59:115-131, 1988.
9. M. C. Browne, E. M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, 81:13-31, 1989.
10. E. M. Clarke, T. Filkorn, and S. Jha. Exploiting symmetry in temporal model checking. In Proc. 5th Intl. Conf. Computer Aided Verification (CAV), 1993.
11. B. Courcelle. Graph rewriting: An algebraic and logic approach. B:459-492, 1990.
12. A. E. Emerson and V. Kahlon. Reducing model checking of the many to the few. In 17th International Conference on Automated Deduction, pages 236-254, 2000.
13. A. E. Emerson and V. Kahlon. Model checking larage-scale and parameterized resource allocation systems. In Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), pages 251-265, 2002.
14. A. E. Emerson and V. Kahlon. Model checking guarded protocols. In Eighteenth Annual IEEE Symposium on Logic in Computer Science (LICS), pages 361-370, 2003.
15. A. E. Emerson and V. Kahlon. Rapid parameterized model checking of snoopy cache protocols. In Conference on Tools and Algorithms for Construction and Analysis of Systems (TACAS), pages 144-159, 2003.
16. E. A. Emerson, J. Havlicek, and R. Trefler. Virtual symmetry. In LICS, 2000.
17. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In ACM Symposium on Principles of Programming Languages (POPL'95), 1995.
18. E. A. Emerson and A. Sistla. Utlizing symmetry when model-checking under fairness assumptions: An automata theoretic approach. TOPLAS, 4, 1997.
19. E. A. Emerson and A. P. Sistla. Symmetry and model checking. In Proc. 5th Intl. Conf. Computer Aided Verification (CAV), 1993.
20. E. A. Emerson and R. Trefler. Prom asymmetry to full symmetry. In CHARME, 1999.
21. S. M. German and A. P. Sistla. Reasoning about systems with many processes. Journal of ACM, 39, 1992.
22. Y. Kosten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In O. Grumberg, editor, Proc. CAV'97, volume 1254 of LNCS, pages 424-435. Springer, June 1997.
23. S. K. Lahiri and R. E. Bryant. Indexed predicate discovery for unbounded system verification". In Proc. CAV'04. To appear.
24. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. In Lecture Notes in Computer Science, 2001.
25. I. Suzuki. Proving properties of a ring of finite state machines. Information Processing Letters, 28:213-214, 1988.
26. T. Touili. Widening Techniques for Regular Model Checking. In 1st vepas workshop. volume 50 of Electronic Notes in Theoretical Computer Science, 2001.