Symmetry and completeness in the analysis of parameterized systems

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

Volumn 4349 LNCS, Issue , 2007, Pages 299-313

  Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INVARIANCE; PARAMETERIZATION; THEOREM PROVING;

COMPOSITIONAL ANALYSIS; CUTOFF METHOD; INDUCTIVENESS;

SYSTEMS ANALYSIS;

EID: 36349003317     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-69738-1_22     Document Type: Conference Paper

References (43)

1. Parosh Aziz Abdulla, Ahmed Bouajjani, Bengt Jonsson, and Marcus Nilsson. Handling global conditions in parameterized system verification. In CAV, volume 1633 of LNCS, pages 134-145, 1999.
2. Krzysztof R. Apt and Dexter Kozen. Limits for automatic verification of finite-state concurrent systems. Inf. Process. Lett., 22(6):307-309, 1986.
3. Tamarah Arons, Amir Pnueli, Sitvanit Ruah, Jiazhao Xu, and Lenore D. Zuck. Parameterized verification with automatically computed inductive assertions. In CAV, volume 2102 of LNCS, pages 221-234, 2001.
4. Ittai Balaban, Yi Fang, Amir Pnueli, and Lenore D. Zuck. IIV: An invisible invariant verifier. In CAV, volume 3576 of LNCS, pages 408-412, 2005.
5. T. Ball and S. K. Rajamani. The SLAM toolkit. In CAV, volume 2102 of LNCS. Springer Verlag, 2001.
6. Aaron R. Bradley, Zohar Manna, and Henny B. Sipma. What's decidable about arrays? In VMCAI, volume 3855 of LNCS, pages 427-442, 2006.
7. Michael C. Browne, Edmund M. Clarke, and Orna Grumberg. Reasoning about networks with many identical finite state processes. Inf. Comput., 81(1):13-31, 1989.
8. K.M. Chandy and J. Misra. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(4), 1981.
9. Edmund M. Clarke and Orna Grumberg. Avoiding the state explosion problem in temporal logic model checking. In PODC, pages 294-303, 1987.
10. Edmund M. Clarke, Muralidhar Talupur, and Helmut Veith. Environment abstraction for parameterized verification. In VMCAI, volume 3855 of LNCS, pages 126-141, 2006.
11. D. Dams and K.S. Namjoshi. The existence of finite abstractions for branching time model checking. In LICS, 2004.
12. W-P. de Roever, F. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, M. Poel, and J. Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Cambridge University Press, 2001.
13. E.W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation of programs. CACM, 18(8), 1975.
14. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer Verlag, 1990.
15. E. Allen Emerson and Vineet Kahlon. Reducing model checking of the many to the few. In CADE, volume 1831 of LNCS, pages 236-254, 2000.
16. E. Allen Emerson and Kedar S. Namjoshi. Automatic verification of parameterized synchronous systems (extended abstract). In CAV, volume 1102 of LNCS, pages 87-98, 1996.
17. E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In ACM Symposium on Principles of Programming Languages, 1995.
18. Cormac Flanagan, Stephen N. Freund, Shaz Qadeer, and Sanjit A. Seshia. Modular verification of multithreaded programs. Theor. Comput Sci., 338(1-3):153-183, 2005.
19. Cormac Flanagan and Shaz Qadeer. Predicate abstraction for software verification. In POPL, pages 191-202, 2002.
20. Cormac Flanagan and Shaz Qadeer. Thread-modular model checking. In SPIN, volume 2648 of LNCS, pages 213-224, 2003.
21. S. German and A.P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 1992.
22. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, volume 1254 of LNCS, 1997.
23. T. A. Henzinger, R. Jhala, R. Majumdar, G. C. Necula, G. Sutre, and W. Weimer. Temporal-safety proofs for systems code. In CAV, volume 2404 of LNCS, 2002.
24. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Shaz Qadeer. Threadmodular abstraction refinement. In CAV, volume 2725 of LNCS, pages 262-274, 2003.
25. Thomas A. Henzinger, Ranjit Jhala, Rupak Majumdar, and Grégoire Sutre. Lazy abstraction. In POPL, pages 58-70, 2002.
26. Ranjit Jhala and Kenneth L. McMillan. A practical and complete approach to predicate refinement. In TACAS, volume 3920 of LNCS, pages 459-473, 2006.
27. C.B. Jones. Development methods for computer programs including a notion of interference. PhD thesis, Oxford University, 1981.
28. C.B. Jones. Tentative steps toward a development method for interfering programs. ACM Trans, on Programming Languages and Systems (TOPLAS), 1983.
29. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1), 2000.
30. Yonit Kesten, Oded Maler, Monica Marcus, Amir Pnueli, and Elad Shahar. Symbolic model checking with rich ssertional languages. In CAV, volume 1254 of LNCS, pages 424-435, 1997.
31. Yonit Kesten and Amir Pnueli. Control and data abstraction: The cornerstones of practical formal verification. STTT, 2(4):328-342, 2000.
32. Robert P. Kurshan and Kenneth L. McMillan. A structural induction theorem for processes. In PODC, pages 239-247, 1989.
33. Shuvendu K. Lahiri and Randal E. Bryant. Constructing quantified invariants via predicate abstraction. In VMCAI, volume 2937 of LNCS, pages 267-281, 2004.
34. Shuvendu K. Lahiri and Randal E. Bryant. Indexed predicate discovery for unbounded system verification. In CAV, volume 3114 of LNCS, pages 135-147, 2004.
35. Leslie Lamport. Proving the correctness of multiprocess programs. IEEE Trans. Software Eng., 3(2), 1977.
36. Ranko Lazic and David Nowak. A unifying approach to data-independence. In CONCUR, volume 1877 of LNCS, pages 581-595, 2000.
37. K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV, volume 1855 of LNCS. Springer Verlag, 2000.
38. Susan S. Owicki and David Gries. Verifying properties of parallel programs: An axiomatic approach. Commun. ACM, 19(5):279-285, 1976.
39. Amir Pnueli, Sitvanit Ruah, and Lenore D. Zuck. Automatic deductive verification with invisible invariants. In TACAS, volume 2031 of LNCS, pages 82-97, 2001.
40. Amir Pnueli and Elad Shahar. A platform for combining deductive with algorithmic verification. In CAV, volume 1102 of LNCS, pages 184-195, 1996. web: www.cs.nyu.edu/acsys/tlv.
41. Amir Pnueli, Elad Shahar, and Lenore D. Zuck. Network invariants in action. In CONCUR, volume 2421 of LNCS, pages 101-115, 2002.
42. Ichiro Suzuki. Proving properties of a ring of finite-state machines. Inf. Process. Lett., 28(4):213-214, 1988.
43. Pierre Wolper and Vinciane Lovinfosse. Verifying properties of large sets of processes with network invariants. In Automatic Verification Methods for Finite State Systems, volume 407 of LNCS, pages 68-80, 1989.