• Home
  • Search
  • Efficient CTL Model-Checking for Pushdown Systems
  • Cite Icon22
  • https://doi.org/10.1007/978-3-642-23217-6_29Copy DOI Icon

Efficient CTL Model-Checking for Pushdown Systems

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

Pushdown systems (PDS) are well adapted to model sequential programs with (possibly recursive) procedure calls. Therefore, it is important to have efficient model checking algorithms for PDSs. We consider in this paper CTL model checking for PDSs. We consider the standard CTL model checking problem where whether a configuration of a PDS satisfies an atomic proposition or not depends only on the control state of the configuration. We consider also CTL model checking with regular valuations, where the set of configurations in which an atomic proposition holds is a regular language. We reduce these problems to the emptiness problem in Alternating Buchi Pushdown Systems, and we give an algorithm to solve this emptiness problem. Our algorithms are more efficient than the other existing algorithms for CTL model checking for PDSs in the literature. We implemented our techniques in a tool, and we applied it to different case studies. Our results are encouraging. In particular, we were able to find bugs in linux source code.

Similar Papers
  • Research Article
  • Citations20

Efficient CTL model-checking for pushdown systems

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

Branching Temporal Logic of Calls and Returns for Pushdown Systems

  • Jan 01, 2018
  • Huu-Vu Nguyen +1
  • Research Article
  • Citations9

Model checking dynamic pushdown networks

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

Model Checking Dynamic Pushdown Networks

  • Jan 01, 2013
  • Fu Song +1
  • Conference Article
  • Citations9

CARET model checking for pushdown systems

  • Apr 03, 2017
  • Huu-Vu Nguyen +1
  • Research Article
  • Citations190

Model checking LTL with regular valuations for pushdown systems

  • Jul 02, 2003
  • Information and Computation
  • Javier Esparza +2
  • Conference Article
  • Citations18

PuMoC: a CTL model-checker for sequential programs

  • Sep 03, 2012
  • Fu Song +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
  • Research Article
  • Citations3

Verifying Multithreaded Recursive Programs with Integer Variables

  • Jun 18, 2009
  • Electronic Notes in Theoretical Computer Science
  • Narjes Ben Rajeb +3
  • Book Chapter
  • Citations3

Model Checking Dynamic Pushdown Networks with Locks and Priorities

  • Jan 01, 2019
  • Marcio Diaz +1
  • Book Chapter
  • Citations20

Analysing Mu-Calculus Properties of Pushdown Systems

  • Jan 01, 2010
  • Matthew Hague +1
  • Book Chapter
  • Citations29

Model-Checking LTL with Regular Valuations for Pushdown Systems

  • Jan 01, 2001
  • Javier Esparza +2
  • Research Article
  • Citations2

On Symbolic Verification of Weakly Extended PAD

  • Jun 01, 2007
  • Electronic Notes in Theoretical Computer Science
  • Ahmed Bouajjani +2
  • Book Chapter
  • Citations8

Well-Structured Pushdown System: Case of Dense Timed Pushdown Automata

  • Jan 01, 2014
  • Xiaojuan Cai +1
  • Conference Article
  • Citations11

What's Decidable about Availability Languages?

  • Jan 01, 2015
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Parosh Aziz Abdulla +3
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.