AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗
From MaRDI portal
Publication:4485121
DOI10.1080/10637199808947391zbMath0954.68096OpenAlexW2515190522MaRDI QIDQ4485121
Joaquim Gabarró, Maurice Clint, Alan Stewart
Publication date: 5 June 2000
Published in: Parallel Algorithms and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10637199808947391
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An axiomatic treatment of SIMD assignment
- Decomposition of distributed programs into communication-closed layers
- A proof technique for communicating sequential processes
- An axiomatic proof technique for parallel programs
- Deadlock-free absorption of barrier synchronisations
- Formal validation of data-parallel programs: a two-component assertional proof system for a simple language
- Reasoning about data-parallel array assignment
- Tentative steps toward a development method for interfering programs
- A Proof System for Communicating Sequential Processes
- Guarded commands, nondeterminacy and formal derivation of programs
- An axiomatic basis for computer programming
This page was built for publication: AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗