An axiomatic proof technique for parallel programs I

1976 ◽  
Vol 6 (4) ◽  
pp. 319-340 ◽  
Author(s):  
Susan Owicki ◽  
David Gries
Keyword(s):  
Parallel Programs ◽  
Proof Technique ◽  
Axiomatic Proof

An Axiomatic Proof Technique for Parallel Programs

1978 ◽  
pp. 130-152 ◽  
Author(s):  
Susan Owicki ◽  
David Gries
Keyword(s):  
Parallel Programs ◽  
Proof Technique ◽  
Axiomatic Proof

scholarly journals A proof technique for parallel programs

1984 ◽  
Vol 31 (1-2) ◽  
pp. 13-29 ◽  
Author(s):  
N. Soundararajan
Keyword(s):  
Parallel Programs ◽  
Proof Technique

scholarly journals Disentanglement in nested-parallel programs

2020 ◽  
Vol 4 (POPL) ◽  
pp. 1-32 ◽  
Author(s):  
Sam Westrick ◽  
Rohan Yadav ◽  
Matthew Fluet ◽  
Umut A. Acar
Keyword(s):  
Parallel Programs

Test-driven repair of data races in structured parallel programs

2014 ◽  
Vol 49 (6) ◽  
pp. 15-25 ◽  
Author(s):  
Rishi Surendran ◽  
Raghavan Raman ◽  
Swarat Chaudhuri ◽  
John Mellor-Crummey ◽  
Vivek Sarkar
Keyword(s):  
Parallel Programs ◽  
Data Races

scholarly journals Correct program parallelisations

2021 ◽  
Author(s):  
S. Blom ◽  
S. Darabi ◽  
M. Huisman ◽  
M. Safari
Keyword(s):  
Composition Operators ◽  
Parallel Programs ◽  
Parallel Program ◽  
Tool Support ◽  
Intermediate Representation ◽  
Data Race ◽  
Sequential Program ◽  
Functional Correctness ◽  
Correct Program ◽  
Basic Blocks

AbstractA commonly used approach to develop deterministic parallel programs is to augment a sequential program with compiler directives that indicate which program blocks may potentially be executed in parallel. This paper develops a verification technique to reason about such compiler directives, in particular to show that they do not change the behaviour of the program. Moreover, the verification technique is tool-supported and can be combined with proving functional correctness of the program. To develop our verification technique, we propose a simple intermediate representation (syntax and semantics) that captures the main forms of deterministic parallel programs. This language distinguishes three kinds of basic blocks: parallel, vectorised and sequential blocks, which can be composed using three different composition operators: sequential, parallel and fusion composition. We show how a widely used subset of OpenMP can be encoded into this intermediate representation. Our verification technique builds on the notion of iteration contract to specify the behaviour of basic blocks; we show that if iteration contracts are manually specified for single blocks, then that is sufficient to automatically reason about data race freedom of the composed program. Moreover, we also show that it is sufficient to establish functional correctness on a linearised version of the original program to conclude functional correctness of the parallel program. Finally, we exemplify our approach on an example OpenMP program, and we discuss how tool support is provided.

Provably good scheduling for parallel programs that use data structures through implicit batching

2014 ◽  
Vol 49 (8) ◽  
pp. 389-390
Author(s):  
Kunal Agrawal ◽  
Jeremy T. Fineman ◽  
Brendan Sheridan ◽  
Jim Sukha ◽  
Robert Utterback
Keyword(s):  
Data Structures ◽  
Parallel Programs

scholarly journals Compiling machine-independent parallel programs

1993 ◽  
Vol 28 (8) ◽  
pp. 99-108 ◽  
Author(s):  
Michael Philippsen ◽  
Ernst A. Heinz ◽  
Paul Lukowicz
Keyword(s):  
Parallel Programs
Sign in / Sign up

Export Citation Format

Share Document