18 search results - page 1 / 4 » SAT-based unbounded symbolic model checking |
135
Voted
CAV
2003
Springer
15 years 10 months ago
2003
Springer
Abstract. We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circ...
110
Voted
DAC
2003
ACM
16 years 5 months ago
2003
ACM
154
Voted
CAV
2003
Springer
15 years 10 months ago
2003
Springer
175
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
We present an approach to the problem of verification of epistemic properties of multi-agent systems by means of symbolic model checking. In particular, it is shown how to extend ...
129
Voted
FMCAD
2006
Springer
15 years 8 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...