13 search results - page 1 / 3 » Modal vs. Propositional Reasoning for model checking with De... |
DLOG
2007
13 years 7 months ago
2007
DLOG
2006
13 years 7 months ago
2006
Abstract. Model checking is a fully automated technique for determining whether the behaviour of a finite-state reactive system satisfies a temporal logic specification. Despite th...
LICS
2005
IEEE
13 years 11 months ago
2005
IEEE
Three-valued models, in which properties of a system are either true, false or unknown, have recently been advocated as a better representation for reactive program abstractions g...
CADE
2007
Springer
14 years 5 months ago
2007
Springer
We present an encoding that is able to specify LTL bounded model checking problems within the Bernays-Sch?onfinkel fragment of first-order logic. This fragment, which also correspo...
DLOG
1998
13 years 7 months ago
1998
Effective systems for expressive description logics require a heavily-optimised subsumption checker incorporating a range of optimisation techniques. Because of the correspondence...