Context-Bounded Analysis of Concurrent Queue Systems


Torre, Salvatore La, Madhusudan, P. and Parlato, Gennaro (2008) Context-Bounded Analysis of Concurrent Queue Systems. In, TACAS, Budapest, Hungary, 29 Mar - 06 Apr 2008. Springer, 299-314.

Download

[img] PDF - Published Version
Download (478Kb)

Description/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.

Item Type: Conference or Workshop Item (Paper)
Additional Information: Event Dates: March 29-April 6, 2008
ISBNs: 9783540787990
Divisions: Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
ePrint ID: 272462
Date Deposited: 13 Jun 2011 14:29
Last Modified: 27 Mar 2014 20:18
Publisher: Springer
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272462

Actions (login required)

View Item View Item