Automatic Parallelization and Optimization of Programs by Proof Rewriting
- 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
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.
Unable to display preview. Download preview PDF.