Towards a Theory of Parallel Programming

Hoare, Tony

doi:10.1007/978-1-4757-3472-0_6

Cited by 156 publications

(92 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Concurrent separation logic [O'H04, O'H07, Bro07] deals with shared-variable concurrency using a mechanism based on Hoare's conditional critical regions [Hoa72].…”

Section: Concurrent Separation Logicmentioning

confidence: 99%

Inter-process buffers in separation logic with rely-guarantee

Bornat

Amjad

2010

Form. Asp. Comput.

View full text Add to dashboard Cite

Abstract. Separation logic allows simple proofs of concurrent algorithms which use blocking mechanisms such as semaphores. It can even deal with non-blocking algorithms. With the addition of mechanisms borrowed from rely-guarantee, we can make reasonably simple proofs of some simple non-blocking algorithms. We show that it extends to proofs of some intricate algorithms, including Simpson's famous asynchronous four-slot buffer and Harris's novel three-slot algorithm, in a manner that is arguably simpler than earlier treatments, though we cannot claim that we have yet found proofs that are as simple as we would wish. Our example proofs show functional correctness but do not deal with questions of liveness.

show abstract

“…Concurrent separation logic [O'H04, O'H07, Bro07] deals with shared-variable concurrency using a mechanism based on Hoare's conditional critical regions [Hoa72].…”

Section: Concurrent Separation Logicmentioning

confidence: 99%

Inter-process buffers in separation logic with rely-guarantee

Bornat

Amjad

2010

Form. Asp. Comput.

View full text Add to dashboard Cite

show abstract

“…Harris and Fraser [6] provide the first language with constructs for transactions. Their Java extension gives an efficient implementation of Hoare's conditional critical regions [11] through transactions, but transactions could not be easily composed. The Atomos language [4] is a Java extension that supports transactions through atomic blocks and also the retry construct to block transactions.…”

Section: Related Workmentioning

confidence: 99%

A Domain Specific Language for Composable Memory Transactions in Java

Bois

Echevarria

2009

Domain-Specific Languages

View full text Add to dashboard Cite

Abstract. In this paper we present CMTJava, a domain specific language for composable memory transactions [7] in Java. CMTJava provides the abstraction of transactional objects. Transactional objects have their fields accessed only by special get and set methods that are automatically generated by the compiler. These methods return transactional actions as a result. A transactional action is an action that, when executed, will produce the desired effect. Transactional actions can only be executed by the atomic method. Transactional actions are first class values in Java and they are composable: transactions can be combined to generate new transactions. The Java type system guarantees that the fields of transactional objects will never be accessed outside a transaction. CMTJava supports the retry and orElse constructs from STM Haskell. To validate our design we implemented a simple transactional system following the description of the original Haskell system. CMTJava is implemented as a state passing monad using BBGA closures, a Java extension that supports closures in Java.

show abstract

“…This technique is similar to a conditional critical region [10] and it obviates the need for special synchronizing variables such as events, queues, or conditions. However, the absence of these special facilities certainly makes it more difficult or less efficient to solve problems involving priorities--for example, the scheduling of head movement on a disk.…”

Section: Monitors and Schedulingmentioning

confidence: 99%

“…glitches) in some technologies of hardware implementation. A greater variety of methods has been proposed for synchronization: semaphores [6], events (PL/I), conditional critical regions [10], monitors and queues (Concurrent Pascal [2]), and path expressions [3]. Most of these are demonstrably adequate for their purpose, but there is no widely recognized criterion for choosing between them.…”

Section: Introductionmentioning

confidence: 99%