5 citations · 11 across the 5 of their papers we have counts for
5 papers
KEM-IND-CCA-Preserving Compilation of Jasmin's ML-KEM
Santiago Arranz-Olmos, Gilles Barthe, Lionel Blatter +3
High-assurance cryptography provides strong guarantees that source implementations are functionally correct and provably secure. In this paper, we demonstrate that the Jasmin compi…
A Modular Structural Operational Semantics for Delimited Continuations
Neil Sculthorpe, Paolo Torrini, Peter D. Mosses
It has been an open question as to whether the Modular Structural Operational Semantics framework can express the dynamic semantics of call/cc. This paper shows that it can, and fu…
Reasoning about modular datatypes with Mendler induction
Paolo Torrini, Tom Schrijvers
In functional programming, datatypes a la carte provide a convenient modular representation of recursive datatypes, based on their initial algebra semantics. Unfortunately it is hi…
Resource-Bound Quantification for Graph Transformation
Paolo Torrini, Reiko Heckel
Graph transformation has been used to model concurrent systems in software engineering, as well as in biochemistry and life sciences. The application of a transformation rule can b…
Towards an embedding of Graph Transformation in Intuitionistic Linear Logic
Paolo Torrini, Reiko Heckel
Linear logics have been shown to be able to embed both rewriting-based approaches and process calculi in a single, declarative framework. In this paper we are exploring the embeddi…