Automatic Parallelization and Optimization of Programs by Proof Rewriting

  • Clément Hurlin
Conference paper

DOI: 10.1007/978-3-642-03237-0_6

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5673)
Cite this paper as:
Hurlin C. (2009) Automatic Parallelization and Optimization of Programs by Proof Rewriting. In: Palsberg J., Su Z. (eds) Static Analysis. SAS 2009. Lecture Notes in Computer Science, vol 5673. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Clément Hurlin
    • 1
  1. 1.INRIA Sophia Antipolis – Méditerranée and University of TwenteNetherlands

Personalised recommendations