Compositional analysis for verification of parameterized systems

Theoretical Computer Science

Volumn 354, Issue 2, 2006, Pages 211-229

  Basu, Samik ^a   Ramakrishnan, C R ^b  

^a Iowa State University   (United States)

^b Stony Brook University   (United States)

Author keywords

Acceleration; Compositional model checking; Formula equivalence; Parameterized systems; Widening

Indexed keywords

ALGEBRA; COMPUTER SCIENCE; MATHEMATICAL MODELS; PROCESS CONTROL;

COMPOSITIONAL MODEL CHECKING; FORMULA EQUIVALENCE; PARAMETERIZED SYSTEMS; WIDENING;

PARAMETER ESTIMATION;

EID: 33644675562     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.11.016     Document Type: Conference Paper

References (45)

1. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y.S. Ramakrishna, D. White, An efficient meta-lock for ubiquitous synchronization, in: Proc. ACM SIGPLAN Conf. Object Oriented Programming, Systems, Languages and Applications, 1999.
2. R. Alur, T. Henzinger, Reactive modules, in: Proc. IEEE Symp. Logic in Computer Science, 1996.
3. H.R. Andersen, Partial model checking, in: Proc. IEEE Symp. Logic in Computer Science, 1995.
4. H.R. Andersen, C. Stirling, G. Winskel, A compositional proof system for the modal mu-calculus, in: Proc. IEEE Symp. Logic in Computer Science, 1994.
5. K.R. Apt, and D. Kozen Limits for automatic verification of finite-state concurrent systems Inform. Process. Lett. 22 1986 307 309
6. J. Archibald, and J.-L. Baer Cache coherence protocols: evaluation using a multiprocessor simulation model ACM Trans. Comput. Systems 4 4 1986 273 298
7. T. Arons, A. Pnueli, S. Ruah, J. Xu, L. Zuck, Parameterized verification with automatically computed inductive assertions, in: Proc. Computer Aided Verification, 2001.
8. T. Ball, S. Chaki, S.K. Rajamani, Parameterized verification of multithreaded software libraries, in: Proc. Tools and Algorithms for the Construction and Analysis of Systems, 2001.
9. S. Basu, S.A. Smolka, O.R. Ward, Model checking the Java meta-locking algorithm, in: Proc. Engineering of Computer-Based Systems, 2000.
10. S. Berezin, D. Gurov, A compositional proof system for the modal mu-calculus and CCS, Technical Report CMU-CS-97-105, CMU, 1997.
11. J. Bradfield, C. Stirling, Modal logics and mu-calculi: an introduction, in: Handbook of Process Algebra, Elsevier, Amsterdam, 2001.
12. J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang, Symbolic model checking: 10 20 states and beyond, in: Proc. IEEE Symp. Logic in Computer Science, 1990.
13. E.M. Clarke, E.A. Emerson, and A.P. Sistla Automatic verification of finite-state concurrent systems using temporal logic specifications ACM Trans. Programming Languages and Systems 8 2 1986
14. E.M. Clarke, O. Grumberg, and S. Jha Verifying parameterized networks ACM Trans. Programming Languages and Systems 19 5 1997
15. R. Cleaveland, B. Steffen, A linear-time model checking algorithm for the alternation-free modal mu-calculus, Formal Methods in System Design, 1993.
16. J.M. Cobleigh, D. Giannakopoulou, C.S. Pasareanu, Learning assumptions for compositional verification, in: Proc. Tools and Algorithms for the Construction and Analysis of Systems, 2003.
17. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proc. Principles of Programming Languages, 1977.
18. G. Delzanno, Automatic verification of parameterized cache coherence protocols, in: Proc. Computer Aided Verification, 2000.
19. G. Delzanno, A. Podelski, Model checking in CLP, in: Proc. Tools and algorithms for Construction and Analysis of Systems, 1999.
20. E.A. Emerson, C.S. Jutla, The complexity of tree automata and logics of programs, in: Proc. Foundations of Computer Science, 1988.
21. E.A. Emerson, K.S. Namjoshi, Reasoning about rings, in: Proc. Principles of Programming Languages, 1995.
22. E.A. Emerson, K.S. Namjoshi, Automated verification of parameterized synchronous systems, in: Proc. Computer Aided Verification, 1996.
23. E.A. Emerson, K.S. Namjoshi, On model checking for non-deterministic infinite state systems, in: Proc. IEEE Symp. Logic in Computer Science, 1998.
24. J. Esparza, A. Finkel, R. Mayr, On the verification of broadcast protocols, in: Proc. IEEE Symp. Logic in Computer Science, 1999.
25. O. Grumberg, and D.E. Long Model checking and modular verification ACM Trans. Programming Languages and Systems 16 3 1994 843 871
26. P. Van Hentenryck, A. Cortesi, and B. Le Charlier Type analysis of prolog using type graphs J. Logic Programming 22 3 1994 179 209
27. T. Henzinger, S. Qadeer, S.K. Rajamani, You assume, we guarantee, in: Proc. Computer Aided Verification, 1998.
28. T.A. Henzinger, R. Jhala, R. Majumdar, S. Qadeer, Thread-modular abstraction refinement, in: Proc. Computer Aided Verification, 2003.
29. G.J. Holzmann The model checker SPIN Software Engrg. 23 5 1997 279 295
30. C.N. Ip, and D.L. Dill Better verification through symmetry reduction Formal Methods in System Design 9 1/2 1996 41 75
31. C.N. Ip, and D.L. Dill Verifying systems with replicated components in murphi Formal Methods in System Design 14 3 1999
32. Y. Kesten, and A. Pnueli Control and data abstraction: the cornerstones of practical formal verification Internat. J. Software Tools for Technology Transfer 2 4 2000 328 342
33. D. Kozen Results on the propositional μ -calculus Theoret. Comput. Sci. 27 1983 333 354
34. D. Lesens, N. Halbwachs, P. Raymond, Automatic verification of parameterized linear networks of processes, in: Proc. Principles of Programming Languages, 1997.
35. D.E. Long, Model checking, abstraction and compositional verification, Ph.D. Thesis, CMU, 1993.
36. K.L. McMillan, Compositional rule for hardware design refinement, in: Proc. Computer Aided Verification, 1997.
37. P. Mildner, Type domains form abstract interpretation: a critical study, Ph.D. Thesis, Uppsala University, 1999.
38. R. Milner Communication and concurrency, International Series in Computer Science 1989 Prentice-Hall Englewood Cliffs, NJ
39. A. Pnueli, S. Ruah, L. Zuck, Automatic deductive verification with invisible invariants, in: Proc. Tools and Algorithms for Construction and Analysis of Systems, 2001.
40. A. Pnueli, E. Shahar, Liveness and acceleration in parameterized verification, in: Proc. Computer Aided Verification, 2000.
41. J.P. Queille, J. Sifakis, Specification and verification of concurrent systems in Cesar, in: Proc. Internat. Symp. Programming, 1982.
42. A. Roychoudhury, Program transformations for verifying parameterized systems, Ph.D. Thesis, SUNY Stony Brook, 2000.
43. A.P. Sistla, and V. Gyuris Parameterized verification of linear networks using automata as invariants Formal Aspects of Comput. 11 4 1999 402 425
44. P. Wolper, Expressing interesting properties in propositional temporal logic, in: Proc. Principles of Programming Languages, 1986.
45. XSB, The XSB logic programming system v2.6, 2003, available from 〈 http://xsb.sourceforge.net 〉.