Sciweavers

571 search results - page 13 / 115
» Performing causality analysis by bounded model checking
Sort
View
ENTCS
2007
119views more  ENTCS 2007»
14 years 11 months ago
Interpolant Learning and Reuse in SAT-Based Model Checking
Bounded Model Checking (BMC) is one of the most paradigmatic practical applications of Boolean Satisfiability (SAT). The utilization of SAT in model checking has allowed signifi...
João Marques-Silva
CAV
2004
Springer
136views Hardware» more  CAV 2004»
15 years 3 months ago
JNuke: Efficient Dynamic Analysis for Java
JNuke is a framework for verification and model checking of Java programs. It is a novel combination of run-time verification, explicit-state model checking, and counter-example ex...
Cyrille Artho, Viktor Schuppan, Armin Biere, Pasca...
EAAI
2007
135views more  EAAI 2007»
14 years 11 months ago
Automatic generation of explanations: AGE
Explaining how engineering devices work is important to students, engineers, and operators. In general, machine generated explanations have been produced from a particular perspec...
Silvia B. González-Brambila, Eduardo F. Mor...
JMLR
2006
190views more  JMLR 2006»
14 years 11 months ago
Causal Graph Based Decomposition of Factored MDPs
We present Variable Influence Structure Analysis, or VISA, an algorithm that performs hierarchical decomposition of factored Markov decision processes. VISA uses a dynamic Bayesia...
Anders Jonsson, Andrew G. Barto
ICPP
1999
IEEE
15 years 4 months ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward