Proving Data-Parallel Programs: A Unifying Approach

Abstract

We de ne an axiomatic semantics for a common kernel of existing data-parallel languages. We introduce an assertional language which enables us to de ne a weakest liberal precondition calculus which has the De nability Property, and a proof system (a la Hoare) which has the Completeness Property. Moreover, our axiomatic semantics integrates two previous works in the de nition of proof systems for data-parallel programs. This work sheds a new light on the logical complexity of proving data-parallel programs.