1018 search results - page 23 / 204 » Abstraction and Refinement in Model Checking |
LICS
2005
IEEE
14 years 1 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
CAV
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. Proofs of progress properties often require fairness assumptions. Incorporating global fairness assumptions in a compositional method is a challenge, however, given the l...
POPL
2010
ACM
13 years 7 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
TSE
2011
13 years 2 months ago
2011
—Conventional testing methods often fail to detect hidden flaws in complex embedded software such as device drivers or file systems. This deficiency incurs significant developmen...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
We are interested in verifying dynamic properties of finite state reactive systems under fairness assumptions by model checking. The systems we want to verify are specified throug...