20 search results - page 4 / 4 » SAT Based Bounded Model Checking with Partial Order Semantic... |
ERSHOV
2006
Springer
13 years 6 months ago
2006
Springer
Abstract. We address model checking problem for combination of Computation Tree Logic (CTL) and Propositional Logic of Knowledge (PLK) in finite systems with the perfect recall syn...
CP
2008
Springer
13 years 6 months ago
2008
Springer
Abstract. This paper studies how to verify the conformity of a program with its specification and proposes a novel constraint-programming framework for bounded program verification...
DLOG
2004
13 years 6 months ago
2004
We present algorithms based on truth-prefixed tableaux to solve both Concept Abduction and Contraction in ALN DL. We also analyze the computational complexity of the problems, sho...
SEFM
2009
IEEE
13 years 11 months ago
2009
IEEE
Interval temporal logics are based on interval structures over linearly (or partially) ordered domains, where time intervals, rather than time instants, are the primitive ontologi...
CORR
2009
Springer
13 years 2 months ago
2009
Springer
Abstract. We apply Uppaal Tiga to automatically compute adaptive scheduling strategies for an industrial case study dealing with a state-of-the-art image processing pipeline of a p...