3820 search results - page 38 / 764 » Bounded Model Debugging |
CINQ
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
COCO
2003
Springer
14 years 28 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
MEMOCODE
2005
IEEE
14 years 1 months ago
2005
IEEE
In principle, bounded model checking (BMC) leads to semidecision procedures that can be used to verify liveness properties and to falsify safety properties. If the procedures fail...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
We present TECTLK, a logic to specify knowledge and real time in multi-agent systems. We show that the model checking problem is decidable, and we present an algorithm for TECTLK ...
CAV
2005
Springer
14 years 1 months ago
2005
Springer
Bounded model checking is an efficient method for finding bugs in system designs. The major drawback of the basic method is that it cannot prove properties, only disprove them. R...