Formal Methods in System Design

, Volume 36, Issue 1, pp 65–95

Pushdown module checking

Authors

    • IRISACampus Universitaire de Beaulieu
  • Aniello Murano
    • Dipartimento di Scienze FisicheUniversità di Napoli “Federico II”
  • Adriano Peron
    • Dipartimento di Scienze FisicheUniversità di Napoli “Federico II”
Article

DOI: 10.1007/s10703-010-0093-x

Cite this article as:
Bozzelli, L., Murano, A. & Peron, A. Form Methods Syst Des (2010) 36: 65. doi:10.1007/s10703-010-0093-x

Abstract

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 satisfies a formal specification of this behavior. Many systems of interest are open, in the sense that their behavior depends on the interaction with their environment. The model checking problem for finite-state open systems (called module checking) has been intensively studied in the literature. In this paper, we focus on open pushdown systems and we study the related model-checking problem (pushdown module checking, for short) with respect to properties expressed by CTL and CTL* formulas. We show that pushdown module checking against CTL (resp., CTL*) is 2Exptime-complete (resp., 3Exptime-complete). Moreover, we prove that for a fixed CTL or CTL* formula, the problem is Exptime-complete.

Keywords

Module checkingPushdown systemsBranching temporal logicsTree automata

Copyright information

© Springer Science+Business Media, LLC 2010