Slicing an Integrated Formal Method for Verification

Brückner, Ingo; Wehrheim, Heike

doi:10.1007/11576280_25

Cited by 22 publications

(44 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

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

See 1 more Smart Citation

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: Slicing Behavior Tree Modelsmentioning

confidence: 99%

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

show abstract

“…PEA are translated further into Transition Constraint Systems (TCS) serving as input to the model checkers ARMC (Abstraction-Refinement Model Checker) and SLAB (Slicing-Abstraction Model Checker) that use Craig interpolation and decision procedures for data in order to refine their abstractions. Some reductions of the state spaces were achieved by applying a priori slicing techniques to COD specifications [4,5].…”

Section: Overview Of the Project R1mentioning

confidence: 99%

Automatic Verification of Real-Time Systems with Rich Data: An Overview

Olderog

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. We present an overview of the results of the project "Beyond Timed Automata" of the Collaborative Research Center AVACS (Automatic Verification and Analysis of Complex Systems) during the period 2008-2011, which advances the automatic verification of high-level specifications of systems exhibiting the three dimensions of process behavior, complex infinite data, and continuous real-time-beyond the capabilities of Timed Automata.

show abstract

“…Our work is mainly based on the initial work described in [BW05], that introduces an extension of the program slicing techniques to models. Program slicing is a technique introduced in [Wei84] which proceeds by removing parts of a program in order to focus on behaviors of specific parts of the program.…”

Section: Syntactical Abstractionmentioning

confidence: 99%

B model slicing and predicate abstraction to generate tests

et al. 2011

View full text Add to dashboard Cite

In a model-based testing approach as well as for the verification of properties, B models provide an interesting modelling solution. However, for industrial applications, the size of their state space often makes them hard to handle. To reduce the amount of states, an abstraction function can be used. The abstraction is often a domain abstraction of the state variables that requires many proof obligations to be discharged, which can be very time consuming for real applications.This paper presents a contribution to this problem that complements an approach based on domain abstraction for test generation, by adding a preliminary syntactic abstraction phase, based on variable elimination. We define a syntactic transformation that suppresses some variables from a B event model, in addition to three methods that choose relevant variables according to a test purpose. In this way, we propose a method that computes an abstraction of a source model M according to a set of selected relevant variables. Depending on the method used, the abstraction can be computed as a simulation or as a bisimulation of M. With this approach, the abstraction process produces a finite state system. We apply this abstraction computation to a Model Based Testing process. We evaluate experimentally the impact of the model simplification by variables elimination on the size of the models, on the number of proof obligations to discharge, on the precision of the abstraction and on the coverage achieved by the test generation.

show abstract

Slicing an Integrated Formal Method for Verification

Cited by 22 publications

References 16 publications

Next-preserving branching bisimulation

Next-preserving branching bisimulation

Automatic Verification of Real-Time Systems with Rich Data: An Overview

B model slicing and predicate abstraction to generate tests

Contact Info

Product

Resources

About