601 search results - page 2 / 121 » Model Checking CTL Properties of Pushdown Systems |
PEPM
2010
ACM
14 years 1 months ago
2010
ACM
Pushdown systems are well understood as abstract models of programs with (recursive) procedures. Reps et al. recently extended pushdown systems into weighted pushdown systems, whi...
MFCS
2009
Springer
13 years 11 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...
FSTTCS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Regular Model-Checking (RMC) is a technique for the formal verification of infinite state systems based on the theory of regular languages. In the paper “Beyond Regul...
TACAS
2004
Springer
13 years 10 months ago
2004
Springer
Temporal logic is two-valued: formulas are interpreted as either true or false. When applied to the analysis of stochastic systems, or systems with imprecise formal models, tempor...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...