Reduction: a method of proving properties of parallel programs

Explore this paper's citation graph

Summary

Correctness proofs of a parallel system can often be greatly simplified because the assumption that a statement is indivisible can be relaxed and still preserve properties such as halting.

Type
article
Published
1975-12-01
Cited by
538
References
5
Access
Open access

Keywords

Statement (logic), Correctness, Computer science, Mathematical proof, Property (philosophy)

References

Cited by

Related papers