Sciweavers

231 search results - page 13 / 47
» Mu-calculus path checking
Sort
View
95
Voted
JDA
2007
77views more  JDA 2007»
15 years 1 months ago
Path coupling without contraction
Path coupling is a useful technique for simplifying the analysis of a coupling of a Markov chain. Rather than defining and analysing the coupling on every pair in Ω×Ω, where...
Magnus Bordewich, Martin E. Dyer
107
Voted
CONCUR
2009
Springer
15 years 7 months ago
Counterexamples in Probabilistic LTL Model Checking for Markov Chains
We propose how to present and compute a counterexample in probabilistic LTL model checking for discrete-time Markov chains. In qualitative probabilistic model checking, we present ...
Matthias Schmalz, Daniele Varacca, Hagen Völz...
109
Voted
DAC
2006
ACM
16 years 2 months ago
Automatic invariant strengthening to prove properties in bounded model checking
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...
Mohammad Awedh, Fabio Somenzi
135
Voted
ATVA
2008
Springer
87views Hardware» more  ATVA 2008»
15 years 3 months ago
Goanna: Syntactic Software Model Checking
Goanna is an industrial-strength static analysis tool used in academia and industry alike to find bugs in C/C++ programs. Unlike existing approaches Goanna uses the off-the-shelf N...
Ralf Huuck, Ansgar Fehnker, Sean Seefried, Jö...
202
Voted
POPL
2005
ACM
16 years 1 months ago
Dynamic partial-order reduction for model checking software
We present a new approach to partial-order reduction for model checking software. This approach is based on initially exploring an arbitrary interleaving of the various concurrent...
Cormac Flanagan, Patrice Godefroid