Sciweavers

147 search results - page 12 / 30
» Reasoning about Deadlines in Concurrent Real-Time Programs
Sort
View
POPL
2007
ACM
14 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
COORDINATION
2004
Springer
14 years 27 days ago
Optimistic Concurrency Semantics for Transactions in Coordination Languages
There has been significant recent interest in exploring the role of coordination languages as middleware for distributed systems. These languages provide operations that allow pro...
Suresh Jagannathan, Jan Vitek
ICFEM
2010
Springer
13 years 6 months ago
A Modular Scheme for Deadlock Prevention in an Object-Oriented Programming Model
Despite the advancements of concurrency theory in the past decades, practical concurrent programming has remained a challenging activity. Fundamental problems such as data races an...
Scott West, Sebastian Nanz, Bertrand Meyer
SAS
2010
Springer
262views Formal Methods» more  SAS 2010»
13 years 5 months ago
Concurrent Separation Logic for Pipelined Parallelization
Recent innovations in automatic parallelizing compilers are showing impressive speedups on multicore processors using shared memory with asynchronous channels. We have formulated a...
Christian J. Bell, Andrew W. Appel, David Walker
PPOPP
2006
ACM
14 years 1 months ago
Proving correctness of highly-concurrent linearisable objects
We study a family of implementations for linked lists using finegrain synchronisation. This approach enables greater concurrency, but correctness is a greater challenge than for ...
Viktor Vafeiadis, Maurice Herlihy, Tony Hoare, Mar...