David B. Benson A machine level semantics for nondeterministic, parallel programs. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:15-25 [Conf]
Ernesto Costa Automatic program transformation viewed as theorem proving. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:37-46 [Conf]
Philippe Darondeau An enlarged definition and complete axiomatization of observational congruence of finite processes. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:47-62 [Conf]
Ph. Deschamp Perluette: A compilers producing system using abstract data types. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:63-77 [Conf]
P. Emanuelson From abstract model to efficient compilation of patterns. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:91-104 [Conf]
László Kozma Proving the correctness of implementations of shared data abstractions. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:227-241 [Conf]
John M. Rushby Proof of separability: A verification technique for a class of a security kernels. [Citation Graph (0, 0)][DBLP] Symposium on Programming, 1982, pp:352-367 [Conf]