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.
Bibtex Entry:
@article{BR:TCS06, author = {Samik Basu and C. R. Ramakrishnan}, title = {Compositional Analysis for Verification of Parameterized Systems}, journal = {Theoretical Computer Science}, volume = {354}, number = {2}, pages = {211--229}, note = {http://dx.doi.org/10.1016/j.tcs.2005.11.016/}, year = {2006} }
| Full Paper: | [pdf] |
C. R. Ramakrishnan
(cram@cs.sunysb.edu)