622 search results - page 23 / 125 » Answer Set Programming and Bounded Model Checking |
140
click to vote
ESOP
2003
Springer
15 years 11 months ago
2003
Springer
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from ...
210
click to vote
NFM
2011
15 years 26 days ago
2011
A main idea underlying bounded model checking is to limit the length of the potential counter-examples, and then prove properties for the bounded version of the problem. In softwar...
159
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Description Logic Programs (dl-programs) proposed by Eiter et al. constitute an elegant yet powerful formalism for the integration of answer set programming with description logic...
192
click to vote
TABLEAUX
2007
Springer
16 years 12 hour ago
2007
Springer
Abstract. Model checking is a technique for verifying that a finite-state concurrent system is correct with respect to its specification. In bounded model checking (BMC), the sys...
190
click to vote
ATVA
2007
Springer
16 years 2 days ago
2007
Springer
This paper presents a bounded model checking algorithm for the verification of analog and mixed-signal (AMS) circuits using a satisfiability modulo theories (SMT) solver. The sys...