257 search results - page 10 / 52 » The Complexity of Model Checking for Propositional Default L... |
CAV
2007
Springer
14 years 1 months ago
2007
Springer
We present Hector, a software tool for combining different abstraction methods to extract sound models of heap-manipulating imperative programs with recursion. Extracted models ma...
ECAI
2010
Springer
13 years 8 months ago
2010
Springer
In the clock semantics for epistemic logic, two situations are indistinguishable for an agent when it makes the same observation and the time in the situations is the same. The pa...
KBSE
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider a formal framework for property verification of web applications using Spin model checker. Some of the web related properties concern all states of the model, while ot...
IJISEC
2008
13 years 7 months ago
2008
We present a model checking technique for security protocols based on a reduction to propositional logic. At the core of our approach is a procedure that, given a description of th...
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Propositional bounded model checking has been applied successfully to verify embedded software but is limited by the increasing propositional formula size and the loss of structur...