402 search results - page 3 / 81 » Model Checking Quantified Computation Tree Logic |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
FMCAD
2006
Springer
14 years 1 months ago
2006
Springer
In this paper we present a complete method for verifying properties expressed in the temporal logic CTL. In contrast to the majority of verification methods presented in recent yea...
CADE
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe mcmt, a fully declarative and deductive symbolic model checker for safety properties of infinite state systems whose state variables are arrays. Theories spec...
ERSHOV
2006
Springer
13 years 11 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...
MFCS
2009
Springer
14 years 4 months ago
2009
Springer
Nested Pushdown Trees are unfoldings of pushdown graphs with an additional jump-relation. These graphs are closely related to collapsible pushdown graphs. They enjoy decidable µ-c...