Communicating sequential processes
Communicating sequential processes
The Z notation: a reference manual
The Z notation: a reference manual
Property preserving abstractions for the verification of concurrent systems
Formal Methods in System Design - Special issue on computer-aided verification (based on CAV'92 workshop)
An Industrial Strength Theorem Prover for a Logic Based on Common Lisp
IEEE Transactions on Software Engineering
Model checking
Making abstract interpretations complete
Journal of the ACM (JACM)
Model-checking CSP-Z: strategy, tool support and industrial application
Science of Computer Programming - Specical issue on fundamental approaches to software engineering
Expressing interesting properties of programs in propositional temporal logic
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
Systematic design of program analysis frameworks
POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Divide, Abstract, and Model-Check
Proceedings of the 5th and 6th International SPIN Workshops on Theoretical and Practical Aspects of SPIN Model Checking
On the Expressiveness of Real and Integer Arithmetic Automata (Extended Abstract)
ICALP '98 Proceedings of the 25th International Colloquium on Automata, Languages and Programming
Modular Model Checking of Software
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Verification Based on Local States
TACAS '98 Proceedings of the 4th International Conference on Tools and Algorithms for Construction and Analysis of Systems
Testing-Based Abstractions for Value-Passing Systems
CONCUR '94 Proceedings of the Concurrency Theory
ZUM '97 Proceedings of the 10th International Conference of Z Users on The Z Formal Specification Notation
Verifying Consistency and Validity of Formal Specifications by Testing
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume I - Volume I
FM '99 Proceedings of the Wold Congress on Formal Methods in the Development of Computing Systems-Volume II
PVS: Combining Specification, Proof Checking, and Model Checking
CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Checking Z Data Refinements Using Traces Refinement
Electronic Notes in Theoretical Computer Science (ENTCS)
Proving temporal properties of Z specifications using abstraction
ZB'03 Proceedings of the 3rd international conference on Formal specification and development in Z and B
| Hi-index | 0.00 |
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.