Abstract
Many safety-critical systems that have been considered by the verification community are parameterized by the number of concurrent components in the system, and hence describe an infinite family of systems. Traditional model checking techniques can only be used to verify specific instances of this family. In this paper, we present a technique based on compositional model checking and program analysis for automatic verification of infinite families of systems. The technique views a parameterized system as an expression in a process algebra (CCS) and interprets this expression over a domain of formulas (modal mu-calculus), considering a process as a property transformer. The transformers are constructed using partial model checking techniques. At its core, our technique solves the verification problem by finding the limit of a chain of formulas. We present a widening operation to find such a limit for properties expressible in a subset of modal mu-calculus. We describe the verification of a number of parameterized systems using our technique to demonstrate its utility.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
J. Archibald and J.L. Baer. Cache coherence protocols: Evaluation using a multi-processor simulation model. In ACM TOCS, 1986.
O. Agesen, D. Detlefs, A. Garthwaite, R. Knippel, Y.S. Ramakrishna, and D. White. An efficient meta-lock for ubiquitous synchronization. In OOPSLA, 1999.
R. Alur and T. Henzinger. Reactive modules. In LICS, 1996.
H. R. Andersen. Partial model checking. In LICS, 1995.
H. R. Andersen, C. Stirling, and G. Winskel. A compositional proof system for the modal mu-calculus. In LICS, 1994.
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and L. J. Hwang. Symbolic model checking: 1020 states and beyond. In LICS, 1990.
S. Berezin and D. Gurov. A compositional proof system for the modal mu-calculus and CCS. Technical Report CMU-CS-97-105, CMU, 1997.
J. Bradfield and C. Stirling. Modal logics and mu-calculi: an introduction. In Handbook of Process Algebra. Elsevier, 2001.
S. Basu, S. A. Smolka, and O. R. Ward. Model checking the Java Meta-Locking algorithm. In ECBS, 2000.
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.
E. M. Clarke, E. A. Emerson, and A. P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM TOPLAS, 1986.
E.M. Clarke, O. Grumberg, and S. Jha. Verifying parameterized networks. In ACM transactions on programming languages and systems, 1997.
R. Cleaveland and B. Steffen. A linear-time model checking algorithm for the alternation-free modal mu-calculus. FMSD, 1993.
G. Delzanno. Automatic verification of parameterized cache coherence protocols. In CAV, 2000.
G. Delzanno and A. Podelski. Model checking in CLP. In TACAS, 1999.
J. Esparza, A. Finkel, and R. Mayr. On the verification of broadcast protocols. In LICS, 1999.
E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In FOCS, pages 328–337, 1988.
E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In POPL, 1995.
E.A. Emerson and K.S. Namjoshi. Automated verification of parameterized synchronous systems. In CAV, 1996.
E.A. Emerson and K.S. Namjoshi. On model checking for nondeterministic infinite state systems. In LICS, 1998.
O. Grumberg and D.E. Long. Model checking and modular verification. In TOPLAS, 1994.
P. Van Hentenryck, A. Cortesi, and B. Le Charlier. Type analysis of prolog using type graphs. In JLP, 1994.
G. J. Holzmann. The model checker SPIN. IEEE TSE, 1997.
T. Henzinger, S. Qadeer, and S.K. Rajamani. You assume, we guarantee. In CAV, 1998.
C. N. Ip and D. L. Dill. Better verification through symmetry reduction. In FMSD, 1996.
C.N. Ip and D.L. Dill. Verifying systems with replicated components in murphi. In FMSD, 1999.
D. Kozen. Results on the propositional μ-calculus. TCS, 1983.
Y. Kesten and A. Pnueli. Control and data abstraction:the cornerstones of pratical formal verification. In Intl. Journal on STTT, 2000.
D. Lesens, N. Halbwachs, and P. Raymond. Automatic verification of linear networks processes. In POPL, 1997.
K.L. McMillan. Compositional rule for hardware design refinement. In CAV, 1997.
R. Milner. Communication and Concurrency. International Series in Computer Science. Prentice Hall, 1989.
P. Mildner. Type Domains form Abstract interpretation: A critical study.PhD thesis, Uppsala University, 1999.
A. Pnueli and E. Shahar. Liveness and acceleration in parameterized verification. In CAV, 2000.
J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proceedings of the International Symposium in Programming, 1982.
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.
A. Roychoudhury and I.V. Ramakrishnan. Automated inductive verification of parameterized protocols. In CAV, 2001.
A. P. Sistla and V. Gyuris. Parameterized verification of linear networks using automata as invariants. Formal Aspects of Computing, 1999.
P. Wolper. Expressing interesting properties in propositional temporal logic. In POPL, 1986.
The XSB Group. The XSB logic programming system v2.1, 2000. Available from http://www.cs.sunysb.edu/~sbprolog.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Basu, S., Ramakrishnan, C.R. (2003). Compositional Analysis for Verification of Parameterized Systems. In: Garavel, H., Hatcliff, J. (eds) Tools and Algorithms for the Construction and Analysis of Systems. TACAS 2003. Lecture Notes in Computer Science, vol 2619. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36577-X_23
Download citation
DOI: https://doi.org/10.1007/3-540-36577-X_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00898-9
Online ISBN: 978-3-540-36577-8
eBook Packages: Springer Book Archive