Context-Bounded Analysis of Concurrent Queue Systems


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

Download

[img] PDF fulltext(1).pdf - Version of Record
Download (490kB)

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
Venue - Dates: TACAS, Hungary, 2008-03-29 - 2008-04-06
Organisations: Electronic & Software Systems
ePrint ID: 272462
Date :
Date Event
2008Published
Date Deposited: 13 Jun 2011 14:29
Last Modified: 17 Apr 2017 17:44
Further Information:Google Scholar
URI: http://eprints.soton.ac.uk/id/eprint/272462

Actions (login required)

View Item View Item