Sciweavers

5216 search results - page 215 / 1044
» Planning as Model Checking
Sort
View
139
Voted
TOCL
2011
87views more  TOCL 2011»
14 years 10 months ago
The tractability of model checking for LTL: The good, the bad, and the ugly fragments
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
Michael Bauland, Martin Mundhenk, Thomas Schneider...
FMSD
2011
236views Formal Methods» more  FMSD 2011»
14 years 7 months ago
Automatic analysis of DMA races using model checking and k-induction
Alastair F. Donaldson, Daniel Kroening, Philipp R&...
106
Voted
PLDI
2011
ACM
14 years 6 months ago
Predicate abstraction and CEGAR for higher-order model checking
Naoki Kobayashi, Ryosuke Sato, Hiroshi Unno
190
Voted
COMPSAC
2011
IEEE
14 years 3 months ago
Conformance Checking with Constraint Logic Programming: The Case of Feature Models
Raúl Mazo, Robert Erick Lopez-Herrejon, Cam...