Clément Pit-Claudel

Clément Pit-Claudel

Auto-generated profile, based on publicly available information

Clément Pit-Claudel

EPFL, Lausanne, Switzerland

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 January 2015
Verified
Conference Paper
Open access
BDBenjamin Delaware
Benjamin Delaware
CPClément Pit-Claudel
Clément Pit-Claudel
JGJason Gross
Jason Gross
ACAdam Chlipala
Adam Chlipala
We present Fiat, a library for the Coq proof assistant supporting refinement of declarative specifications into efficient functional programs with a high degree of automation. Each refinement process leaves a proof trail, checkable by the normal Coq kernel, justifying its soundness. We focus on the synthesis of abstract data types that package methods with private data. We demonstrate the utility of our framework by applying it to the synthesis of query structures -- abstract data types with SQL-like query and insert operations. Fiat includes a library for writing specifications of query structures in SQL-inspired notation, expressing operations over relations (tables) in terms of mathematical sets. This library includes a suite of tactics for automating the refinement of specifications into efficient, correct-by-construction OCaml code. Using these tactics, a programmer can generate such an implementation completely automatically by only specifying the equivalent of SQL indexes, data structures capturing useful views of the abstract data. Throughout we speculate on the new programming modularity possibilities enabled by an automated refinement system with proved-correct rules.

11 June 2020
Verified
Conference Paper
Open access
TBThomas Bourgeat
Thomas Bourgeat
CPClément Pit-Claudel
Clément Pit-Claudel
ACAdam Chlipala
Adam Chlipala
ARArvind
Arvind
The Bluespec hardware-description language presents a significantly higher-level view than hardware engineers are used to, exposing a simpler concurrency model that promotes formal proof, without compromising on performance of compiled circuits. Unfortunately, the cost model of Bluespec has been unclear, with performance details depending on a mix of user hints and opaque static analysis of potential concurrency conflicts within a design. In this paper we present Koika, a derivative of Bluespec that preserves its desirable properties and yet gives direct control over the scheduling decisions that determine performance. Koika has a novel and deterministic operational semantics that uses dynamic analysis to avoid concurrency anomalies. Our implementation includes Coq definitions of syntax, semantics, key metatheorems, and a verified compiler to circuits. We argue that most of the extra circuitry required for dynamic analysis can be eliminated by compile-time BSV-style static analysis.

13 July 2016
Verified
Book Chapter
Closed access
KLK. R. M. Leino
K. R. M. Leino
CPClément Pit-Claudel
Clément Pit-Claudel

6 April 2019
Verified
Book Chapter
Open access
PDF file
GMGuido Martínez
Guido Martínez
DADanel Ahman
Danel Ahman
VDVictor Dumitrescu
Victor Dumitrescu
NGNick Giannarakis
Nick Giannarakis
CHChris Hawblitzel
Chris Hawblitzel
NSNikhil Swamy
Nikhil Swamy
We introduce Meta-F\(^{\star }\), a tactics and metaprogramming framework for the F\(^\star \) program verifier. The main novelty of Meta-F\(^\star \) is allowing the use of tactics and metaprogramming to discharge assertions not solvable by SMT, or to just simplify them into well-behaved SMT fragments. Plus, Meta-F\(^\star \) can be used to generate verified code automatically. Meta-F\(^\star \) is implemented as an F\(^\star \) effect, which, given the powerful effect system of F\(^{\star }\), heavily increases code reuse and even enables the lightweight verification of metaprograms. Metaprograms can be either interpreted, or compiled to efficient native code that can be dynamically loaded into the F\(^\star \) type-checker and can interoperate with interpreted code. Evaluation on realistic case studies shows that Meta-F\(^\star \) provides substantial gains in proof development, efficiency, and robustness.

26 July 2019 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
BDBenjamin Delaware
Benjamin Delaware
SSSorawit Suriyakarn
Sorawit Suriyakarn
CPClément Pit-Claudel
Clément Pit-Claudel
QYQianchuan Ye
Qianchuan Ye
ACAdam Chlipala
Adam Chlipala
It is a neat result from functional programming that libraries of parser combinators can support rapid construction of decoders for quite a range of formats. With a little more work, the same combinator program can denote both a decoder and an encoder. Unfortunately, the real world is full of gnarly formats, as with the packet formats that make up the standard Internet protocol stack. Most past parser-combinator approaches cannot handle these formats, and the few exceptions require redundancy – one part of the natural grammar needs to be hand-translated into hints in multiple parts of a parser program. We show how to recover very natural and nonredundant format specifications, covering all popular network packet formats and generating both decoders and encoders automatically. The catch is that we use the Coq proof assistant to derive both kinds of artifacts using tactics, automatically, in a way that guarantees that they form inverses of each other. We used our approach to reimplement packet processing for a full Internet protocol stack, inserting our replacement into the OCaml-based MirageOS unikernel, resulting in minimal performance degradation.