Slicing Concurrent Real-Time System Specifications for Verification

Brückner, Ingo

doi:10.1007/978-3-540-73210-5_4

Cited by 6 publications

(8 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…A further extension to CSP-OZ-DC, a combination of CSP, Object-Z and Duration Calculus, is given in [43]. In their approach, the slice preserves formulas of a temporal logic which is invariant to stuttering (e.g., LTL −X ).…”

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

“…They also make use of a ‘Program’ dependence graph that is built from control and data dependencies. Building upon this work, Brückner then used slicing to reduce the space explosion problem during property verification .…”

Section: Related Workmentioning

confidence: 99%

Metrics for quantifying evolutionary changes in Z specifications

Bollin

2013

J Software Evolu Process

View full text Add to dashboard Cite

SUMMARYThis article proposes metrics for quantifying changes throughout the evolution of formal software specifications in long living systems. Formal specifications play an important role in the software development life-cycle by supporting refinement and proof and by providing a basis for comprehension and maintenance activities. However, specifications also undergo evolutionary changes, and these changes are hard to assess because of a lack of suitable measures.This paper proposes and analyzes a set of measures for estimating aspects of a specification's complexity and quality. The measures are based on existing measures for source code, but they have been redefined in the scope of formal Z specifications. Geared towards Z, they are then evaluated concerning their expressiveness by a case study that comprises more than 65,000 lines of specification text. Finally, the usability of the measures is demonstrated on the Z specification of the Web Service Definition Language during its evolution over a period of about 3 years.

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

Slicing Concurrent Real-Time System Specifications for Verification

Cited by 6 publications

References 23 publications

Next-preserving branching bisimulation

Next-preserving branching bisimulation

Metrics for quantifying evolutionary changes in Z specifications

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

Contact Info

Product

Resources

About