Remy Seassau

Remy Seassau

Auto-generated profile, based on publicly available information

Remy Seassau

INRIA, Paris, France

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
23 October 2023
Verified
Conference Paper
Open access
JPJohannes Åman Pohjola
Johannes Åman Pohjola
HSHira Taqdees Syeda
Hira Taqdees Syeda
MTMiki Tanaka
Miki Tanaka
KWKrishnan Winter
Krishnan Winter
TSTsun Wang Sau
Tsun Wang Sau
GHGernot Heiser
Gernot Heiser
We introduce Pancake, a new language for verifiable, low-level systems programming, especially device drivers. Pancake eschews complex type systems to make the language attractive to systems programmers, while at the same time aiming to ease the formal verification of code. We describe the design of the language and its verified compiler, and examine its usability, performance and current limitations through case studies of device drivers and related systems components for an seL4-based operating system.

5 August 2025 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
RSRemy Seassau
Remy Seassau
IYIrene Yoon
Irene Yoon
JMJean-Marie Madiot
Jean-Marie Madiot
FPFrançois Pottier
François Pottier
This paper makes a first step towards a formal definition of OCaml and a foundational program verification environment for OCaml. We present a formal definition of OLang, a nontrivial sequential fragment of OCaml, which includes first-class functions, ordinary and extensible algebraic data types, pattern matching, references, exceptions, and effect handlers. We define the dynamic semantics of OLang as a monadic interpreter. This interpreter runs atop a custom monad where computations are internally represented as trees of operations and equipped with a small-step semantics. We define two program logics for OLang. A stateless Hoare Logic allows reasoning about so-called "pure" programs; an Iris-based Separation Logic allows reasoning about arbitrary programs. We present the construction of the two logics as well as some examples of their use.