96 search results - page 4 / 20 » Three-valued logic in bounded model checking |
CHARME
2003
Springer
15 years 2 months ago
2003
Springer
We consider the problem of bounded model checking of systems expressed in a decidable fragment of first-order logic. While model checking is not guaranteed to terminate for an ar...
LOGCOM
2002
14 years 9 months ago
2002
This paper defines and examines model checking games for the branching time temporal logic CTL . The games employ a technique called focus which enriches sets by picking out one d...
ATVA
2008
Springer
14 years 11 months ago
2008
Springer
Multi-valued Model Checking is an extension of classical, two-valued model checking with multi-valued logic. Multi-valuedness has been proved useful in expressing additional inform...
ENTCS
2007
14 years 9 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
DAC
2006
ACM
15 years 10 months ago
2006
ACM
In this paper, we present a method that helps improve the performance of Bounded Model Checking by automatically strengthening invariants so that the termination proof may be obta...