1 code implementation • 10 May 2020 • Maximilian Algehed, Jean-Philippe Bernardy, Catalin Hritcu
We show that noninterference and transparency, the key soundness theorems for dynamic IFC libraries, can be obtained "for free", as direct consequences of the more general parametricity theorem of type abstraction.
Programming Languages Cryptography and Security Logic in Computer Science
1 code implementation • 4 Mar 2019 • Kenji Maillard, Danel Ahman, Robert Atkey, Guido Martinez, Catalin Hritcu, Exequiel Rivas, Éric Tanter
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 by a specification monad.
Programming Languages
1 code implementation • 12 Jul 2018 • Carmine Abate, Roberto Blanco, Deepak Garg, Catalin Hritcu, Marco Patrignani, Jérémy Thibault
However, while research in this area has so far focused on preserving observational equivalence, as needed for achieving full abstraction, there is a much larger space of security properties one can choose to preserve against linked adversarial code.
Programming Languages Cryptography and Security
no code implementations • 8 Jul 2017 • Danel Ahman, Cédric Fournet, Catalin Hritcu, Kenji Maillard, Aseem Rastogi, Nikhil Swamy
We provide a way to ease the verification of programs whose state evolves monotonically.
Programming Languages Cryptography and Security
4 code implementations • 28 Feb 2017 • Jonathan Protzenko, Jean-Karim Zinzindohoué, Aseem Rastogi, Tahina Ramananandro, Peng Wang, Santiago Zanella-Béguelin, Antoine Delignat-Lavaud, Catalin Hritcu, Karthikeyan Bhargavan, Cédric Fournet, Nikhil Swamy
Low* is a shallow embedding of a small, sequential, well-behaved subset of C in F*, a dependently-typed variant of ML aimed at program verification.
Programming Languages Cryptography and Security