Model Checking Duration Calculus: A Practical Approach

Meyer, Roland; Faber, Johannes; Rybalchenko, Andrey

doi:10.1007/11921240_23

Cited by 19 publications

(17 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this section, we show that the properties of the algorithm that are stated in Lemmas 2 and 3 (and proven in [8]) suffice to characterize the rt-inconsistency of ϕ. From now on, we refer to the construction of A from ϕ by the algorithm of [11].…”

Section: Characterizing Rt-inconsistency Via Phase Event Automatamentioning

confidence: 93%

See 1 more Smart Citation

rt-Inconsistency: A New Property for Real-Time Requirements

Post

Hoenicke

Podelski

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

Abstract. We introduce rt-inconsistency, a property of real-time requirements. The property reflects that the requirements specify apparently inconsistent timing constraints. We present an algorithm to check rt-inconsistency automatically. The algorithm works via a stepwise reduction to real-time model checking. We implement the algorithm using an existing module for the reduction and the UPPAAL tool for the realtime model checking. As a case study, we apply our prototype implementation to existing real-time requirements for automotive projects at BOSCH. The case study demonstrates the relevance of rt-inconsistency for detecting errors in industrial real-time requirements specifications.

show abstract

Section: Characterizing Rt-inconsistency Via Phase Event Automatamentioning

confidence: 93%

“…We will use the algorithm of [8,11] which, given a requirement ϕ, constructs a phase event automaton A that represents ϕ. In this section, we show that the properties of the algorithm that are stated in Lemmas 2 and 3 (and proven in [8]) suffice to characterize the rt-inconsistency of ϕ.…”

Section: Characterizing Rt-inconsistency Via Phase Event Automatamentioning

confidence: 99%

rt-Inconsistency: A New Property for Real-Time Requirements

Post

Hoenicke

Podelski

2011

Fundamental Approaches to Software Engineering

View full text Add to dashboard Cite

show abstract

“…For applications of CSP-OZ see the papers by Fischer and Wehrheim [1999], Möller et al [2008], and Basin et al [2007]. For automatic verification of CSP-OZ-DC specifications against real-time properties we refer to Meyer et al [2008]. Semantically, fairness can be viewed as an attempt at reducing the amount of nondeterminism in the computations of programs.…”

Section: Bibliographic Remarksmentioning

confidence: 99%

Verification of Sequential and Concurrent Programs

Apt

Olderog

2009

Texts in Computer Science

158

131

View full text Add to dashboard Cite

“…We applied ARMC to verify safety properties of train controller systems [26]. These examples depend crucially on the ability of our algorithm to handle strict inequalities directly.…”

Section: Casementioning

confidence: 99%

“…Our experiments with Blast on Windows device drivers provide a direct comparison with the existing tool FOCI [23], and show promising running times in favour of the constraint based approach. Our method can handle systems which pose problems to other interpolation-based provers: It allowed us, for instance, to apply ARMC to verify safety properties of train controller systems [26], which required inference of predicates with both strict and nonstrict inequalities, and it allows us to verify examples that require predicates over up to four variables. Furthermore, our algorithm Inter LI (Q) provides a basis for dealing with linear arithmetic in the interpolation procedure CSIsat [1], which is integrated in Blast and has been successfully applied on software verification benchmarks.…”

Section: Introductionmentioning

confidence: 99%

Constraint Solving for Interpolation

Rybalchenko

Sofronie-Stokkermans

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Abstract. Interpolation is an important component of recent methods for program verification. It provides a natural and effective means for computing separation between the sets of 'good' and 'bad' states. The existing algorithms for interpolant generation are proof-based: They require explicit construction of proofs, from which interpolants can be computed. Construction of such proofs is a difficult task. We propose an algorithm for the generation of interpolants for the combined theory of linear arithmetic and uninterpreted function symbols that does not require a priori constructed proofs to derive interpolants. It uses a reduction of the problem to constraint solving in linear arithmetic, which allows application of existing highly optimized Linear Programming solvers in black-box fashion. We provide experimental evidence of the practical applicability of our algorithm.

show abstract

Model Checking Duration Calculus: A Practical Approach

Cited by 19 publications

References 15 publications

rt-Inconsistency: A New Property for Real-Time Requirements

rt-Inconsistency: A New Property for Real-Time Requirements

Verification of Sequential and Concurrent Programs

Constraint Solving for Interpolation

Contact Info

Product

Resources

About