Sciweavers

1491 search results - page 97 / 299
» Resource-Passing Concurrent Programming
Sort
View
CONCUR
2006
Springer
15 years 1 months ago
Proving Liveness by Backwards Reachability
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
Parosh Aziz Abdulla, Bengt Jonsson, Ahmed Rezine, ...
EUROPAR
2006
Springer
15 years 1 months ago
Toward a Definition of and Linguistic Support for Partial Quiescence
Abstract. The global quiescence of a distributed computation (or distributed termination detection) is an important problem. Some concurrent programming languages and systems provi...
Billy Yan-Kit Man, Hiu Ning (Angela) Chan, Andrew ...
CORR
2010
Springer
97views Education» more  CORR 2010»
14 years 10 months ago
Continuation-Passing C, compiling threads to events through continuations
Abstract In this paper, we introduce Continuation Passing C (CPC), a programming language for concurrent systems in which native and cooperative threads are unified and presented t...
Gabriel Kerneis, Juliusz Chroboczek
PPOPP
2011
ACM
14 years 22 days ago
Wait-free queues with multiple enqueuers and dequeuers
The queue data structure is fundamental and ubiquitous. Lockfree versions of the queue are well known. However, an important open question is whether practical wait-free queues ex...
Alex Kogan, Erez Petrank
ESOP
2009
Springer
15 years 4 months ago
Abstraction for Concurrent Objects
ion for Concurrent Objects Ivana Filipovi´c, Peter O’Hearn, Noam Rinetzky, and Hongseok Yang Queen Mary University of London, UK Concurrent data structures are usually designed ...
Ivana Filipovic, Peter W. O'Hearn, Noam Rinetzky, ...