From a Specification to an Equivalence Proof in Object-Oriented Parallelism

We investigate the use of a TLA speci cation for modeling and proving parallelization within an object-oriented language. Our model is based on Ei el= a parallel extension of Ei el, where sequential programs can be reused for parallel or concurrent programming with very minor changes. We want to prove that both versions of a given program (sequential and parallel) are equivalent with respect to some properties. This article presents a description in TLA+ that captures the general Ei el= execution model, and, as a case-study, speci es a program (a binary search tree) in both its sequential and parallel form. We then prove a property that demonstrates a behavioral equivalence for the two versions.