Sciweavers

54 search results - page 2 / 11
» Incompleteness of states w.r.t. traces in model checking
Sort
View
SPIN
2010
Springer
13 years 3 months ago
Nevertrace Claims for Model Checking
In this paper, we propose the nevertrace claim, which is a new construct for specifying the correctness properties that either finite or infinite execution traces (i.e., sequence...
Zhe Chen, Gilles Motet
ATVA
2006
Springer
130views Hardware» more  ATVA 2006»
13 years 9 months ago
The Implementation of Mazurkiewicz Traces in POEM
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...
Peter Niebert, Hongyang Qu
TACAS
2009
Springer
132views Algorithms» more  TACAS 2009»
14 years 3 days ago
Transition-Based Directed Model Checking
Abstract. Directed model checking is a well-established technique that is tailored to fast detection of system states that violate a given safety property. This is achieved by in...
Martin Wehrle, Sebastian Kupferschmid, Andreas Pod...
CONCUR
2006
Springer
13 years 9 months ago
A Livelock Freedom Analysis for Infinite State Asynchronous Reactive Systems
We describe an incomplete but sound and efficient livelock freedom test for infinite state asynchronous reactive systems. The method s a system into a set of simple control flow cy...
Stefan Leue, Alin Stefanescu, Wei Wei
ERSHOV
2009
Springer
13 years 12 months ago
Symbolic Bounded Conformance Checking of Model Programs
Abstract. Model programs are high-level behavioral specifications typically representing Abstract State Machines or ASMs. Conformance checking of model programs is the problem of ...
Margus Veanes, Nikolaj Bjørner