Return-Path: <John.Harrison-request@cl.cam.ac.uk>
Delivery-Date: 
Received: from leopard.cs.byu.edu (no rfc931) by swan.cl.cam.ac.uk 
          with SMTP (PP-6.5) outside ac.uk; Sat, 27 Aug 1994 03:51:40 +0100
Received: by leopard.cs.byu.edu (1.37.109.8/16.2) id AA20454;
          Fri, 26 Aug 1994 20:38:57 -0600
Sender: info-hol-request@lal.cs.byu.edu
Errors-To: info-hol-request@lal.cs.byu.edu
Precedence: bulk
Received: from Maui.CS.UCLA.EDU by leopard.cs.byu.edu 
          with SMTP (1.37.109.8/16.2) id AA20450;
          Fri, 26 Aug 1994 20:38:56 -0600
Received: from LocalHost.cs.ucla.edu by maui.cs.ucla.edu (Sendmail 4.1/3.26) 
          id AA04285; Fri, 26 Aug 94 19:33:57 PDT
Message-Id: <9408270233.AA04285@maui.cs.ucla.edu>
To: concurrency@cwi.nl, brunello@dcs.st-and.ac.uk, info-hol@leopard.cs.byu.edu
Subject: WANTED: Examples of correctness proofs of distributed algorithms
Date: Fri, 26 Aug 94 19:33:55 PDT
From: chou@cs.ucla.edu


I would like to collect examples of correctness proofs of
distributed algorithms.  In particular, I am interested in
proofs of "realistic" distributed algorithms, ie, NOT those
toy examples cooked up to demonstrate some proof techniques.

Please send your reply to: chou@cs.ucla.edu
I will post a summary.  Many, many thanks in advance!!!

Cheers,
Ching-Tsun Chou