How to Make FDR Spin LTL Model Checking of CSP by Refinement

We study the possibility of doing LTL model checking on CSP specifications in the context of refinement. We present evidence that the refinement-based approach to verification does not seem to be very well suited for verifying certain temporal properties. To remedy this problem, we show how to (and how not to) perform LTL model checking of CSP processes using refinement checking in general and the FDR tool in particular. We show how one can handle (potentially) deadlocking systems, discuss the validity of our approach for infinite state systems, and shed light on the relationship between "classical" model checking and refinement checking.

[1]  Stephan Merz,et al.  Model Checking , 2000 .

[2]  Thierry Massart,et al.  Ltl model checking of csp by refinement , 2000 .

[3]  Pierre Wolper,et al.  An Automata-Theoretic Approach to Automatic Program Verification (Preliminary Report) , 1986, LICS.

[4]  Pierre Wolper,et al.  Simple on-the-fly automatic verification of linear temporal logic , 1995, PSTV.

[5]  Thierry Massart,et al.  Infinite State Model Checking by Abstract Interpretation and Program Specialisation , 1999, LOPSTR.

[6]  A. W. Roscoe,et al.  Data Independent Induction over Structured Networks , 2000, PDPTA.

[7]  A. Prasad Sistla,et al.  The complexity of propositional linear temporal logics , 1982, STOC '82.

[8]  Bowen Alpern,et al.  Defining Liveness , 1984, Inf. Process. Lett..

[9]  Frank Waters,et al.  The B Book , 1971 .

[10]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[11]  Robert Sedgewick,et al.  Algorithms in C , 1990 .

[12]  Antti Valmari,et al.  On-the-Fly Verification with Stubborn Sets , 1993, CAV.

[13]  Amir Pnueli.  The Temporal Semantics of Concurrent Programs , 1981, Theor. Comput. Sci..

[14]  C. A. R. Hoare,et al.  Communicating sequential processes , 1978, CACM.

[15]  C. A. R. Hoare,et al.  Notes on Communicating Sequential Systems , 1986 .

[16]  Andrew William Roscoe,et al.  The Theory and Practice of Concurrency , 1997 .

[17]  Jeff Magee,et al.  Concurrency - state models and Java programs , 2006 .

[18]  Javier Esparza,et al.  Decidability of model checking for infinite-state concurrent systems , 1997, Acta Informatica.

[19]  Edmund M. Clarke,et al.  Formal Methods: State of the Art and Future Directions Working Group Members , 1996 .

[20]  Kenneth L. McMillan,et al.  Symbolic model checking , 1992 .

[21]  Gerard J. Holzmann,et al.  Design and validation of computer protocols , 1991 .