Compositional Verification for Object-Z
نویسندگان
چکیده
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).
منابع مشابه
THE UNIVERSITY OF QUEENSLAND Queensland 4072 Australia
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-com...
متن کاملCompositional Verification of an Object-Based Model for Reactive Systems
Reactive systems have an ongoing interaction with their environment, accepting requests and producing responses. Correct and reliable construction of reactive systems is particularly important and challenging. So, using a formal method to establish mathematical proof of correctness of such systems is necessary. A formal method consists of three major components: a model for describing the behav...
متن کاملCompositional probabilistic verification through multi-objective model checking
Compositional approaches to verification offer a powerful means to address the challenge of scalability. In this paper, we develop techniques for compositional verification of probabilistic systems based on the assume-guarantee paradigm. We target systems that exhibit both nondeterministic and stochastic behaviour, modelled as probabilistic automata, and augment these models with costs or rewar...
متن کاملCompositional Verification of Object Creation with Interface Invariants ?
We present a theory for reasoning compositionally about behavioural interfaces for class-based object-oriented programs. Our contribution is an axiomatic characterisation of unbounded object creation in terms of communication traces over the visible operations of a class (its signature). This involves an abstraction from the actual explicit creation of objects. We apply our proof method to the ...
متن کاملLearning-Based Compositional Verification for Synchronous Probabilistic Systems
We present novel techniques for automated compositional verification of synchronous probabilistic systems. First, we give an assume-guarantee framework for verifying probabilistic safety properties of systems modelled as discretetime Markov chains. Assumptions about system components are represented as probabilistic finite automata (PFAs) and the relationship between components and assumptions ...
متن کامل