493 search results - page 23 / 99 » Bounded LTL Model Checking with Stable Models |
CHARME
2005
Springer
14 years 1 months ago
2005
Springer
The evolution of SAT technology over the last decade has motivated its application in model checking, initially through the utilization of SAT in bounded model checking (BMC) and, ...
ICLP
1999
Springer
13 years 12 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
FORMATS
2004
Springer
14 years 1 months ago
2004
Springer
For successful software verification, model checkers must be capable of handling a large number of program variables. Traditional, BDD-based model checking is deficient in this reg...
ATVA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Bounded model checking (BMC) is a technique for overcoming the state explosion problem which has gained wide industrial acceptance. Bounded model checking is typically ap...
CAV
2000
Springer
13 years 12 months ago
2000
Springer
Abstract. Bounded Model Checking based on SAT methods has recently been introduced as a complementary technique to BDD-based Symbolic Model Checking. The basic idea is to search fo...