Context-Bounded Analysis of Concurrent Queue Systems
Context-Bounded Analysis of Concurrent Queue Systems
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finite-state recursive programs provided a process dequeues messages only when its local stack is empty. We then proceed to classify architectures that admit a decidable (unbounded context switching) reachability problem, using the decidability of bounded context switching. We show that the precise class of decidable architectures for recursive programs are the forest architectures, while the decidable architectures for non-recursive programs are those that do not have an undirected cycle.
978-3-540-78799-0
299-314
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
2008
Torre, Salvatore La
41a7e97d-f8db-4e87-92f3-9622bb9fadc8
Madhusudan, P.
8af89366-038f-4a30-9588-61d3f4477b49
Parlato, Gennaro
c28428a0-d3f3-4551-a4b5-b79e410f4923
Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro
(2008)
Context-Bounded Analysis of Concurrent Queue Systems.
TACAS, Budapest, Hungary.
29 Mar - 06 Apr 2008.
.
Record type:
Conference or Workshop Item
(Paper)
Abstract
We show that the bounded context-switching reachability problem for concurrent finite systems communicating using unbounded FIFO queues is decidable, where in each context a process reads from only one queue (but is allowed to write onto all other queues). Our result also holds when individual processes are finite-state recursive programs provided a process dequeues messages only when its local stack is empty. We then proceed to classify architectures that admit a decidable (unbounded context switching) reachability problem, using the decidability of bounded context switching. We show that the precise class of decidable architectures for recursive programs are the forest architectures, while the decidable architectures for non-recursive programs are those that do not have an undirected cycle.
Text
fulltext(1).pdf
- Version of Record
More information
Published date: 2008
Additional Information:
Event Dates: March 29-April 6, 2008
Venue - Dates:
TACAS, Budapest, Hungary, 2008-03-29 - 2008-04-06
Organisations:
Electronic & Software Systems
Identifiers
Local EPrints ID: 272462
URI: http://eprints.soton.ac.uk/id/eprint/272462
ISBN: 978-3-540-78799-0
PURE UUID: 48ccb9ed-cc98-40d3-9308-c0e298f7c8ab
Catalogue record
Date deposited: 13 Jun 2011 14:29
Last modified: 14 Mar 2024 10:02
Export record
Contributors
Author:
Salvatore La Torre
Author:
P. 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