Automatic Parallelization and Optimization of Programs by Proof Rewriting

Authors:
Clément Hurlin
Affiliations:
INRIA Sophia Antipolis --- Méditerranée and University of Twente,
Venue:
SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Year:
2009

Citing 31
Cited 3

Optimal loop parallelization

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Automatic loop transformations and parallelization for Java

Proceedings of the 14th international conference on Supercomputing
Compilation techniques for parallel systems

Parallel Computing - Special Anniversary issue
Translation validation for an optimizing compiler

PLDI '00 Proceedings of the ACM SIGPLAN 2000 conference on Programming language design and implementation
The parallel execution of DO loops

Communications of the ACM
Ownership types for safe programming: preventing data races and deadlocks

OOPSLA '02 Proceedings of the 17th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
Parallelizing Programs with Recursive Data Structures

IEEE Transactions on Parallel and Distributed Systems
Separation Logic: A Logic for Shared Mutable Data Structures

LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Detecting Parallelism in C Programs with Recursive Darta Structures

CC '98 Proceedings of the 7th International Conference on Compiler Construction
Local Reasoning about Programs that Alter Data Structures

CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
Formal Verification of a Java Compiler in Isabelle

CADE-18 Proceedings of the 18th International Conference on Automated Deduction
Formal certification of a compiler back-end or: programming a compiler with a proof assistant

Conference record of the 33rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Early Register Deallocation Mechanisms Using Checkpointed Register Files

IEEE Transactions on Computers
Resources, concurrency, and local reasoning

Theoretical Computer Science
Maximize Parallelism Minimize Overhead for Nested Loops via Loop Striping

Journal of VLSI Signal Processing Systems
Enhancing modular OO verification with separation logic

Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Separation Logic Contracts for a Java-Like Language with Fork/Join

AMAST 2008 Proceedings of the 12th international conference on Algebraic Methodology and Software Technology
jStar: towards practical verification for java

Proceedings of the 23rd ACM SIGPLAN conference on Object-oriented programming systems languages and applications
Compositional shape analysis by means of bi-abduction

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Reasoning about Java's Reentrant Locks

APLAS '08 Proceedings of the 6th Asian Symposium on Programming Languages and Systems
Automatic Parallelization with Separation Logic

ESOP '09 Proceedings of the 18th European Symposium on Programming Languages and Systems: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Variables as Resource in Separation Logic

Electronic Notes in Theoretical Computer Science (ENTCS)
Checking interference with fractional permissions

SAS'03 Proceedings of the 10th international conference on Static analysis
Shape analysis for composite data structures

CAV'07 Proceedings of the 19th international conference on Computer aided verification
Tom: piggybacking rewriting on java

RTA'07 Proceedings of the 18th international conference on Term rewriting and applications
Local reasoning for storable locks and threads

APLAS'07 Proceedings of the 5th Asian conference on Programming languages and systems
Keep off the grass: locking the right path for atomicity

CC'08/ETAPS'08 Proceedings of the Joint European Conferences on Theory and Practice of Software 17th international conference on Compiler construction
Smallfoot: modular automatic assertion checking with separation logic

FMCO'05 Proceedings of the 4th international conference on Formal Methods for Components and Objects
Certificate translation for optimizing compilers

SAS'06 Proceedings of the 13th international conference on Static Analysis
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Concurrent separation logic for pipelined parallelization

SAS'10 Proceedings of the 17th international conference on Static analysis
Resource-sensitive synchronization inference by abduction

POPL '12 Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Proof-Directed Parallelization Synthesis by Separation Logic

ACM Transactions on Programming Languages and Systems (TOPLAS)

Quantified Score

Hi-index	0.01

Visualization

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.