A History of BlockingQueues
This paper describes a way to formally specify the behaviour of concurrent data structures. When specifying concurrent data structures, the main challenge is to make specifications stable, i.e., to ensure that they cannot be invalidated by other threads. To this end, we propose to use history-based...
Main Authors: | Marina Zaharieva-Stojanovski, Marieke Huisman, Stefan Blom |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2012-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1209.2239v1 |
Similar Items
- Queueing networks with blocking
-
Verifying Parallel Loops with Separation Logic
by: Stefan Blom, et al.
Published: (2014-06-01) -
Verification of Shared-Reading Synchronisers
by: Afshin Amighi, et al.
Published: (2018-06-01) -
A queueing analysis of a buffered block-selective S-ARQ protocol
by: Ansari, Mohsinuddin
Published: (2005) -
Approximate analysis of queues in series with phase-type service times and blocking /
by: 320362 Altiok, Tayfur