No abstract

No abstract

No abstract

No abstract

No abstract

No abstract

No abstract

This paper presents a scalable approach to reasoning formally about distributed algorithms. It uses results about I/O automata to extract a set of proof obligations for showing that the behaviors of one algorithm are among those of another, and it uses the Larch tools for specification and deduction to discharge these obligations in a natural and easy-to-read fashionl The approach is demonstrated by proving the behavior equivalence of two high-level specifications for a communication protocol.