A perfecto verification: Combining model checking with deductive analysis to verify real-life software

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

Volumn 1708, Issue , 1999, Pages 173-194

  Kesten, Yonit ^a   Klein, Amit ^b   Pnueli, Amir ^c   Raanan, Gil ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b Perfecto Technologies Ltd   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

Concurrent systems; Model checkers (spin promela); Models; Network protocols; Object oriented; Safety properties; Security; Telecommunications; Verification (deductive methods assume guarantee compositional)

Indexed keywords

APPLICATION PROGRAMS; CONCURRENCY CONTROL; FORMAL METHODS; FORMAL VERIFICATION; MODELS; NETWORK PROTOCOLS; NETWORK SECURITY; OBJECT ORIENTED PROGRAMMING; TELECOMMUNICATION; VERIFICATION;

CONCURRENT SYSTEMS; DEDUCTIVE METHODS; OBJECT ORIENTED; PROMELA; SAFETY PROPERTY; SECURITY;

MODEL CHECKING;

EID: 84865779749     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48119-2_12     Document Type: Conference Paper

References (24)

1. [AL93] M. Abadi and L. Lamport. Composing specifications. ACM Trans. Prog. Lang. Sys., 15:73-132, 1993.
2. [AL95] M. Abadi and L. Lamport. Conjoining specifications. ACM Trans. Prog. Lang. Sys., 17(3):507-534, 1995.
3. +95] N. Bjørner, I.A. Browne, E. Chang, M. Colón, A. Kapur, Z. Manna, H.B. Sipma, and T.E. Uribe. STeP: The Stanford Temporal Prover, User's Manual. Technical Report, Stanford University, 1995.
4. [BCM+92] J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. Information and Computation, 98(2):142-170, 1992.
5. [BK85] H. Barringer and R. Kuiper. Hierarchical development of concurrent systems in a temporal logic framework. In Proc. of Seminar on Concurrency, LNCS 197, 1985.
6. [CC95] P. Collete and A. Cau. Parallel composition of assumption-commitment specifications: A unifying approach for shared variables and distributed message passing concurrency. Acta Informatica, 1995.
7. [CGL96] E.M. Clarke, O. Grumberg, and D.E. Long. Model checking. In Model Checking, Abstraction and Composition, volume 152 of Nato ASI Series F, pages 477-498. Springer-Verlag, 1996.
8. [CM81] K.M. Chandy and J. Misra. Proofs of networks of processes. IEEE Trans. Software Engin., 7(4):417-426, 1981.
9. [dR85] W.-P. de Roever. The quest for compositionality - a survey of assertionbased proof systems for concurrent programs, part i: Concurrency based on shared variables. In The Role of Abstract Models in Computer Science, pages 181-206. IFIP, North Holland, 1985.
10. [Hoa84] C.A.R. Hoare. Communicating Sequential Processes. Prentice-Hall, 1984.
11. [Hol91] G.J. Holzmann. Design and Validation of Computer Protocols. Prentice Hall, Engelwood Cliffs, NJ, 1991.
12. [Jon83] C.B. Jones. Tentative steps towards a development method for interfering programs. ACM Trans. Prog. Lang. Sys., 5(4):596-619, 1983.
13. [Jon94] B. Jonsson. Compositional specification and verification of distributed systems. ACM Trans. Prog. Lang. Sys., 16(2):259-303, 1994.
14. [KM95] R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
15. [KP98] Y. Kesten and A. Pnueli. Deductive veri_cation of fair discrete systems. Technical report, Weizmann Institute, 1998.
16. [KPR98] Y. Kesten, A. Pnueli, and L. Raviv. Algorithmic verification of linear temporal logic specifications. In ICALP'98 pages 1-16.
17. [Lam77] L. Lamport. Proving the correctness of multiprocess programs. IEEE Trans. Software Engin., 3:125-143, 1977.
18. [MP90] Z. Manna and A. Pnueli. A hierarchy of temporal properties. In Proc. 9th ACM Symp. Princ. of Dist. Comp., pages 377-408, 1990.
19. [MP95] Z. Manna and A. Pnueli. Temporal Veri_cation of Reactive Systems: Safety. Springer-Verlag, New York, 1995.
20. [OSR93] S. Owre, N. Shankar, and J.M. Rushby. User guide for the PVS specification and verification system. SRI International, Menlo Park, CA, 1993.
21. [PJ91] P.K. Pandya and M. Joseph. P-A logic - a compositional proof system for distributed programs. Dist. Comp., 5:37-54, 1991.
22. [Pnu85] A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logics and Models of Concurrent Systems, sub-series F: Computer and System Science, pages 123-144. Springer-Verlag, 1985.
23. [XdRH97] Q.W. Xu, W.-P. de Roever, and J.-F. He. The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing, 9(2):149-174, 1997.
24. [Zwi89] J. Zwiers. Compositionality Concurrency and Partial Correctness, volume 321 of Lect. Notes in Comp. Sci. Springer-Verlag, 1989.