Correctness of parallel programs: The Church-Rosser approach
From MaRDI portal
Publication:1241051
DOI10.1016/0304-3975(76)90032-3zbMath0364.68006OpenAlexW2022273990MaRDI QIDQ1241051
Publication date: 1976
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(76)90032-3
Related Items
A unified approach for studying the properties of transition systems, An axiomatic proof technique for parallel programs, On reduction of asynchronous systems, Functional behavior in data spaces, Church-Rosser converters, Livelocks in parallel programs, Simulation, reduction and preservation of correctness properties of parallel systems
Uses Software
Cites Work
- Analysis of structured programs
- Proving assertions about parallel programs
- On procedures as open subroutines. II
- Parallel program schemata
- The correctness of nondeterministic programs
- Mathematical theory of partial correctness
- Finding Dominators in Directed Graphs
- Testing for the Church-Rosser Property
- On the capabilities of while, repeat, and exit statements
- On Proving Correctness of Microprograms
- A constructive approach to the problem of program correctness
- Semantics of context-free languages
- A global flow analysis algorithm
- Flow Graph Reducibility
- Tree-Manipulating Systems and Church-Rosser Theorems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item