In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Handbook of theoretical computer science (vol. B)
The Z notation: a reference manual
The Z notation: a reference manual
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Introducing Reference Semantics via Refinement
ICFEM '02 Proceedings of the 4th International Conference on Formal Engineering Methods: Formal Methods and Software Engineering
Encoding Object-Z in Isabelle/HOL
ZB '02 Proceedings of the 2nd International Conference of B and Z Users on Formal Specification and Development in Z and B
Proceedings of the Z User Workshop
Reasoning about Object-Z Specifications
APSEC '95 Proceedings of the Second Asia Pacific Software Engineering Conference
APSEC '97 Proceedings of the Fourth Asia-Pacific Software Engineering and International Computer Science Conference
A formal framework for modelling and analysing mobile systems
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Slicing techniques for verification re-use
Theoretical Computer Science - Formal methods for components and objects
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
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 |
This paper presents a framework for compositional verification of Object-Z specifications. Its key feature is a proof rule based on decomposition of hierarchical Object-Z models. For each component in the hierarchy local properties are proven in a single proof step. However, we do not consider components in isolation. Instead, components are envisaged in the context of the referencing super-component and proof steps involve assumptions on properties of the sub-components. The framework is defined for Linear Temporal Logic (LTL).