Slicing Z specifications

Wu, Fangjun; Tong, Yanhong

doi:10.1145/1026474.1026481

Cited by 24 publications

(16 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are two strands of research which touch upon our work. The first is on slicing of formal specifications, which has mainly been done for Z specifications [3,22]. These works, however, do not consider verification, i.e.…”

Section: Resultsmentioning

confidence: 99%

Slicing an Integrated Formal Method for Verification

Brückner

Wehrheim

2005

Formal Methods and Software Engineering

View full text Add to dashboard Cite

Abstract. Model checking specifications with complex data and behaviour descriptions often fails due to the large state space to be processed. In this paper we propose a technique for reducing such specifications (with respect to certain properties under interest) before verification. The method is an adaption of the slicing technique from program analysis to the area of integrated formal notations and temporal logic properties. It solely operates on the syntactic structure of the specification which is usually significantly smaller than its state space. We show how to build a reduced specification via the construction of a so called program dependence graph, and prove correctness of the technique with respect to a projection relationship between full and reduced specification. The reduction thus preserves all properties formulated in temporal logics which are invariant under stuttering, as for instance LTL−X .

show abstract

Section: Resultsmentioning

confidence: 99%

Slicing an Integrated Formal Method for Verification

Brückner

Wehrheim

2005

Formal Methods and Software Engineering

View full text Add to dashboard Cite

show abstract

“…The technique utilises flow information of the model and dependencies between its elements to eliminate parts which are not relevant to a specific criteria, called the slicing criteria. Slicing has been defined for various programming languages (for an overview see [22,23]) and lately also for a number of formal modelling notations (e.g., [24,25,26,27,28,29,30,31,32,33]). Slicing of a formal model is of particular interest if an automated analysis of the model is intended, using for example a model checker.…”

Section: Slicing Behavior Tree Modelsmentioning

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

“…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

Slicing Z specifications

Cited by 24 publications

References 18 publications

Slicing an Integrated Formal Method for Verification

Slicing an Integrated Formal Method for Verification

Next-preserving branching bisimulation

Slicing Techniques for UML Models.

Contact Info

Product

Resources

About