• Home
  • Search
  • LTL model checking for communicating concurrent programs
  • Open Access IconOpen Access
  • Cite Icon2
  • https://doi.org/10.1007/s11334-020-00363-6Copy DOI Icon

LTL model checking for communicating concurrent programs

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

We present in this paper a new approach to the static analysis of concurrent programs with procedures. To this end, we model multi-threaded programs featuring recursive procedure calls and synchronization by rendezvous between parallel threads with communicating pushdown systems (from now on CPDSs). The reachability problem for this particular class of automata is unfortunately undecidable. However, it has been shown that an efficient abstraction of the execution traces language can nonetheless be computed. To this end, an algebraic framework to over-approximate context-free languages has been introduced by Bouajjani et al. In this paper, we combine this framework with an automata-theoretic approach in order to approximate an answer to the model checking problem of the linear-time temporal logic (from now on LTL) on CPDSs. We then present an algorithm that, given a single-indexed or stutter-invariant LTL formula, allows us to prove that no run of a CPDS verifies this formula if the procedure ends.

Similar Papers
  • Research Article
  • Citations31

A generic approach to the static analysis of concurrent programs with procedures

  • Jan 15, 2003
  • ACM SIGPLAN Notices
  • Ahmed Bouajjani +2
  • Research Article
  • Citations33

A Generic Approach to the Static Analysis of Concurrent Programs with Procedures

  • Aug 01, 2003
  • International Journal of Foundations of Computer Science
  • Ahmed Bouajjani +2
  • Conference Article
  • Citations154

A generic approach to the static analysis of concurrent programs with procedures

  • Jan 15, 2003
  • Ahmed Bouajjani +2
  • Conference Article
  • Citations13

Verification in concurrent programming with Petri nets structural techniques

  • Nov 27, 2002
  • K Barkaoui +1
  • Book Chapter
  • Citations131

Reasoning About Threads Communicating via Locks

  • Jan 01, 2005
  • Vineet Kahlon +2
  • Book Chapter
  • Citations41

Efficient Computation of May-Happen-in-Parallel Information for Concurrent Java Programs

  • Jan 01, 2006
  • Rajkishore Barik
  • Conference Article
  • Citations7

Static analysis of concurrent programs by adapted vector clock

  • Jul 10, 2013
  • Maryam Zakeryfar +1
  • Book Chapter
  • Citations8

Static Analysis of Concurrent Programs Using Ordinary Differential Equations

  • Jan 01, 2009
  • Zuohua Ding
  • Book Chapter
  • Citations2

LTL Model-Checking for Communicating Concurrent Programs

  • Jan 01, 2018
  • Adrien Pommellet +1
  • Research Article
  • Citations297

Context-sensitive synchronization-sensitive analysis is undecidable

  • Mar 01, 2000
  • ACM Transactions on Programming Languages and Systems
  • G Ramalingam
  • Research Article
  • Citations7

FORWARD ANALYSIS OF DYNAMIC NETWORK OF PUSHDOWN SYSTEMS IS EASIER WITHOUT ORDER

  • Jun 01, 2011
  • International Journal of Foundations of Computer Science
  • Denis Lugiez
  • Book Chapter
  • Citations2

Forward Analysis of Dynamic Network of Pushdown Systems Is Easier without Order

  • Jan 01, 2009
  • Denis Lugiez
  • Research Article
  • Citations232

Evaluating deadlock detection methods for concurrent software

  • Mar 01, 1996
  • IEEE Transactions on Software Engineering
  • J.C Corbett
  • Book Chapter
  • Citations28

A Practical Application of Geometric Semantics to Static Analysis of Concurrent Programs

  • Jan 01, 2005
  • Eric Goubault +1
  • Conference Article
  • Citations1

Apportioning: a technique for efficient reachability analysis of concurrent object-oriented programs

  • Dec 17, 1998
  • S Iyer +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.