Summary: [6] R. Gawlick, R. Segala, J. Søgaard­Andersen, N. Lynch,
``Liveness in timed and untimed systems,'' Proc. 21st In­
ternational Colloquium on Automata, Languages, and Pro­
gramming, 1994.
[7] A. Harvey, N. Lynch, Notes on connection management,
DEC, 1990.
[8] B. Liskov, L. Shrira, J. Wroclawski, ``Efficient at­most­once
messagesbased on synchronized clocks,'' ACM Transactions
on Computer Systems
[9] J. Søgaard­Andersen,N. Lynch, B. Lampson, ``Correctness of
communications protocols: a case study,'' Technical Report
MIT/LCS/TR­589, November 1993.
[10] N. Lynch, M. Tuttle, ``Hierarchical correctness proofs for
distributed algorithms,'' Proc. 6th ACM Symposium on Prin­
ciples of Distributed Computing, 1987, pp. 137--151. (Full
version in Technical Report MIT/LCS/TR­387.)
[11] N. Lynch, I. Saias, R. Segala, ``Proving time bounds for ran­
domized distributed algorithms,'' Proc. 13th ACM Symposium
on Principles of Distributed Computing, 1994.
[12] N. Lynch, F. Vaandrager, ``Forward and backward sim­

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences