A Framework for Proving Correctness of Adjoint Message-Passing Programs

  • Authors:
  • Uwe Naumann;Laurent Hascoët;Chris Hill;Paul Hovland;Jan Riehme;Jean Utke

  • Affiliations:
  • LuFG Informatik 12 (Software and Tools for Computational Engineering), Department of Computer Science, RWTH Aachen University, Aachen, Germany 52056;Projet TROPICS, INRIA Sophia-Antipolis, France;Department of Earth, Atmospheric, and Planetary Sciences, Massachusetts Institute of Technology, Cambridge, USA;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA;Department of Computer Science, University of Hertfordshire, Hatfield, UK;Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, USA

  • Venue:
  • Proceedings of the 15th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We propose a technique for proving correctness of adjoint message passing programs that relies on data dependences in partitioned global address space. As an example we discuss asynchronous unbuffered send/receive using MPI.