A Lattice-Structured Proof Technique Applied to a Minimum Spanning Tree Algorithm (Extended Abstract) (1988)

by Jennifer Lundelius Welch , Nancy Lynch
Venue:Laboratory for Computer Science, Massachusetts Institute of Technology
Citations:13 - 4 self

Documents Related by Co-Citation

395 Hierarchical correctness proofs for distributed algorithms – Nancy A. Lynch, Mark R. Tuttle - 1987
1674 Distributed Algorithms – N A Lynch - 1996
3643 Communicating Sequential Processes – C. A. R. Hoare - 1985
3430 Communication and Concurrency – R Milner - 1989
429 Bisimulation through probabilistic testing – Kim G. Larsen, Arne Skou - 1989
517 Algebraic laws for nondeterminism and concurrency – Matthew Hennessy, Robin Milner - 1985
774 Parallel program design : a foundation – K M Chandy, J Misra - 1988
438 Testing Equivalences for Processes – R. De Nicola, M. C. B. Hennessy - 1984
677 Mathematica: A System for Doing Mathematics by Computer – S Wolfram - 1988