The University of Southampton
University of Southampton Institutional Repository

The Language Theory of Bounded Context-Switching

Record type: Conference or Workshop Item (Paper)

Concurrent compositions of recursive programs with finite data are a natural abstraction model for concurrent programs. Since reachability is undecidable for this class, a restricted form of reachability has become popular in the formal verification literature, where the set of states reached within k context-switches, for a fixed small constant k, is explored. In this paper, we consider the language theory of these models: concurrent recursive programs with finite data domains that communicate using shared memory and work within k round-robin rounds of context-switches, and where further the stack operations are made visible (as in visibly pushdown automata). We show that the corresponding class of languages, for any fixed k, forms a robust subclass of context-sensitive languages, closed under all the Boolean operations. Our main technical contribution is to show that these automata are determinizable as well. This is the first class we are aware of that includes non-context-free languages, and yet has the above properties.

PDF fulltext.pdf - Version of Record
Download (240kB)

Citation

La Torre, Salvatore, Madhusudan, P. and Parlato, Gennaro (2010) The Language Theory of Bounded Context-Switching At LATIN, Mexico. 19 - 23 Apr 2010. , pp. 96-107.

More information

Published date: 2010
Additional Information: Event Dates: April 19-23, 2010
Venue - Dates: LATIN, Mexico, 2010-04-19 - 2010-04-23
Organisations: Electronic & Software Systems

Identifiers

Local EPrints ID: 272455
URI: http://eprints.soton.ac.uk/id/eprint/272455
ISBN: 978-3-642-12199-9
PURE UUID: db69a067-5ddd-4cf9-b3b4-46534ffd0bfd

Catalogue record

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

Export record

Contributors

Author: Salvatore La Torre
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.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

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.

×