A note on the proof of a concurrent program
References (4)
- et al.
The all nearest-neighbor problem for convex polygons
Information Processing Lett.
(1978) - et al.
A note on the all nearest-neighbor problem for convex polygons
Information Processing Lett.
(1979)
There are more references available in the full text version of this article.
Cited by (3)
Stepwise refinement and concurrency: the finite-state case
1990, Science of Computer ProgrammingAtomicity refinement and trace reduction theorems
1996, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)Stepwise refinement and concurrency: A small exercise
1989, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Copyright © 1979 Published by Elsevier B.V.