Table des mati ères

Abstract

We give a Hoare like proof system for the data parallel language L and we present an automatic tool to aid program correctness proof After recalling L s operational semantics we de ne an axiomatic semantics We illustrate proof of L programs with two examples Then we extend our semantics to weakest precondition and we deduce techniques for mechanizing program veri cation from Gordon s veri cation condition method We prove its correctness and we present an implementation of this method in the Centaur system