5015 search results - page 11 / 1003 » Model Checking a Path |
CADE
2002
Springer
15 years 9 months ago
2002
Springer
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
SPIN
2000
Springer
15 years 1 months ago
2000
Springer
This paper describes how two runtime analysis algorithms, an existing data race detection algorithm and a new deadlock detection algorithm, have been implemented to analyze Java pr...
ENTCS
2006
14 years 9 months ago
2006
The standard translation of a Bounded Model Checking (BMC) instance into a satisfiability problem, (a.k.a SAT), might produce misleading results in the case when the model under v...
100
click to vote
CONCUR
1997
Springer
15 years 1 months ago
1997
Springer
We apply the symbolic analysis principle to pushdown systems. We represent (possibly in nite) sets of con gurations of such systems by means of nite-state automata. In order to re...
OOPSLA
2010
Springer
14 years 7 months ago
2010
Springer
Glass box software model checking incorporates novel techniques to identify similarities in the state space of a model checker and safely prune large numbers of redundant states w...