A Robust Class of Context-Sensitive Languages
A Robust Class of Context-Sensitive Languages
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines the operation on the stacks, and (b) any computation of the machine can be split into k stages, where in each stage, there is at most one stack that is popped. MVPLs are an extension of visibly pushdown languages that captures noncontext free behaviors, and has applications in analyzing abstractions of multithreaded recursive programs, significantly enlarging the search space that can be explored for them. We show that MVPLs are closed under boolean operations, and problems such as emptiness and inclusion are decidable. We characterize MVPLs using monadic second-order logic over appropriate structures, and exhibit a Parikh theorem for them.
161-170
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, Parthasarathy
8897ebc7-adbb-454f-a718-829b7c1f0dd1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2007
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, Parthasarathy
8897ebc7-adbb-454f-a718-829b7c1f0dd1
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Torre, Salvatore La, Madhusudan, Parthasarathy and Parlato, Gennaro
(2007)
A Robust Class of Context-Sensitive Languages.
LICS, Wroclaw, Poland.
10 - 12 Jul 2007.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolean operations. This class, called multi-stack visibly pushdown languages (MVPLs), is defined using multi-stack pushdown automata with two restrictions: (a) the pushdown automaton is visible, i.e. the input letter determines the operation on the stacks, and (b) any computation of the machine can be split into k stages, where in each stage, there is at most one stack that is popped. MVPLs are an extension of visibly pushdown languages that captures noncontext free behaviors, and has applications in analyzing abstractions of multithreaded recursive programs, significantly enlarging the search space that can be explored for them. We show that MVPLs are closed under boolean operations, and problems such as emptiness and inclusion are decidable. We characterize MVPLs using monadic second-order logic over appropriate structures, and exhibit a Parikh theorem for them.
Text
lics07.pdf
- Version of Record
More information
Published date: 2007
Additional Information:
Event Dates: 10-12 July 2007
Venue - Dates:
LICS, Wroclaw, Poland, 2007-07-10 - 2007-07-12
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272465
URI: http://eprints.soton.ac.uk/id/eprint/272465
PURE UUID: 054474bf-be3a-4cc3-b016-d48e89bea477
Catalogue record
Date deposited: 13 Jun 2011 14:43
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
Parthasarathy Madhusudan
Author:
Gennaro Parlato
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