601 search results - page 8 / 121 » Model Checking CTL Properties of Pushdown Systems |
DLOG
2006
13 years 8 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...
FOSSACS
2009
Springer
14 years 2 months ago
2009
Springer
Higher-order recursion schemes are systems of rewrite rules on typed non-terminal symbols, which can be used to define infinite trees. The Global Modal Mu-Calculus Model Checking...
JCS
2011
13 years 2 months ago
2011
In this paper we consider the problem of verifying trace-based information flow properties for different classes of system models. We begin by proposing an automata-theoretic te...
FOSSACS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Among the branching-time temporal logics used for the specification and verification of systems, CTL+ , FCTL and ECTL+ are the most notable logics for which the precise...
LMCS
2006
13 years 7 months ago
2006
We consider the model checking problem for probabilistic pushdown automata (pPDA) and properties expressible in various probabilistic logics. We start with properties that can be ...