Compositional analysis for verification of parameterized systems

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

Volumn 2619, Issue , 2003, Pages 315-330

  Basu, Samik ^a   Ramakrishnan, C R ^a  

^a Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CALCULATIONS; PARAMETERIZATION; TEMPORAL LOGIC;

AUTOMATIC VERIFICATION; COMPOSITIONAL ANALYSIS; COMPOSITIONAL MODELING; PARAMETERIZED SYSTEM; PARTIAL MODEL CHECKING; SAFETY CRITICAL SYSTEMS; TRADITIONAL MODELS; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 35248897592     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36577-x_23     Document Type: Article

References (39)

1. J. Archibald and J.L. Baer. Cache coherence protocols: Evaluation using a multi-processor simulation model. In ACM TOCS, 1986.
2. O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y.S. Ramakrishna, and D. White. An efficient meta-lock for ubiquitous synchronization. In OOPSLA, 1999.
3. R. Alur and T. Henzinger. Reactive modules. In LICS, 1996.
4. H. R. Andersen. Partial model checking. In LICS, 1995.
5. H. R. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal mu-calculus. In LICS, 1994.
6. 20 states and beyond. In LICS, 1990.
7. S. Berezin and D. Gurov. A compositional proof system for the modal mu-calculus and CCS. Technical Report CMU-CS-97-105, CMU, 1997.
8. J. Bradfield and C. Stirling. Modal logics and mu-calculi: an introduction. In Handbook of Process Algebra. Elsevier, 2001.
9. S. Basu, S. A. Smolka, and O. R. Ward. Model checking the Java Meta-Locking algorithm. In ECBS, 2000.
10. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, 1977.
11. E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 1986.
12. E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. In ACM transactions on programming languages and systems, 1997.
13. R. Cleaveland and B. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. FMSD, 1993.
14. G. Delzanno. Automatic verification of parameterized cache coherence protocols. In CAV, 2000.
15. G. Delzanno and A. Podelski. Model checking in CLP. In TACAS, 1999.
16. J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In LICS, 1999.
17. E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In FOCS, pages 328-337, 1988.
18. E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In POPL, 1995.
19. E.A. Emerson and K.S. Namjoshi. Automated verification of parameterized synchronous systems. In CAV, 1996.
20. E.A. Emerson and K.S. Namjoshi. On model checking for nondeterministic infinite state systems. In LICS, 1998.
21. O. Grumberg and D.E. Long. Model checking and modular verification. In TOPLAS, 1994.
22. P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. In JLP, 1994.
23. G. J. Holzmann. The model checker SPIN. IEEE TSE, 1997.
24. T. Henzinger, S. Qadeer, and S.K. Rajamani. You assume, we guarantee. In CAV, 1998.
25. C. N. Ip and D. L. Dill. Better verification through symmetry reduction. In FMSD, 1996.
26. C.N. Ip and D.L. Dill. Verifying systems with replicated components in murphi. In FMSD, 1999.
27. D. Kozen. Results on the propositional μ-calculus. TCS, 1983.
28. Y. Kesten and A. Pnueli. Control and data abstraction:the cornerstones of pratical formal verification. In Intl. Journal on STTT, 2000.
29. D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of linear networks processes. In POPL, 1997.
30. K.L. McMillan. Compositional rule for hardware design refinement. In CAV, 1997.
31. R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
32. P. Mildner. Type Domains form Abstract interpretation: A critical study. PhD thesis, Uppsala University, 1999.
33. A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In CAV, 2000.
34. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, 1982.
35. A. Roychoudhury, K.N. Kumar, C.R. Ramakrishnan, I.V. Ramakrishnan, and S.A. Smolka. Verification of parameterized systems using logicprogram transformations. In TACAS, 2000.
36. A. Roychoudhury and I.V. Ramakrishnan. Automated inductive verification of parameterized protocols. In CAV, 2001.
37. A. P. Sistla and V. Gyuris. Parameterized verification of linear networks using automata as invariants. Formal Aspects of Computing, 1999.
38. P. Wolper. Expressing interesting properties in prepositional temporal logic. In POPL, 1986.
39. The XSB Group. The XSB logic programming system v2.1, 2000. Available from http://www.cs.sunysb.edu/∼sbprolog.