Skip to Main content Skip to Navigation
Journal articles

LTL Model Checking for Communicating Concurrent Programs

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 synchronisation 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 lineartime 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.
Document type :
Journal articles
Complete list of metadata
Contributor : Tayssir Touili Connect in order to contact the contributor
Submitted on : Tuesday, December 1, 2020 - 2:32:37 PM
Last modification on : Wednesday, June 9, 2021 - 5:28:03 PM
Long-term archiving on: : Tuesday, March 2, 2021 - 7:28:32 PM


Files produced by the author(s)


  • HAL Id : hal-03033654, version 1


Adrien Pommellet, Tayssir Touili. LTL Model Checking for Communicating Concurrent Programs. Innovations in Systems and Software Engineering, Springer Verlag, 2020. ⟨hal-03033654⟩



Record views


Files downloads