Sciweavers

5216 search results - page 27 / 1044
» Planning as Model Checking
Sort
View
ENTCS
2007
119views more  ENTCS 2007»
13 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
WWW
2001
ACM
14 years 11 months ago
MCWEB: A Model-Checking Tool for Web Site Debugging
We show how model checking techniques can be applied to the analysis of connectivity and cost-of-traversal properties of Web sites.
Luca de Alfaro, Thomas A. Henzinger, Freddy Y. C. ...
TIME
2009
IEEE
14 years 5 months ago
Model Checking CTL is Almost Always Inherently Sequential
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...
ECAI
2008
Springer
14 years 16 hour ago
Diagnosis of Simple Temporal Networks
In many domains successful execution of plans requires careful monitoring and repair. Diagnosis of plan execution supports this process by identifying causes of plan failure. Most ...
Nico Roos, Cees Witteveen
CAV
2001
Springer
119views Hardware» more  CAV 2001»
14 years 3 months ago
Certifying Model Checkers
Model Checking is an algorithmic technique to determine whether a temporal property holds of a program. For linear time properties, a model checker produces a counterexample comput...
Kedar S. Namjoshi