38 search results - page 1 / 8 » Model Checking of Restricted CTL* Formulas using ALCK |
DLOG
2007
14 years 1 months ago
2007
LPAR
2005
Springer
14 years 4 months ago
2005
Springer
Model checking is a useful method to verify automatically the correctness of a system with respect to a desired behavior, by checking whether a mathematical model of the system sat...
KBSE
2005
IEEE
14 years 4 months ago
2005
IEEE
We present a new model checking algorithm for verifying computation tree logic (CTL) properties. Our technique is based on using language inference to learn the fixpoints necessar...
TIME
2009
IEEE
14 years 5 months ago
2009
IEEE
The model checking problem for CTL is known to be P-complete (Clarke, Emerson, and Sistla (1986), see Schnoebelen (2002)). We consider fragments of CTL obtained by restricting the...
STACS
2010
Springer
14 years 5 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...