Correctness proofs of distributed termination algorithms

Authors:
K. R. Apt
Affiliations:
-
Venue:
Logics and models of concurrent systems
Year:
1989

Citing 0
Cited 1

A compositional approach to superimposition

POPL '88 Proceedings of the 15th ACM SIGPLAN-SIGACT symposium on Principles of programming languages

Quantified Score

Hi-index	0.00

Visualization

Abstract