Work

LTL Model Checking for Communicating Concurrent Programs

Year: 2018

Type: conference-paper

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.

Source: HAL

DOI: 10.1007/s11334-020-00363-6

Authors: Pommelet, Adrien, Touili, Tayssir

Institutions: École Pour l'Informatique et les Techniques Avancées, Centre National de la Recherche Scientifique, Université Sorbonne Paris Nord, Laboratoire d'Informatique de Paris-Nord

Language: English

Topic: Formal Methods in Verification

Subfield: Computational Theory and Mathematics

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funder: Université Paris Diderot

OpenAlex ID: W3034123776

FWCI: 0.23

Cites: 21

Cited by: 3

Related to: 10