577 search results - page 15 / 116 » Model Checking Based on Simultaneous Reachability Analysis |
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We present Boom, a comprehensive analysis tool for Boolean programs. We focus in this paper on model-checking non-recursive concurrent programs. Boom implements a recent ...
AI
2008
Springer
13 years 8 months ago
2008
Springer
Verification of reachability properties for probabilistic systems is usually based on variants of Markov processes. Current methods assume an exact model of the dynamic behavior a...
ATVA
2004
Springer
13 years 11 months ago
2004
Springer
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
ATVA
2006
Springer
13 years 11 months ago
2006
Springer
Chaining can reduce the number of iterations required for symbolic state-space generation and model-checking, especially in Petri nets and similar asynchronous systems, but require...
AMAST
2008
Springer
13 years 10 months ago
2008
Springer
Term Rewriting Systems (TRSs) are now commonly used as a modeling language for applications. In those rewriting based models, reachability analysis, i.e. proving or disproving that...