Skip to main content
Conference Proceedings

Automatic parallelization and optimization of programs by proof rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5673 LNCS 52-68
DOI: 10.1007/978-3-642-03237-0_6
7Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show how, given a program and its separation logic proof, one can parallelize and optimize this program and transform its proof simultaneously to obtain a proven parallelized and optimized program. To achieve this goal, we present new proof rules for generating proof trees and a rewrite system on proof trees. © 2009 Springer.

Cite

CITATION STYLE

APA

Hurlin, C. (2009). Automatic parallelization and optimization of programs by proof rewriting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5673 LNCS, pp. 52–68). https://doi.org/10.1007/978-3-642-03237-0_6

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