LTL Model Checking for Communicating Concurrent Programs - CNRS - Centre national de la recherche scientifique Accéder directement au contenu
Communication Dans Un Congrès Année : 2018

LTL Model Checking for Communicating Concurrent Programs

Adrien Pommelet
  • Fonction : Auteur
Tayssir Touili

Résumé

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.
Fichier principal
Vignette du fichier
isse20.pdf (516.02 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03902460 , version 1 (15-12-2022)

Identifiants

Citer

Adrien Pommelet, Tayssir Touili. LTL Model Checking for Communicating Concurrent Programs. 12th International Conference on Verification and Evaluation of Computer and Communication Systems (VECoS 2018), Sep 2018, Grenoble, France. ⟨10.1007/s11334-020-00363-6⟩. ⟨hal-03902460⟩
7 Consultations
23 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More