Automatic Parallelization and Optimization of Programs by Proof Rewriting
Résumé
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 rewriting system on proof trees.
Origine : Fichiers produits par l'(les) auteur(s)