Modularization and abstraction: The keys to practical formal verification

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

Volumn 1450 LNCS, Issue , 1998, Pages 54-71

  Kesten, Yonit ^a   Pnueli, Amir ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MODEL CHECKING; MODULAR CONSTRUCTION;

DEDUCTIVE VERIFICATION; FINITE STATE SYSTEMS; INFINITE STATE SYSTEMS; LINEAR TEMPORAL LOGIC; NETWORK INVARIANTS; REACTIVE SYSTEMS MODELING; TECHNICAL CONTRIBUTION; TEMPORAL FORMULAE;

FORMAL VERIFICATION;

EID: 84896763593     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055757     Document Type: Conference Paper

References (26)

1. S. Bensalem, A. Bouajjani, C. Loiseaux, and J. Sifakis. Properties preserving simulations. CAV'92, Vol. 663 of LNCS, pp 251-263, 1992.
2. st Intl. Conf. on Principles and Practice of Constraint Programming, Vol. 976 of LNCS, pp 589-623, 1995.
3. M.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. PODC'86, pp 240-248, 1986.
4. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fix-points. POPL'77, 1977.
5. E.M. Clarke, O. Grumberg, and K. Hamaguchi. Another look at LTL model checking. CAV'94, Vol. 818 of LNCS, pp 415-427, 1994.
6. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. CONCUR '95, pp 395-407, 1995.
7. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Trans. Prog. Lang. Sys., 16(5):1512-1542, 1994.
8. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking. Model Checking, Abstraction and Composition, Vol. 152 of Nato ASI Series F, pages 477-498. Springer-Verlag, 1996.
9. P. Cousot and N. Halbwachs. Automatic discovery of linear restraints among variables of a program. POPL'78, pp 84-96, 1978.
10. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Sys., 19(2), 1997.
11. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. POPL'95, 1995.
12. E. A. Emerson and K.S. Namjoshi. Automatic verification of parameterized synchronous systems. CAV'96, LNCS, 1996.
13. S. Graf and C. Loiseaux. A tool for symbolic program verification and abstraction. CAV'93, Vol. 697 of LNCS, pp 71-84, 1993.
14. 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.
15. C.N. Ip and D. Dill. Verifying systems with replicated components in Murφ. CAV'96, LNCS, 1996.
16. R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
17. Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. ICALP'98, LNCS, 1998.
18. L. Lamport. Proving the correctness of multiprocess programs. IEEE Trans. Software Engin., 3:125-143, 1977.
19. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. POPL '97, 1997.
20. D. Lehmann, A. Pnueli, and J. Stavi. Impartiality, justice and fairness: The ethics of concurrent termination. ICALP'81, Vol. 115 of LNCS, pp 264-277, 1981.
21. Z. Manna, A. Anuchitanukul, N. Bjørner, A. Browne, E. Chang, M. Colon, L. De Alfaro, H. Devarajan, H. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994.
22. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, New York, 1991.
23. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
24. Z. Shtadler and O. Grumberg. Network grammars, communication behaviors and automatic verification. CAV'89, Vol. 407 of LNCS, pp 151-165, 1989.
25. A.P. Sistla and S.M. German. Reasoning about systems with many processes. J. ACM, 39:675-735, 1992.
26. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. CAV'89, Vol. 407 of LNCS, pp 68-80, 1989.