Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
Proving a program in separation logic consists of tracking how parts of the heap are disjointly accessed by the different parts of the program. Parallelizing a program consists of finding parts of...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
Proving a program in separation logic consists of tracking how parts of the heap are disjointly accessed by the different parts of the program. Parallelizing a program consists of finding parts of...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Specifying and Checking Protocols of Multithreaded Classes (2009)
In the Design By Contract (DBC) approach, programmers specify methods with pre and postconditions (also called contracts). Earlier work added protocols to the DBC approach to describe allowed method...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Automatic Parallelization and Optimization of Programs by Proof Rewriting (2009)
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...
Spécification et vérification de programmes orientés objets en logique de séparation (2009)
Cette thèse propose une extension de la logique de séparation pour les programmes parallèles et orientés-objets. La logique de séparation est un formalisme récent et prometteur pour vérifier...
Spécification et vérification de programmes orientés objets en logique de séparation (2009)
Cette thèse propose une extension de la logique de séparation pour les programmes parallèles et orientés-objets. La logique de séparation est un formalisme récent et prometteur pour vérifier...
Spécification et vérification de programmes orientés objets en logique de séparation (2009)
Cette thèse propose une extension de la logique de séparation pour les programmes parallèles et orientés-objets. La logique de séparation est un formalisme récent et prometteur pour vérifier...
The Stability Problem for Verification of Concurrent Object-Oriented Programs (2008)
Marieke Huisman, Clément Hurlin
Modular static verification of concurrent object-oriented programs remains a challenge. This paper discusses the impact of concurrency on the use and meaning of behavioural specifications, and in...
with contributions from (2008)
Joseph R. Kiniry, Patrice Chalin, Clément Hurlin, Cees-bart Breunesse, Julien Charles, ...
Automatic verification by means of extended static checking (ESC) has seen some success in industry and academia due to its lightweight and easy-to-use nature. Unfortunately, ESC comes at a cost: a...
with contributions from (2008)
Joseph R. Kiniry, Patrice Chalin, Clément Hurlin, Cees-bart Breunesse, David Cok, ...
Automatic verification by means of extended static checking (ESC) has seen some success in industry and academia due to its lightweight and easy-to-use nature. Unfortunately, ESC comes at a cost: a...
Local Organization: Event4 Event Management Table of Contents (2008)
Lucas Dixon, Moa Johansson, Local Proofs, Local Theories, Makarius Wenzel, Clément Hurlin, ...
Separation Logic Contracts for a Java-like Language with Fork/Join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Separation Logic Contracts for a Java-like Language with Fork/Join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Separation Logic Contracts for a Java-like Language with Fork/Join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Separation Logic Contracts for a Java-like Language with Fork/Join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Separation logic contracts for a Java-like language with fork/join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Reasoning about Java's reentrant locks (2008)
Haack, Christian, Huisman, Marieke, Hurlin, Clément
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permission-accounting separation logic. As usual, each...
Separation logic contracts for a Java-like language with fork/join (2008)
Haack, Christian, Hurlin, Clément
We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional...
Reasoning about Java's reentrant locks (2008)
Haack, Christian, Huisman, Marieke, Hurlin, Clément
This paper presents a verification technique for a concurrent Java-like language with reentrant locks. The verification technique is based on permission-accounting separation logic. As usual, each...
Permission Specifications for Common Multithreaded Programming Patterns (2007)
Huisman, Marieke, Hurlin, Clément
Multithreading is the next challenge for program verification. To support modular verification of multithreaded programs, one should know when data might be accessed or updated by the different...
The stability problem for verification of concurrent object-oriented programs (2007)
Huisman, Marieke, Hurlin, Clément
Modular static verification of concurrent object-oriented programs remains a challenge. This paper discusses the impact of concurrency on the use and meaning of behavioural specifications, and in...
Permission Specifications for Common Multithreaded Programming Patterns (2007)
Huisman, Marieke, Hurlin, Clément
Multithreading is the next challenge for program verification. To support modular verification of multithreaded programs, one should know when data might be accessed or updated by the different...
The stability problem for verification of concurrent object-oriented programs (2007)
Huisman, Marieke, Hurlin, Clément
Modular static verification of concurrent object-oriented programs remains a challenge. This paper discusses the impact of concurrency on the use and meaning of behavioural specifications, and in...
Proof reconstruction for first-order logic and set-theoretical constructions (2006)
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the first tool and the automation...
Proof reconstruction for first-order logic and set-theoretical constructions (2006)
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the first tool and the automation...
Proof reconstruction for first-order logic and set-theoretical constructions (2006)
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit of the expressiveness of the first tool and the automation...
Reconstruction de preuves pour les formules quantifiées et ensemblistes (2006)
La reconstruction de preuve est une technique qui combine un prouveur interactif et un prouveur automatique de manière correcte. L'utilisateur bénéficie ainsi de l'expressivité du prouveur...
Reconstruction de preuves pour les formules quantifiées et ensemblistes (2006)
La reconstruction de preuve est une technique qui combine un prouveur interactif et un prouveur automatique de manière correcte. L'utilisateur bénéficie ainsi de l'expressivité du prouveur...
Proof reconstruction for first-order logic and set-theoretical constructions (2006)
Clément Hurlin, Inria Sophia-antipolis, Amine Chaieb, Tjark Weber, Pascal Fontaine, ...
Proof reconstruction is a technique that combines an interactive theorem prover and an automatic one in a sound way, so that users benefit from the expressiveness of the first tool and the automation...