23 citations · 38 across the 12 of their papers we have counts for
11 papers · 1 filter
Towards Computational UIP in Cubical Agda
Yee-Jian Tan, Andreas Nuyts, Dominique Devriese
Some advantages of Cubical Type Theory, as implemented by Cubical Agda, over intensional Martin-Löf Type Theory include Quotient Inductive Types (QITs), which exist as instances of…
Formalizing, Verifying and Applying ISA Security Guarantees as Universal Contracts
Sander Huyghebaert, Steven Keuchel, Coen De Roover +1
Progress has recently been made on specifying instruction set architectures (ISAs) in executable formalisms rather than through prose. However, to date, those formal specifications…
Sikkel: Multimode Simple Type Theory as an Agda Library
Joris Ceulemans, Andreas Nuyts, Dominique Devriese
Many variants of type theory extend a basic theory with additional primitives or properties like univalence, guarded recursion or parametricity, to enable constructions or proofs t…
On the Semantic Expressiveness of Iso- and Equi-Recursive Types
Dominique Devriese, Eric Mark Martin, Marco Patrignani
Recursive types extend the simply-typed lambda calculus (STLC) with the additional expressive power to enable diverging computation and to encode recursive data-types (e.g., lists)…
Uninitialized Capabilities
Sander Huyghebaert, Thomas Van Strydonck, Steven Keuchel +1
This technical report describes a new extension to capability machines. Capability machines are a special type of processors that include better security primitives at the hardware…
CapablePtrs: Securely Compiling Partial Programs Using the Pointers-as-Capabilities Principle
Akram El-Korashy, Stelios Tsampas, Marco Patrignani +3
Capability machines such as CHERI provide memory capabilities that can be used by compilers to provide security benefits for compiled code (e.g., memory safety). The existing C to…
A categorical approach to secure compilation
Stelios Tsampas, Andreas Nuyts, Dominique Devriese +1
We introduce a novel approach to secure compilation based on maps of distributive laws. We demonstrate through four examples that the coherence criterion for maps of distributive l…
Gavial: Programming the web with multi-tier FRP
Bob Reynders, Frank Piessens, Dominique Devriese
Developing web applications requires dealing with their distributed nature and the natural asynchronicity of user input and network communication. For facilitating this, different…
Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof
Thomas Winant, Dominique Devriese
Type classes are one of Haskell's most popular features and extend its type system with ad-hoc polymorphism. Since their conception, there were useful features that could not be of…
Modular, Fully-abstract Compilation by Approximate Back-translation
Dominique Devriese, Marco Patrignani, Frank Piessens +1
A compiler is fully-abstract if the compilation from source language programs to target language programs reflects and preserves behavioural equivalence. Such compilers have import…
On Modular and Fully-Abstract Compilation -- Technical Appendix
Marco Patrignani, Dominique Devriese, Frank Piessens
Secure compilation studies compilers that generate target-level components that are as secure as their source-level counterparts. Full abstraction is the most widely-proven propert…