Skip to main content
Conference Proceedings

A framework for proving correctness of adjoint message-passing programs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5205 LNCS 316-321
DOI: 10.1007/978-3-540-87475-1_44
14Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Naumann, U., Hascoët, L., Hill, C., Hovland, P., Riehme, J., & Utke, J. (2008). A framework for proving correctness of adjoint message-passing programs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5205 LNCS, pp. 316–321). https://doi.org/10.1007/978-3-540-87475-1_44

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free