License: Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.FSTTCS.2012.173
URN: urn:nbn:de:0030-drops-38563
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2012/3856/
Go to the corresponding LIPIcs Volume Portal

La Torre, Salvatore ; Parlato, Gennaro

Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width

pdf-format:
17.pdf (0.6 MB)

Abstract

We present a novel fixed-point algorithm to solve reachability of multi-stack pushdown systems restricted to runs where matching push and pop transitions happen within a bounded number of context switches. 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 behavior of each thread. We prove that the behavior graphs (multiply nested words) for these systems have bounded tree-width, and thus a number of decidability results can be derived from Courcelle's theorem.

BibTeX - Entry

@InProceedings{latorre_et_al:LIPIcs:2012:3856,
  author =	{Salvatore La Torre and Gennaro Parlato},
  title =	{{Scope-bounded Multistack Pushdown Systems: Fixed-Point, Sequentialization, and Tree-Width}},
  booktitle =	{IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012) },
  pages =	{173--184},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-47-7},
  ISSN =	{1868-8969},
  year =	{2012},
  volume =	{18},
  editor =	{Deepak D'Souza and Telikepalli Kavitha and Jaikumar Radhakrishnan},
  publisher =	{Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2012/3856},
  URN =		{urn:nbn:de:0030-drops-38563},
  doi =		{10.4230/LIPIcs.FSTTCS.2012.173},
  annote =	{Keywords: Model-checking, multi-threaded programs, sequentialization, tree-width}
}

Keywords: Model-checking, multi-threaded programs, sequentialization, tree-width
Collection: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
Issue Date: 2012
Date of publication: 14.12.2012

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI