Searching for authors named Dennis Dams – sorted by Relevance.
18 documents found, showing 1 through 10.
Next 10 →
-
Abstraction in software model checking: Principles and practice
- …Abstract. This paper provides a brief description, including a bibliography, of the SPIN2002 tutorial on abstraction in model checking of software. 1…
- Cited by 5 (0 self) – Add To MetaCart
-
Comparing abstraction refinement algorithms
- …We present a generic algorithm that provides a unifying scheme for the comparison of abstraction refinement algorithms. It is centered around the notion of refinement cue which generalizes counterexamples. It is demonstrated how the essential features of several refinement algorithms can be captured…
- Cited by 2 (0 self) – Add To MetaCart
-
Flat Fragments of CTL and CTL*: Separating the Expressive and Distinguishing Powers
- …We study both the expressive and the distinguishing powers of at temporal logics. These are fragments obtained by restricting the rst argument of the Until operator to propositional formulae. Both the linear-time and the branching-time cases are considered. Keywords: temporal logic, LTL, CTL, expre…
- Cited by 10 (0 self) – Add To MetaCart
-
Discrete Time Promela and Spin
- …Spin is software package for verification of concurrent systems. The formal models of the systems that are verified, are built in Promela - Spin's input language. We present an extension of Promela and Spin with discrete time that provides an opportunity to model systems which correct functioning cr…
- Cited by 1 (0 self) – Add To MetaCart
-
Fair Model Checking of Abstractions (Extended Abstract)
- …ions (Extended Abstract) Dennis Dams Rob Gerth y Orna Grumberg z Abstract Model checking temporal logic over abstracted transition systems under fairness constraints needs to be done with some care. This paper discusses why and how. 1 Introduction This section introduces the concepts of…
- Add To MetaCart
-
Combining Theorem Proving and Model Checking - A Case Study
- …We report on a case study on the verification of the Bounded Retransmission Protocol in which the inductive theorem prover INKA was used to justify data abstractions. These abstractions arose in building a finite-state verification model, to be submitted to a model checker. Our initial experiments l…
- Add To MetaCart
-
A Heuristic for the Automatic Generation of Ranking Functions
- …The duality between invariance and progress is fundamental in proof techniques for the verication of programs. Proving invariance requires the construction of invariants, while progress proofs hinge on the identication of appropriate ranking functions. With the recent interest in automated verica…
- Cited by 9 (0 self) – Add To MetaCart
-
Abstracting C with abC
- …Abstract. A conceptually simple and practically very useful form of data abstraction in model checking is variable hiding, which amounts to suppressing all information about a given set of variables. The abC tool automates this for programs written in the C programming language. It features an integ…
- Cited by 1 (0 self) – Add To MetaCart
-
A Heuristic for Symmetry Reductions with Scalarsets
- …We present four versions of a new heuristic for coping with the problem of finding (canonical) representatives of symmetry equivalence classes (the so-called orbit problem), in symmetry techniques for model checking. The practical implementation of such techniques hinges on appropriate workarounds o…
- Cited by 13 (3 self) – Add To MetaCart
-
Model Checking SDL with Spin
- …We present an attempt to use the model checker Spin as a verification engine for SDL, with special emphasis put on the verification of timing properties of SDL models. We have extended Spin with a front-end that allows to translate SDL to Promela (the input language of Spin), and a back-end that all…
- Cited by 9 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
