The University of Southampton
University of Southampton Institutional Repository

The tree width of auxiliary storage

Madhusudan, P. and Parlato, Gennaro (2011) The tree width of auxiliary storage At POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, United States. 26 - 28 Jan 2011. , pp. 283-294. (doi:10.1145/1925844.1926419).

Record type: Conference or Workshop Item (Paper)


We propose a generalization of results on the decidability of emptiness for several restricted classes of sequential and distributed automata with auxiliary storage (stacks, queues) that have recently been proved. Our generalization relies on reducing emptiness of these automata to finite-state graph automata (without storage) restricted to monadic second-order (MSO) definable graphs of bounded tree-width, where the graph structure encodes the mechanism provided by the auxiliary storage. Our results outline a uniform mechanism to derive emptiness algorithms for automata, explaining and simplifying several existing results, as well as proving new decidability results.

PDF graphautomata.pdf - Version of Record
Download (239kB)

More information

Published date: 2011
Venue - Dates: POPL '11. Proceedings of the 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, United States, 2011-01-26 - 2011-01-28
Keywords: model checking, automata, decision procedures, bounded tree-width
Organisations: Electronic & Software Systems


Local EPrints ID: 272444
ISBN: 978-1-4503-0490-0
PURE UUID: f8adee63-0e85-4b55-a10d-0506cc795059

Catalogue record

Date deposited: 13 Jun 2011 12:36
Last modified: 18 Jul 2017 06:24

Export record



Author: P. Madhusudan
Author: Gennaro Parlato

University divisions

Download statistics

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton:

ePrints Soton supports OAI 2.0 with a base URL of

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.