activity
20162022
most citedA Monadic Framework for Relational Verification: Applied to Information Security, Program Equivalence, and Optimizations

23 citations · 55 across the 6 of their papers we have counts for

collaborators
Showing cs.PLShow all

7 papers · 1 filter

cs.PL2022★ 10 cited

A Reasonably Gradual Type Theory

Kenji Maillard, Meven Lennon-Bertrand, Nicolas Tabareau +1

Gradualizing the Calculus of Inductive Constructions (CIC) involves dealing with subtle tensions between normalization, graduality, and conservativity with respect to CIC. Recently…

cs.PL2020★ 16 cited

Gradualizing the Calculus of Inductive Constructions

Meven Lennon-Bertrand, Kenji Maillard, Nicolas Tabareau +1

We investigate gradual variations on the Calculus of Inductive Construction (CIC) for swifter prototyping with imprecise types and terms. We observe, with a no-go theorem, a crucia…

cs.PL2019★ 4 cited

The Next 700 Relational Program Logics

Kenji Maillard, Catalin Hritcu, Exequiel Rivas +1

We propose the first framework for defining relational program logics for arbitrary monadic effects. The framework is embedded within a relational dependent type theory and is high…

cs.PL2019

Dijkstra Monads for All

Kenji Maillard, Danel Ahman, Robert Atkey +4

This paper proposes a general semantic framework for verifying programs with arbitrary monadic side-effects using Dijkstra monads, which we define as monad-like structures indexed…

cs.PL2017

Recalling a Witness: Foundations and Applications of Monotonic State

Danel Ahman, Cédric Fournet, Catalin Hritcu +3

We provide a way to ease the verification of programs whose state evolves monotonically. The main idea is that a property witnessed in a prior state can be soundly recalled in the…

cs.PL2017★ 23 cited

A Monadic Framework for Relational Verification: Applied to Information Security, Program Equivalence, and Optimizations

Niklas Grimm, Kenji Maillard, Cédric Fournet +7

Relational properties describe multiple runs of one or more programs. They characterize many useful notions of security, program refinement, and equivalence for programs with diver…

cs.PL2016

Dijkstra Monads for Free

Danel Ahman, Catalin Hritcu, Kenji Maillard +5

Dijkstra monads enable a dependent type theory to be enhanced with support for specifying and verifying effectful code via weakest preconditions. Together with their closely relate…