Add to ORKGWe 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
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
This paper presents a new technique for introducing and tuning parallelism for heterogeneous shared-...
International audienceWe show how, given a program and its separation logic proof, one can paralleli...
AbstractPartial redundancy elimination is a subtle optimization which performs common subexpression ...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
We present two new algorithms which perform automatic parallelization via source-to-source transfor...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
While program correctness for compiled languages depends fundamentally on compiler correctness, comp...
textMulti-core systems have become commonplace, however, theorem provers often do not take advantage...
International audienceSeveral proof assistants, such as Isabelle or Coq, can concurrently check mult...
Funding: This work has been supported by the European Union grants RII3-CT-2005- 026133 SCIEnce: Sym...
International audienceThis article describes the formal verification of a compilation algorithm that...
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
This paper presents a new technique for introducing and tuning parallelism for heterogeneous shared-...
International audienceWe show how, given a program and its separation logic proof, one can paralleli...
AbstractPartial redundancy elimination is a subtle optimization which performs common subexpression ...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
We present two new algorithms which perform automatic parallelization via source-to-source transfor...
Concurrency is often an optimisation, rather than intrinsic to the functional behaviour of a program...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
While program correctness for compiled languages depends fundamentally on compiler correctness, comp...
textMulti-core systems have become commonplace, however, theorem provers often do not take advantage...
International audienceSeveral proof assistants, such as Isabelle or Coq, can concurrently check mult...
Funding: This work has been supported by the European Union grants RII3-CT-2005- 026133 SCIEnce: Sym...
International audienceThis article describes the formal verification of a compilation algorithm that...
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi...
The goal of this dissertation is to give programmers the ability to achieve high performance by focu...
This paper presents a new technique for introducing and tuning parallelism for heterogeneous shared-...