Control and data abstraction: The cornerstones of practical formal verification

International Journal on Software Tools for Technology Transfer

Volumn 2, Issue 4, 2000, Pages 328-342

  Kesten, Yonit ^a   Pnueli, Amir ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Control abstraction; Data abstraction; Formal verification; Linear temporal logic; Model checking; Network invariant; Safety and liveness property; Weak and strong fairness

Indexed keywords

CONTROL ABSTRACTION; DATA ABSTRACTION; FORMAL VERIFICATIONS; LINEAR TEMPORAL LOGIC; LIVENESS PROPERTIES; NETWORK INVARIANTS; WEAK AND STRONG FAIRNESS;

ABSTRACTING; MODEL CHECKING; MODULAR CONSTRUCTION; TEMPORAL LOGIC;

COMPUTER AIDED LANGUAGE TRANSLATION;

EID: 84896694022     PISSN: 14332779     EISSN: 14332787     Source Type: Journal    
DOI: 10.1007/s100090050040     Document Type: Article

References (35)

1. Abadi, M., Lamport, L.: The existence of refinement mappings. Theoretical Computer Science 82(2): 253-284, May 1991.
2. Bjørner, N., Browne, I. A., Chang, E., Colón, M., Kapur, A., Manna, Z., Sipma, H. B., Uribe, T. E.: STeP: The Stanford Temporal Prover, User'sManual. Technical Report STAN-CSTR-95-1562, Computer Science Department, Stanford University, November 1995.
3. st Intl. Conf. on Principles and Practice of Constraint Programming. LNCS 976. Berlin, Heidelberg, New York: Springer-Verlag, 1995, pp. 589-623.
4. Browne, M. C., Clarke, E. M., Grumberg, O.: Reasoning about networks with many finite state processes. In: Proc. 5th ACM Symp. Princ. of Dist. Comp., pp. 240-248, 1986.
5. Clarke, E. M., Grumberg, O., Hamaguchi, K.: Another look at ltl model checking. In: Dill, D. L. (ed.): Proc. 6th Conference on Computer Aided Verification. LNCS 818. Berlin, Heidelberg, New York: Springer-Verlag, 1994, pp. 415-427.
6. Clarke, E. M., Grumberg, O., Jha, S.: Verifying parametrized networks using abstraction and regular languages. In: 6th International Conference on Concurrency Theory (CONCUR '95), pp. 395-407, Philadelphia, PA, August 1995.
7. Clarke, E. M., Grumberg, O., Long, D. E.: Model checking and abstraction. ACM Trans. Prog. Lang. Sys. 16(5): 1512-1542, 1994.
8. Clarke, E. M., Grumberg, O., Long, D. E.: Model checking. In: Model Checking, Abstraction and Composition, Nato ASI Series Fvolume 152. Berlin, Heidelberg, New York: Springer-Verlag, 1996, pp. 477-498.
9. Cousot, P., Cousot, R.: Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of the 4th Annual Symposium on Principles of Programming Languages. ACM Press, 1977.
10. Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among variables of a program. In: Proc. 5th ACM Symp. Princ. of Prog. Lang., pp. 84-96, 1978.
11. Dams, D., Gerth, R., Grumberg, O.: Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Sys. 19(2), 1997.
12. th Intl. Conference on Computer Aided Veri fication (CAV '96). LNCS. Berlin, Heidelberg, New York: Springer-Verlag, 1996.
13. th Intl. Conference on Computer Aided Veri fication (CAV '96). LNCS. Berlin, Heidelberg, New York: Springer-Verlag, 1996.
14. th Intl. Conference on Computer Aided Verification (CAV '94). LNCS 697. Berlin, Heidelberg, New York: Springer-Verlag, 1993, pp. 71-84.
15. Halbwachs, N., Lagnier, F., Ratel, C.: An experience in proving regular networks of processes by modular model checking. Acta Informatica 29(6/7): 523-543, 1992.
16. th Intl. Conference on Computer Aided Verification (CAV '96). LNCS. Berlin, Heidelberg, New York: Springer-Verlag, 1996.
17. Johnsson, B.: Compositional specification and verification of distributed systems. ACM Trans. Prog. Lang. Sys. 16(2): 259-303, 1994.
18. Kesten, Y., Pnueli, A.: Verification by augmented finitary abstraction. Information and Computation, a special issue. To appear in 2000.
19. Kesten, Y., Pnueli, A., Raviv, L.: Algorithmic verification of linear temporal logic specifications. In: Larsen, K. G., Skyum, S., Winskel, G. (eds.): Proc. 25th Int. Colloq. Aut. Lang. Prog. LNCS 1443. Berlin, Heidelberg, New York: Springer-Verlag, 1998, pp. 1-16.
20. Kurshan, R. P., McMillan, K. L.: A structural induction theorem for processes. Information and Computation 117: 1-11, 1995.
21. Lam, S. S., Shankar, A. U.: Refinement and projection of relational specifications. In: Stepwise refinement of distributed systems. Models, formalismus, correctness. LNCS 430. Berlin, Heidelberg, New York: Springer-Verlag, 1990, pp. 454-486.
22. Lehmann, D., Pnueli, A., Stavi, J.: Impartiality, justice and fairness: The ethics of concurrent termination. In: Proc. 8th Int. Colloq. Aut. Lang. Prog. LNCS 115. Berlin, Heidelberg, New York: Springer-Verlag, 1981, pp. 264-277.
23. Lesens, D., Halbwachs, N., Raymond, P.: Automatic verification of parameterized linear networks of processes. In: 24th ACM Symposium on Principles of Programming Languages, POPL '97, Paris, 1997.
24. Loiseaux, C., Graf, S., Sifakis, J., Bouajjani, A., Bensalem, S.: Property preserving abstractions for the verification of concurrent systems. Formal methods in system design 6(1): 11-44, 1995.
25. Lynch, N., Tuttle, M.: Hierarchical correctness proofs for distributed algorithms. In: Proc. 6th ACM Symp. Princ. of Dist. Comp., 1987, pp. 137-151.
26. Manna, Z., Anuchitanukul, A., Bjørner, N., Browne, A., Chang, E., Colón, M., De Alfaro, L., Devarajan, H., Sipma, H., Uribe, T. E.: STeP: The Stanford Temporal Prover. Technical Report STAN-CS-TR-94-1518, Dept. of Comp. Sci., Stanford University, Stanford, California, 1994.
27. Manna, Z., Pnueli, A.: The temporal logic of reactive and concurrent systems: specification. Springer-Verlag, New York, 1991.
28. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Berlin, Heidelberg, New York: Springer-Verlag, New York, 1995.
29. Orava, F.: Verifying safety and deadlock properties of networks of asynchronously communicating processes. In: Protocol specifications, testing and verification IX. North-Holland, 1989, pp. 352-372.
30. Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science 13: 1-20, 1981.
31. th Intl. Conference on Computer Aided Veri fication (CAV '96). LNCS. Berlin, Heidelberg, New York: Springer-Verlag, 1996, pp. 184-195.
32. Shtadler, Z., Grumberg, O.: Network grammars, communication behaviors and automatic verification. In: Sifakis, J. (ed.): Automatic Verification Methods for Finite State Systems, pp. 151-165. LNCS 407. Berlin, Heidelberg, New York: Springer-Verlag, 1989.
33. Sistla, A. P., German, S. M.: Reasoning about systems with many processes. J. ACM 39: 675-735, 1992.
34. Stark, E. W.: Proving entailments between conceptual state specifications. Theory. Comp. Sci. 56: 135-154, 1988.
35. Wolper, P., Lovinfosse, V.: Verifying properties of large sets of processes with network invariants. In: Sifakis, J. (ed.): Automatic Verification Methods for Finite State Systems. LNCS 407. Berlin, Heidelberg, New York: Springer-Verlag, 1989, pp. 68-80.