601 search results - page 3 / 121 » Model Checking CTL Properties of Pushdown Systems |
ATVA
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. The saturation state-space generation algorithm has demonstrated clear improvements over state-of-the-art symbolic methods for asynchronous systems. This work is motivate...
POPL
2006
ACM
14 years 5 months ago
2006
ACM
We define a new fixpoint modal logic, the visibly pushdown ?-calculus (VP-?), as an extension of the modal ?-calculus. The models of this logic are execution trees of structured p...
ICFEM
2009
Springer
13 years 3 months ago
2009
Springer
In this paper we continue the study of a strict extension of the Computation Tree Logic, called graded-CTL, recently introduced by the same authors. This new logic augments the sta...
ATAL
2005
Springer
13 years 10 months ago
2005
Springer
We present an approach to the verification of temporal epistemic properties in synchronous multi-agent systems (MAS) via bounded model checking (BMC). Based on the semantics of s...
FSTTCS
2010
Springer
13 years 3 months ago
2010
Springer
In this paper, we address the verification problem of ordered multi-pushdown systems: A multistack extension of pushdown systems that comes with a constraint on stack operations s...