Add to ORKGInternational audienceWe 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
AbstractThis paper presents a heuristic methodology that can be used to discover (and/or better unde...
Existing compilers often fail to parallelize sequential code, even when a program can be manually...
Separation logic is a recent approach to the analysis of pointer programs in which resource separati...
We show how, given a program and its separation logic proof, one can parallelize and optimize this p...
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...
textMulti-core systems have become commonplace, however, theorem provers often do not take advantage...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
International audienceSeveral proof assistants, such as Isabelle or Coq, can concurrently check mult...
We present two new algorithms which perform automatic parallelization via source-to-source transfor...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
The implementation of a system for manipulating proof trees shows that the time spent on basic manip...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi...
AbstractThis paper presents a heuristic methodology that can be used to discover (and/or better unde...
Existing compilers often fail to parallelize sequential code, even when a program can be manually...
Separation logic is a recent approach to the analysis of pointer programs in which resource separati...
We show how, given a program and its separation logic proof, one can parallelize and optimize this p...
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...
textMulti-core systems have become commonplace, however, theorem provers often do not take advantage...
We present new algorithms which perform automatic parallelization via source-to-source transformatio...
International audienceSeveral proof assistants, such as Isabelle or Coq, can concurrently check mult...
We present two new algorithms which perform automatic parallelization via source-to-source transfor...
AbstractWe present a simple and uniform transformational system for extracting parallelism from prog...
The implementation of a system for manipulating proof trees shows that the time spent on basic manip...
International audienceWe show how monotone interpretations – a termination analysis technique for te...
When using a proof assistant to reason in an embedded logic – like separation logic – one cannot ben...
This dissertation addresses the problem of automated reasoning about multi-threaded programs. Multi...
AbstractThis paper presents a heuristic methodology that can be used to discover (and/or better unde...
Existing compilers often fail to parallelize sequential code, even when a program can be manually...
Separation logic is a recent approach to the analysis of pointer programs in which resource separati...