A Temporal Logic for Multi-threaded Programs - Theoretical Computer Science Access content directly
Conference Papers Year : 2012

A Temporal Logic for Multi-threaded Programs

Abstract

Temporal logics for nested words are a specification formalism for procedural programs, since they express requirements about matching calls and returns. We extend this formalism to multiply nested words, which are natural models of the computations of concurrent programs. We study both the satisfiability and the model-checking problems, when the multiply nested words are runs of multi-stack pushdown systems (Mpds). In particular, through a tableau-based construction, we define a Büchi Mpds for the models of a given formula. As expected both problems are undecidable, thus we consider some meaningful restrictions on the Mpds, and show decidability for the considered problems.
Fichier principal
Vignette du fichier
978-3-642-33475-7_16_Chapter.pdf (374.55 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556217 , version 1 (04-07-2017)

Licence

Attribution

Identifiers

Cite

Salvatore La Torre, Margherita Napoli. A Temporal Logic for Multi-threaded Programs. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.225-239, ⟨10.1007/978-3-642-33475-7_16⟩. ⟨hal-01556217⟩
53 View
83 Download

Altmetric

Share

Gmail Facebook X LinkedIn More