Network invariants in action

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

Volumn 2421 LNCS, Issue , 2002, Pages 101-115

  Kesten, Yonit ^a   Pnueli, Amir ^b   Shahar, Elad ^b   Zuck, Lenore ^c  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^c NEW YORK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PHILOSOPHICAL ASPECTS;

DINING PHILOSOPHERS PROBLEM; FINITE STATE SYSTEMS; MODEL CHECKER; NETWORK INVARIANTS; PARAMETERIZED SYSTEM; PROOF RULES; PROPHECY VARIABLES; WIDE SPECTRUM; LTL PROPERTY;

ABSTRACTING;

EID: 84874695049     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45694-5_8     Document Type: Conference Paper

References (26)

1. M. Abadi and L. Lamport. The existence of refinement mappings. Theoretical Computer Science, 82(2):253-284, May 1991.
2. K. R. Apt and D. Kozen. Limits for automatic program verification of finite-state concurrent systems. Information Processing Letters, 22(6), 1986.
3. M. Browne, E. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. PODC'86, pages 240-248.
4. E. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. CONCUR'95, pages 395-407.
5. E. Dijkstra, W. Feijen, and A. van Gasteren. Derivation of a termination detection algorithm for disrtibued computations. Info. Proc. Lett., 16:217-219, 1983.
6. E. Emerson and V. Kahlon. Reducing model checking of the many to the few. In CADE-17, pages 236-255, 2000.
7. E. Emerson and K. Namjoshi. Automatic verification of parameterized synchronous systems. CAV'96, LNCS 1102.
8. N. Halbwachs, F. Lagnier, and C. Ratel. An experience in proving regular networks of processes by modular model checking. Acta Informatica, 29(6/7):523-543, 1992.
9. C. Ip and D. Dill. Verifying systems with replicated components in Murπ. CAV'96, LNCS 1102.
10. Y. Kesten and A. Pnueli. Control and data abstractions: The cornerstones of formalverification. Software Tools for Technology Transfer, 2(4):328-342, 2000.
11. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, a special issue on Compositionality, 163:203-243, 2000.
12. Y. Kesten, A. Pnueli, E. Shahar, and L. D. Zuck. Network invariant in action. Technicalreport, The weizmann Institute of Science, 2002.
13. R. P. Kurshan and K. L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
14. D. Lehmann and M. O. Rabin. On the advantages of free choice: A symmetric and fully distributed solution to the dining philosophers problem. POPL'81, pages 133-138.
15. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. POPL'97.
16. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colón, L. D. Alfaro, H. Devarajan, H. Sipma, and T. Uribe. STeP: The Stanford Temporal Prover. Stanford, California, 1994.
17. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer Verlag, New York, 1991.
18. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
19. A. Pnueli, S. Ruah, and L. Zuck. Automatic deductive verification with invisible invariants. TACAS'01, LNCS 2031, pages 82-97.
20. A. Pnueli and E. Shahar. A platform for combining deductive with algorithmic verification. CAV'96, LNCS 1102, pages 184-195.
21. A. Pnueli, J. Xu, and L. Zuck. Liveness with (0, 1, ∞)-counter abstraction. To appear in CAV'02.
22. A. Roychoudhury and I. Ramakrishnan. Automated inductive verification of parameterized protocols. CAV'01, LNCS 2102.
23. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. CAV'89, LNCS 407, pages 151-165.
24. A. Sistla and S. German. Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
25. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. CAV'89, LNCS 407, pages 68-80.
26. rd workshop on Verification, Model Checking, and Abstract Interpretation, LNCS 2294, 2002.