Sciweavers

819 search results - page 1 / 164
» Using Assumptions to Distribute CTL Model Checking
Sort
View
ENTCS
2002
56views more  ENTCS 2002»
13 years 8 months ago
Using Assumptions to Distribute CTL Model Checking
Lubos Brim, Jitka Crhova, Karen Yorav
LPAR
2005
Springer
14 years 2 months ago
Pushdown Module Checking
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...
Laura Bozzelli, Aniello Murano, Adriano Peron
ISMVL
2003
IEEE
117views Hardware» more  ISMVL 2003»
14 years 1 months ago
CTL Model-Checking over Logics with Non-Classical Negations
In earlier work [9], we defined CTL model-checking over finite-valued logics with De Morgan negation. In this paper, we extend this work to logics with intuitionistic, Galois an...
Marsha Chechik, Wendy MacCaull
TIME
2009
IEEE
14 years 3 months ago
Model Checking CTL is Almost Always Inherently Sequential
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...
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heri...