Verifying properties of parallel programs

Owicki, Susan; Gries, David

doi:10.1145/360051.360224

Cited by 434 publications

(229 citation statements)

References 4 publications

Supporting

Mentioning

227

Contrasting

Order By: Relevance

“…Susan Owicki introduced proofs of the correctness of parallel algorithms in her thesis, [27] and in an article she co-authored in 1976 with David Gries, [28]. We will not prove formerly our algorithm correct in this section but only annotate it with assertions which give strong evidence of its correctness.…”

Section: Correctness Of the Programmentioning

confidence: 97%

The computation of Gröbner bases on a shared memory multiprocessor

Vidal

1990

Design and Implementation of Symbolic Computation Systems

View full text Add to dashboard Cite

show abstract

Section: Correctness Of the Programmentioning

confidence: 97%

The computation of Gröbner bases on a shared memory multiprocessor

Vidal

1990

Design and Implementation of Symbolic Computation Systems

View full text Add to dashboard Cite

show abstract

“…The need for such variables in reasoning about concurrent programs has been long recognized [23]. The auxiliary variables do not affect the original data flow or control flow of the algorithm.…”

Section: Augmented Algorithmmentioning

confidence: 99%

Fine-grained Concurrency with Separation Logic

2011

View full text Add to dashboard Cite

Reasoning about concurrent programs involves representing the information that concurrent processes manipulate disjoint portions of memory. In sophisticated applications, the division of memory between processes is not static. Through operations, processes can exchange the implied ownership of memory cells. In addition, processes can also share ownership of cells in a controlled fashion as long as they perform operations that do not interfere, e.g., they can concurrently read shared cells. Thus the traditional paradigm of distributed computing based on locations is replaced by a paradigm of concurrent computing which is more tightly based on program structure. Concurrent Separation Logic with Permissions, developed by O'Hearn, Bornat et al., is able to represent sophisticated transfer of ownership and permissions between processes. We demonstrate how these ideas can be used to reason about finegrained concurrent programs which do not employ explicit synchronization operations to control interference but cooperatively manipulate memory cells so that interference is avoided. Reasoning about such programs is challenging and appropriate logical tools are necessary to carry out the reasoning in a reliable fashion. We argue that Concurrent Separation Logic with Permissions provides such tools. We illustrate the logical techniques by presenting the proof of a concurrent garbage collector originally studied by Dijkstra et al., and extended by Lamport to handle multiple user processes.

show abstract

“…In particular, we are often required to introduce auxiliary variables [Owi75,OG76a,OG76b] to express variations in the invariant at different program points.…”

Section: Rgsepmentioning

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

Verifying properties of parallel programs

Cited by 434 publications

References 4 publications

The computation of Gröbner bases on a shared memory multiprocessor

The computation of Gröbner bases on a shared memory multiprocessor

Fine-grained Concurrency with Separation Logic

Inter-process buffers in separation logic with rely-guarantee

Contact Info

Product

Resources

About