No abstract

No abstract

No abstract

No abstract

SummaryWe g i v e a correctness proof of the sliding window protocol. Both safety and liveness properties are addressed. We s h o w h o w faulty c hannels can be represented as nondeterministic programs. The correctness proof is given as a sequence of correctness-preserving transformations of a sequential program that satis es the original speci cation, with the exception that it does not have a n y f a u l t y c hannels. We w ork as long as possible with a sequential program, although the transformation steps are guided by the aim of going to a distributed program. The nal transformation steps consist in distributing the actions of the sequential program over a number of processes.