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
We describe a technique for automatically proving compiler optimizations sound, meaning that their t...
The problem of partitioning grid-based applications for parallel computing can be solved easily and ...
AbstractIn this paper we present a set of axioms and rules of inference for a parallel programming l...
Abstract. We show how, given a program and its separation logic proof, one can parallelize and optim...
AbstractPartial redundancy elimination is a subtle optimization which performs common subexpression ...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
Abstract. In order to take best advantage of modern multi-core sys-tems, interactive theorem provers...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
The structured programming literature provides methods and a wealth of heuristic knowledge for guid...
information presented here does not necessarily re ect the position or the policy of the Government ...
We present an automated technique for generating compiler op-timizations from examples of concrete p...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
The problem of partitioning grid-based applications for parallel computing can be solved easily and ...
We describe a technique for automatically proving compiler optimizations sound, meaning that their t...
The problem of partitioning grid-based applications for parallel computing can be solved easily and ...
AbstractIn this paper we present a set of axioms and rules of inference for a parallel programming l...
Abstract. We show how, given a program and its separation logic proof, one can parallelize and optim...
AbstractPartial redundancy elimination is a subtle optimization which performs common subexpression ...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
Abstract. In order to take best advantage of modern multi-core sys-tems, interactive theorem provers...
This thesis presents an axiomatic method for proving certain correctness properties of parallel pro...
. In the proofs as programs methodology a program is derived from a formal constructive proof. Becau...
The use of *proof plans* -- formal patterns of reasoning for theorem proving -- to control the (auto...
The structured programming literature provides methods and a wealth of heuristic knowledge for guid...
information presented here does not necessarily re ect the position or the policy of the Government ...
We present an automated technique for generating compiler op-timizations from examples of concrete p...
The use of proof plans -formal patterns of reasoning for theorem proving -to control the {automatic...
The problem of partitioning grid-based applications for parallel computing can be solved easily and ...
We describe a technique for automatically proving compiler optimizations sound, meaning that their t...
The problem of partitioning grid-based applications for parallel computing can be solved easily and ...
AbstractIn this paper we present a set of axioms and rules of inference for a parallel programming l...
DOI
Add to ORKG