Automatic deductive verification with invisible invariants

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

Volumn 2031 LNCS, Issue , 2001, Pages 82-97

  Pnueli, Amir ^a   Ruah, Sitvanit ^a   Zuck, Lenore ^b  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PARAMETERIZATION; COMPUTATION THEORY;

AUTOMATIC COMPUTATIONS; AUTOMATIC VERIFICATION; DATA SYSTEMS; DEDUCTIVE VERIFICATION; INTERACTIVE THEOREM PROVING; PARAMETERIZED SYSTEM; VALIDATION PHASE; VERIFICATION CONDITION; FINITE STATE;

COMPUTATION THEORY; MODEL CHECKING;

EID: 84903156915     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45319-9_7     Document Type: Conference Paper

References (34)

1. P.A. Abdulla, A. Bouajjani, B. Jonsson, and M. Nilsson. Handling global conditions in parametrized system verification. In CAV'99, LNCS 1633, pages 134-145, 1999.
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.C. Browne, E.M. Clarke, and O. Grumberg. Reasoning about networks with many finite state processes. In Proc. 5th ACM Symp. Princ. of Dist. Comp., pages 240-248, 1986.
4. E.M. Clarke, , R. Enders T. Filkron, and S. Jha. Exploiting symmetry in temporal logic model checking. Formal Methods in System Design, 9(1/2), 8 1996. Preliminary version appeared in 5th CAV, 1993.
5. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parametrized networks using abstraction and regular languages. In 6th International Conference on Concurrency Theory (CONCUR'95), pages 395-407, Philadelphia, PA, August 1995.
6. S.J. Creese and A.W. Roscoe. Formal verification of arbitrary network topologies. In Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA '99), Las Vegas, 1999. CSREA Press.
7. S.J. Creese and A.W. Roscoe. Verifying an infinite family of inductions simultaneously using data independence and fdr. In Formal Description Techniques for Distributed Systems and Communication Protocols and Protocol Specification, Testing and Verification (FORTE/PS TV'99), Beijing, 1999. Kluwer Academic Publishers.
8. S.J. Creese and A.W. Roscoe. Data independent induction over structured networks. In Proc. of the Int. Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA'00), Las Vegas, June 2000. CSREA Press.
9. E. A. Emerson and V. Kahlon. Reducing model checking of the many to the few. In 11th International Conference on Automated Deduction (CADE-11), pages 236-255, 2000.
10. E. A. Emerson and K. S. Namjoshi. Reasoning about rings. In POPL'95, 1995.
11. E.A. Emerson and K.S. Namjoshi. Automatic verification of parameterized synchronous systems. In CAV'96, LNCS 1102, 1996.
12. E. A. Emerson and A. P. Sistla. Symmetry and model checking. Formal Methods in System Design, 9(1/2), 8 1996. Preliminary version appeared in 5th CAV, 1993.
13. E. A. Emerson and A. P. Sistla. Utilizing symmetry when model checking under fairness assumptions. ACM Trans. Prog. Lang. Sys, 19(4), 1997. Preliminary version appeared in 7th CAV, 1995.
14. S. German. Personal Communication, 2000.
15. V. Gyuris and A. P. Sistla. On-the-fly model checking under fairness that exploits symmetry. In CAV'97, LNCS 1254, 1997.
16. E.P. Gribomont and G. Zenner. Automated verification of szymanski's algorithm. In TACAS'98, LNCS 1384, pages 424-438, 1998.
17. 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.
18. C.N. Ip and D. Dill. Verifying systems with replicated components in Mure/?. In CAV'96, LNCS 1102, 1996.
19. E. Jensen and N.A. Lynch. A proof of burn's n-process mutual exclusion algorithm using abstraction. In TACAS'98, LNCS 1384, pages 409-423, 1998.
20. B. Jonsson and M. Nilsson. Transitive closures of regular relations for verifying infinite-state systems. In TACAS'00, LNCS 1785, 2000.
21. R.P. Kurshan and K.L. McMillan. A structural induction theorem for processes. Information and Computation, 117:1-11, 1995.
22. Y. Kesten, O. Maler, M. Marcus, A. Pnueli, and E. Shahar. Symbolic model checking with rich assertional languages. In CAV'97, LNCS 1254, pages 424-435, 1997.
23. Y. Kesten and A. Pnueli. Control and data abstractions: The cornerstones of practical formal verification. Software Tools for Technology Transfer, 4(2):328-342, 2000.
24. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of parameterized linear networks of processes. In POPL'97, 1997.
25. D. Lesens and H. Saidi. Automatic verification of parameterized networks of processes by abstraction. In 2nd International Workshop on the Verification of Infinite State Systems (INFINITY'97), 1997.
26. 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.
27. K.L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In CAV'98, LNCS 1427, pages 110-121, 1998.
28. Z. Manna and A. Pnueli. An exercise in the verification of multi - process programs. In W.H.J. Feijen, A.J.M van Gasteren, D. Gries, and J. Misra, editors, Beauty is Our Business, pages 289-301. Springer-Verlag, 1990.
29. A. Pnueli and E. Shahar. Livenss and acceleraiton in parameterized verifi- cation. In CAV'OO, LNCS 1855, 2000.
30. A. Roychoudhury, K. Narayan Kumar, C. R. Ramakrishnan, I.V. Ramakr-ishnan, and S.A. Smolka. Verification of parameterized systems using logic program transformations. In TACAS'00, LNCS 1785, 2000.
31. Z. Shtadler and O. Grumberg. Network grammars, communication behav- iors and automatic verification. In CAV'89, LNCS 407, pages 151-165, 1989.
32. A.P. Sistla and S.M. German. Reasoning about systems with many pro- cesses. I. ACM, 39:675-735, 1992.
33. N. Shankar, S. Owre, and J.M. Rushby. The PVS proof checker: A reference manual (draft). Technical report, Comp. Sci., Lab oratory, SRI International, Menlo Park, CA, 1993.
34. P. Wolper and V. Lovinfosse. Verifying properties of large sets of processes with network invariants. In CAV'89, LNCS 407, pages 68-80, 1989.