• Home
  • Search
  • Model Checking Dynamic Pushdown Networks
  • Cite Icon6
  • https://doi.org/10.1007/978-3-319-03542-0_3Copy DOI Icon

Model Checking Dynamic Pushdown Networks

  • Jan 1, 2013
  • Fu Song +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

A Dynamic Pushdown Network (DPN) is a set of pushdown systems (PDSs) where each process can dynamically create new instances of PDSs. DPNs are a natural model of multi-threaded programs with (possibly recursive) procedure calls and thread creation. Thus, it is important to have model-checking algorithms for DPNs. We consider in this work model-checking DPNs against single-indexed LTL and CTL properties of the form ∧ f i s.t. f i is a LTL/CTL formula over the PDS i. We consider the model-checking problems w.r.t. simple valuations (i.e, whether a configuration satisfies an atomic proposition depends only on its control location) and w.r.t. regular valuations (i.e., the set of the configurations satisfying an atomic proposition is a regular set of configurations). We show that these model-checking problems are decidable. We propose automata-based approaches for computing the set of configurations of a DPN that satisfy the corresponding single-indexed LTL/CTL formula.

Similar Papers
  • Research Article
  • Citations9

Model checking dynamic pushdown networks

  • Jan 08, 2015
  • Formal Aspects of Computing
  • Fu Song +1
  • Book Chapter
  • Citations2

Branching Temporal Logic of Calls and Returns for Pushdown Systems

  • Jan 01, 2018
  • Huu-Vu Nguyen +1
  • Book Chapter
  • Citations22

Efficient CTL Model-Checking for Pushdown Systems

  • Jan 01, 2011
  • Fu Song +1
  • Book Chapter
  • Citations3

Model Checking Dynamic Pushdown Networks with Locks and Priorities

  • Jan 01, 2019
  • Marcio Diaz +1
  • Research Article
  • Citations190

Model checking LTL with regular valuations for pushdown systems

  • Jul 02, 2003
  • Information and Computation
  • Javier Esparza +2
  • Research Article
  • Citations7

The Complexity of Model Checking Multi-Stack Systems

  • Aug 26, 2016
  • Theory of Computing Systems
  • Benedikt Bollig +2
  • Conference Article
  • Citations10

The Complexity of Model Checking Multi-stack Systems

  • Jun 01, 2013
  • Benedikt Bollig +2
  • Research Article
  • Citations20

Efficient CTL model-checking for pushdown systems

  • Jul 09, 2014
  • Theoretical Computer Science
  • Fu Song +1
  • Book Chapter
  • Citations9

Symbolic Backwards-Reachability Analysis for Higher-Order Pushdown Systems

  • Jan 01, 2007
  • Matthew Hague +1
  • Book Chapter
  • Citations3

CARET Analysis of Multithreaded Programs

  • Jan 01, 2018
  • Huu-Vu Nguyen +1
  • Conference Article
  • Citations15

Conditional weighted pushdown systems and applications

  • Jan 18, 2010
  • Xin Li +1
  • Research Article

Reduction of Register Pushdown Systems with Freshness Property to Pushdown Systems in LTL Model Checking

  • Sep 01, 2022
  • IEICE Transactions on Information and Systems
  • Yoshiaki Takata +2
  • Conference Article
  • Citations18

PuMoC: a CTL model-checker for sequential programs

  • Sep 03, 2012
  • Fu Song +1
  • Conference Article
  • Citations9

CARET model checking for pushdown systems

  • Apr 03, 2017
  • Huu-Vu Nguyen +1
  • Conference Article
  • Citations20

Global Model Checking of Ordered Multi-Pushdown Systems

  • Jan 01, 2010
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Mohamed Faouzi Atig
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.