Slicing Object-Z Specifications for Verification

Brückner, Ingo; Wehrheim, Heike

doi:10.1007/11415787_24

Cited by 21 publications

(19 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, Brückner and Wehrheim in [42] slice Object-Z for verification and in [30] extend the approach to CSP-OZ, a language that combines CSP and Object-Z. A further extension to CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, is given in [43].…”

Section: Related Workmentioning

confidence: 99%

Next-preserving branching bisimulation

Yatapanage

Winter

2015

Theoretical Computer Science

View full text Add to dashboard Cite

Bisimulations are in general equivalence relations between transition systems which assure that certain aspects of the behaviour of the systems are the same. For many applications it is not possible to maintain such an equivalence unless non-observable (stuttering) behaviour is ignored. However, existing bisimulation relations which permit the removal of non-observable behaviour are unable to preserve temporal logic formulas referring to the next step operator. In this paper we propose a novel bisimulation relation, called next-preserving branching bisimulation, which accomplishes this, maintaining the validity of formulas with the next step, while still allowing non-observable behaviour to be reduced. Based on van Glabbeek and Weijland's notion of branching bisimulation with explicit divergence, we define the novel relation for which we prove the preservation of full CTL * . As an example for its application we show how this definition gives rise to an advanced slicing procedure for temporal logics, a technique in which a system model is reduced to a slice which can be used as a substitute in verification and debugging. The result is a novel procedure for generating a slice that is next-preserving branching bisimilar to the original model. Hence, we can assure that any temporal logic property is preserved in a slice that is created with respect to that property, and consequently the verification on the slice is sound.

show abstract

Section: Related Workmentioning

confidence: 99%

Next-preserving branching bisimulation

Yatapanage

Winter

2015

Theoretical Computer Science

View full text Add to dashboard Cite

show abstract

“…The variables in the predicates in the postcondition of an operation can be considered to be control dependent on the variables in the predicates in the precondition [3]. The rationale for this is that pre : P post : Q can be interpreted as "if P holds, carry out the updates specified by Q, else perform an arbitrary update".…”

Section: Lf Lslefton() Lf Lsrighton() Casetdistance(5)mentioning

confidence: 99%

“…Slicing techniques for specification languages such as Z [32] and Object-Z [3] have been defined, based on variants of the concepts of control and data dependence used to calculate slicing for programs. However, UML contains both declarative elements, such as pre-and post-conditions, and imperative elements, such as state machines and activities, so that slicing techniques for UML must treat both aspects in an integrated manner.…”

Section: Introductionmentioning

confidence: 99%

Slicing Techniques for UML Models.

Lano¹,

Kolahdouz-Rahimi²

2011

JOT

View full text Add to dashboard Cite

This paper defines techniques for the slicing of UML models, that is, for the restriction of models to those parts which specify the properties and behaviour of a subset of the elements within them. The purpose of this restriction is to produce a smaller model which permits more effective analysis and comprehension than the complete model, and also to form a step in factoring of a model. We consider class diagrams, single state machines, and communicating sets of state machines.

show abstract

“…In comparison to conventional dependence graphs these dependencies yield additional information about the specification allowing us to construct a more precise dependence graph and thus a more precise slicing outcome. Building upon previous work [4,3], we show correctness of our approach not only with respect to test formulas, but, more generally, with respect to any logic which is invariant under stuttering, i.e., which cannot distinguish between interpretations that are equivalent up to some stuttering steps (defined by sets of irrelevant variables and events obtained from slicing).…”

Section: Introductionmentioning

confidence: 66%

“…Now we start the actual correctness proof with several lemmas showing the relationships between CSP processes and events and variables which remain in the specification. Due to space restrictions we only present the main ideas of the proofs.The complete proofs can be found in [1].…”

Section: Reduced Specificationmentioning

confidence: 99%

Slicing Concurrent Real-Time System Specifications for Verification

Brückner

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract.The high-level specification language CSP-OZ-DC has been shown to be well-suited for modelling and analysing industrially relevant concurrent real-time systems. It allows us to model each of the most important functional aspects such as control flow, data, and real-time requirements in adequate notations, maintaining a common semantic foundation for subsequent verification. Slicing on the other hand has become an established technique to complement the fight against state space explosion during verification which inherently accompanies increasing system complexity. In this paper, we exploit the special structure of CSP-OZ-DC specifications by extending the dependence graph-which usually serves as a basis for slicing-with several new types of dependencies, including timing dependencies derived from the specification's DC part. Based on this we show how to compute a specification slice and prove correctness of our approach.

show abstract

Slicing Object-Z Specifications for Verification

Cited by 21 publications

References 17 publications

Next-preserving branching bisimulation

Next-preserving branching bisimulation

Slicing Techniques for UML Models.

Slicing Concurrent Real-Time System Specifications for Verification

Contact Info

Product

Resources

About