Verification of parameterized protocols

Journal of Universal Computer Science

Volumn 7, Issue 2, 2001, Pages 141-158

  Baukus, Kai ^a   Lakhnech, Yassine ^b   Stahl, Karsten ^a  

^a UNIVERSITY OF KIEL   (Germany)

^b VERIMAG   (France)

Author keywords

Abstraction; Model checking; Parameterized systems; Verification; WS1S Category: F.3.1

Indexed keywords

EID: 3242679233     PISSN: 0958695X     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (22)

1. [AK86] K. Apt and D. Kozen. Limits for Automatic Verification of Finit-State Concurrent Systems. Information Processing Letters, 22(6):307-309, 1986.
2. [BBLS00] K. Baukus, S. Bensalem, Y. Lakhnech, and K. Stahl. Abstracting WS1S Systems to Verify Parameterized Networks. In S. Graf and M. Schwartzbach, editors, TACAS'OO, volume 1785. Springer, 2000.
3. [BCG89] M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many identical finite state processes. Information and Computation, 1989.
4. [BLS00] K. Baukus, Y. Lakhnech, and K. Stahl. Verifying Universal Properties of Parameterized Networks. Technical Report TR-ST-00-4, CAU Kiel, 2000.
5. [BücGO] J.R. Büchi. Weak Second-Order Arithmetic and Finite Automata. Z. Math. Logik Grundl. Math., 6:66-92, 1960.
6. [CGJ95] E. Clarke, O. Grumberg, and S. Jha. Verifying Parameterized Networks using Abstraction and Regular Languages. In I. Lee and S. Smolka, editors, CONCUR '95: Concurrency Theory, LNCS. Springer, 1995.
7. [CGL94] E. M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5), 1994.
8. [DGG94] D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems: Abstractions preserving ACTL*, ECTL* and CTL*. In E.-R. Olderog, editor, Proceedings of PROCOMET '94. North-Holland, 1994.
9. [Elg61] C.C. Elgot. Decision problems of finite automata design and related arithmetics. Trans. Amer. Math. Soc., 98:21-52, 1961.
10. [EN95] E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In 22nd ACM Symposium on Principles of Programming Languages, pages 85-94, 1995.
11. [EN96] E. A. Emerson and K. S. Namjoshi. Automatic verification of parameterized synchronous systems. In 8th Conference on Computer Aided Verification, LNCS 1102, pages 87-98, 1996.
12. [GS92] S.M. German and A.P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 39(3):675-735, 1992.
13. +96] J.G. Henriksen, J. Jensen, M. Jørgensen, N. Klarlund, B. Paige, T. Rauhe, and A. Sandholm. Mona: Monadic Second-Order Logic in Practice. In TACAS '95, volume 1019 of LNCS. Springer, 1996.
14. [HLR92] N. Halbwachs, F. Lagnier, and C. Ratel. An experience in proving regular networks of processes by modular model checking. Acta Informatica, 22(6/7), 1992.
15. [KLR97] Shmuel Katz, Pat Lincoln, and John Rushby. Low-overhead time-triggered group membership. In Marios Mavronicolas and Philippas Tsigas, editors, 11th International Workshop on Distributed Algorithms (WDAG '97), volume 1320 of Lecture Notes in Computer Science, pages 155-169, Saarbrücken Germany, September 1997. Springer-Verlag.
16. [KM89] R.P. Kurshan and K. McMillan. A structural induction theorem for processes. In ACM Symp. on Principles of Distributed Computing, Canada, pages 239-247, Edmonton, Alberta, 1989.
17. +97] Y. Resten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic Model Checking with Rich Assertional Languages. In O. Grumberg, editor, Proceedings of CAV '97, volume 1256 of LNCS, pages 424-435. Springer, 1997.
18. +95] C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 6(1), 1995.
19. [LHR97] D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In POPL '97, Paris, 1997.
20. [SG89] Z. Stadier and O. Grumberg. Network grammars, communication behaviours and automatic verification. In Proc. Workshop on Automatic Verification Methods for Finite State Systems, Lecture Notes in Computer Science, pages 151-165, Grenoble, France, 1989. Springer Verlag.
21. [Tho90] W. Thomas. Automata on infinite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Methods and Semantics, pages 134-191. Elsevier Science Publishers B. V., 1990.
22. [WL89] P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants (extended abstract). In Sifakis, editor, Workshop on Computer Aided Verification, LNCS 407, pages 68-80, 1989.