Mechanical Abstraction of CSPZ Processes

We propose a mechanised strategy to turn an infinite CSPZ process (formed of CSP and Z constructs) into one suitable for model checking. This strategy integrates two theories which allow us to consider the infiniteness of CSPZ as two separate problems: data independence for handling the behavioural aspect and abstract interpretation for handling the data structure aspect. A distinguishing feature of our approach to abstract interpretation is the generation of the abstract domains based on a symbolic execution of the process.

[1]  Heike Wehrheim,et al.  Data Abstraction Techniques in the Validation of CSP-OZ Specifications , 2000, Formal Aspects of Computing.

[2]  Patrick Cousot,et al.  Abstract Interpretation Frameworks , 1992, J. Log. Comput..

[3]  Patrick Cousot,et al.  Systematic design of program analysis frameworks , 1979, POPL.

[4]  Shaoying Liu.  Verifying Consistency and Validity of Formal Specifications by Testing , 1999, World Congress on Formal Methods.

[5]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[6]  Peter Niebert,et al.  Verification Based on Local States , 1998, TACAS.

[7]  Natarajan Shankar,et al.  PVS: Combining Specification, Proof Checking, and Model Checking , 1996, FMCAD.

[8]  S. Anderson,et al.  Secure Synthesis of Code: A Process Improvement Experiment , 1999, World Congress on Formal Methods.

[9]  Alexandre Cabral Mota.  Model checking CSPZ: Techniques to overcome state explosion , 2001 .

[10]  Pierre Wolper,et al.  Expressing interesting properties of programs in propositional temporal logic , 1986, POPL '86.

[11]  Mark Saaltink.  The Z/EVES System , 1997, ZUM.

[12]  Augusto Sampaio,et al.  Model-Checking CSP-Z , 1998, FASE.

[13]  Jonathan P. Bowen,et al.  ZUM '97: The Z Formal Specification Notation , 1997, Lecture Notes in Computer Science.

[14]  Rance Cleaveland,et al.  Testing-Based Abstractions for Value-Passing Systems , 1994, CONCUR.

[15]  Pierre Wolper,et al.  On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract) , 1998, ICALP.

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

[17]  Panos M. Pardalos,et al.  Satisfiability Problem: Theory and Applications , 1997 .

[18]  Roberto Giacobazzi,et al.  Making abstract interpretations complete , 2000, JACM.

[19]  Orna Grumberg,et al.  Modular Model Checking of Software , 1998, TACAS.

[20]  Karsten Stahl,et al.  Divide, Abstract, and Model-Check , 1999, SPIN.

[21]  Heike Wehrheim,et al.  Data Abstraction for CSP-OZ , 1999, World Congress on Formal Methods.

[22]  Augusto Sampaio,et al.  Model-checking CSP-Z: strategy, tool support and industrial application , 2001, Sci. Comput. Program..

[23]  Joseph Sifakis,et al.  Property preserving abstractions for the verification of concurrent systems , 1995, Formal Methods Syst. Des..

[24]  Amir Pnueli,et al.  A Perfect Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software , 1999, World Congress on Formal Methods.

[25]  J. Strother Moore,et al.  An Industrial Strength Theorem Prover for a Logic Based on Common Lisp , 1997, IEEE Trans. Software Eng..

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

[27]  C. A. R. Hoare,et al.  Communicating Sequential Processes (Reprint) , 1983, Commun. ACM.