175 search results - page 5 / 35 » The Complexity of Model Checking Higher-Order Fixpoint Logic |
ENTCS
2007
14 years 9 months ago
2007
We present a syntactic scheme for translating future-time LTL bounded model checking problems into propositional satisfiability problems. The scheme is similar in principle to th...
CADE
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
ECAI
2010
Springer
14 years 10 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...
JAPLL
2006
14 years 9 months ago
2006
This paper presents a model checking algorithm for Propositional Dynamic Logic (PDL) with looping, repeat, test, intersection, converse, program complementation as well as context...
CORR
2006
Springer
14 years 9 months ago
2006
Springer
This paper presents a new type analysis for logic programs. The analysis is performed with a priori type definitions; and type expressions are formed from a fixed alphabet of type...