Ltl model checking of csp by refinement

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

[2]  Sérgio Vale Aguiar Campos,et al.  Symbolic Model Checking , 1993, CAV.

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

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

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

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

[7]  Edmund M. Clarke,et al.  Model Checking , 1999, Handbook of Automated Reasoning.

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

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

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

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

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

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

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

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

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