Model checking and abstraction
ACM Transactions on Programming Languages and Systems (TOPLAS)
A classical mind
Temporal verification of reactive systems: safety
Temporal verification of reactive systems: safety
Using Z: specification, refinement, and proof
Using Z: specification, refinement, and proof
CSP-OZ: a combination of object-Z and CSP
FMOODS '97 Proceedings of the IFIP TC6 WG6.1 international workshop on Formal methods for open object-based distributed systems
Model checking
Communicating sequential processes
Communications of the ACM
Slicing Software for Model Construction
Higher-Order and Symbolic Computation
The Theory and Practice of Concurrency
The Theory and Practice of Concurrency
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Model-Checking CSP-OZ Specifications with FDR
IFM '99 Proceedings of the 1st International Conference on Integrated Formal Methods
ICSE '81 Proceedings of the 5th international conference on Software engineering
Counterexample-guided abstraction refinement for symbolic model checking
Journal of the ACM (JACM)
Optimizing slicing of formal specifications by deductive verification
Nordic Journal of Computing - Selected papers of the 17th nordic workshop on programming theory (NWPT'05), October 19-21, 2005
Slicing an integrated formal method for verification
ICFEM'05 Proceedings of the 7th international conference on Formal Methods and Software Engineering
ICFEM'06 Proceedings of the 8th international conference on Formal Methods and Software Engineering
Model checking z specifications using SAL
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
Slicing object-z specifications for verification
ZB'05 Proceedings of the 4th international conference on Formal Specification and Development in Z and B
| Hi-index | 0.00 |
Integrated formal specifications are intrinsically difficult to (automatically) verify due to the combination of complex data and behaviour. In this paper, we present a method for decomposing specifications into several smaller parts which can be independently verified. Verification results can then be combined to make a global result according to the original specification. Instead of relying on an a priori given structure of the system such as a parallel composition of components, we compute the decomposition by ourselves using the technique of slicing. With less effort, significant properties can be verified for the resulting specification parts and be applied to the full specification. We prove correctness of our method and exemplify it according to a specification from the rail domain.