Compositional Verification for Object-Z

Winter, Kirsten; Smith, Graeme

doi:10.1007/3-540-44880-2_18

Cited by 6 publications

(5 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Slicing can thus be seen as one method for fighting the state explosion problem in verification, along with other techniques like abstraction (for Z for instance by combining the work of [14] and [4]), symmetry reduction, compositional verification (like e.g. [20]) and partial order reductions.…”

Section: Resultsmentioning

confidence: 99%

“…It could be extended to larger systems either by combining it with compositional verification techniques (e.g. for Object-Z [20]), or by constructing a program dependence graph of the whole system. The latter could be achieved by combining program dependence graphs of the individual objects through a special new dependency arc reflecting the call structure between objects (possibly following approaches for slicing programs with procedures).…”

Section: Resultsmentioning

confidence: 99%

“…In the next section we introduce Object-Z (or more precisely, the Object-Z part of CSP-OZ) by means of a small example which we later use for slicing. Furthermore, following Winter and Smith [20] we define a Kripke structure semantics for Object-Z. This is used as the basis for interpreting the temporal logic (SE-IL) formulae.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Slicing Object-Z Specifications for Verification

Brückner

Wehrheim

2005

ZB 2005: Formal Specification and Development in Z and B

View full text Add to dashboard Cite

Abstract. Slicing is the activity of reducing a program or a specification with respect to a given condition (the slicing criterion) such that the condition holds on the full program if and only if it holds on the reduced program. Originating from program analysis the entity to be sliced is usually a program and the slicing criterion a value of a variable at a certain program point. In this paper we present an approach to slicing Object-Z specifications with temporal logic formulae as slicing criteria and show the correctness of our approach. The underlying motivation is the goal to substantially reduce the size of the specification and subsequently facilitate verification of temporal logic properties.

show abstract

Section: Resultsmentioning

confidence: 99%

Section: Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Slicing Object-Z Specifications for Verification

Brückner

Wehrheim

2005

ZB 2005: Formal Specification and Development in Z and B

View full text Add to dashboard Cite

show abstract

“…This can be done by combining the technique presented here with compositional verification techniques. In the setting of Object-Z this could for instance be the work of [16]. Another important issue is the actual computation of the influence set: in order to be able to apply our technique the influence set should be as small as possible and thus purely syntax-oriented computations might not be practical.…”

Section: Resultsmentioning

confidence: 99%

Inheritance of Temporal Logic Properties

Wehrheim

2003

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Inheritance is one of the key features for the success of object-oriented languages. Inheritance (or specialisation) supports incremental design and re-use of already written specifications or programs. In a formal approach to system design the interest does not only lie in re-use of class definitions but also in re-use of correctness proofs. If a provably correct class is specialised we like to know those correctness properties which are preserved in the subclass. This can avoid re-verification of already proven properties and may thus substantially reduce the verification effort. In this paper we study the question of inheritance of correctness properties in the context of state-based formalisms, using a temporal logic (CTL) to formalise requirements on classes. Given a superclass and its specialised subclass we develop a technique for computing the set of formulas which are preserved in the subclass. For specialisation we allow addition of attributes, modification of existing as well as extension with new methods.

show abstract

“…Using a structured notation like Object-Z would allow us to additionally use specification decomposition as a means of reducing complexity. This has been examined by Winter and Smith [WS03] and could be combined with this work to increase its effectiveness in dealing with large specifications.…”

Section: Discussionmentioning

confidence: 99%

Proving Temporal Properties of Z Specifications Using Abstraction

Smith

Winter

2003

ZB 2003: Formal Specification and Development in Z and B

Self Cite

View full text Add to dashboard Cite

Abstract. This paper presents a systematic approach to proving temporal properties of arbitrary Z specifications. The approach involves (i) transforming the Z specification to an abstract temporal structure (or state transition system), (ii) applying a model checker to the temporal structure, (iii) determining whether the temporal structure is too abstract based on the model checking result and (iv) refining the temporal structure where necessary. The approach is based on existing work from the model checking literature, adapting it to Z.

show abstract

Compositional Verification for Object-Z

Cited by 6 publications

References 11 publications

Slicing Object-Z Specifications for Verification

Slicing Object-Z Specifications for Verification

Inheritance of Temporal Logic Properties

Proving Temporal Properties of Z Specifications Using Abstraction

Contact Info

Product

Resources

About