Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width


La Torre, Salvatore and Gennaro, Parlato (2012) Scope-bounded multistack pushdown systems: fixed-point, sequentialization, and tree-width At 32nd Foundations of Software Technology and Theoretical Computer Science Conference (FSTTCS), India. 15 - 17 Dec 2012. 12 pp, pp. 173-184.

Download

[img] PDF scoped2012.pdf - Version of Record
Download (550kB)

Description/Abstract

We present a novel fixed-point algorithm to solve reachability of multi-stack pushdown systems restricted to runs of bounded-scope. The followed approach is compositional, in the sense that the runs of the system are summarized by bounded-size interfaces. Moreover, it is suitable for a direct implementation and can be exploited to prove two new results. We give a sequentialization for this class of systems, i.e., for each such multi-stack pushdown system we construct an equivalent single-stack pushdown system that faithfully simulates the behaviour of each thread. We prove that the behaviour graphs (multiply nested words) for these systems have bounded three-width, and thus a number of decidability results can be derived from Courcelle’s theorem.

Item Type: Conference or Workshop Item (Paper)
Venue - Dates: 32nd Foundations of Software Technology and Theoretical Computer Science Conference (FSTTCS), India, 2012-12-15 - 2012-12-17
Keywords: model-checking, multi-threaded programs, sequentialization, tree-width
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Organisations: Electronic & Software Systems
ePrint ID: 335128
Date :
Date Event
16 December 2012Published
Date Deposited: 13 Mar 2012 10:29
Last Modified: 23 Feb 2017 08:02
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/335128

Actions (login required)

View Item View Item