Dominique Devriese

According to our database1, Dominique Devriese authored at least 61 papers between 2010 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
On the semantic expressiveness of recursive types.
Proc. ACM Program. Lang., 2021

Fully abstract from static to gradual.
Proc. ACM Program. Lang., 2021

Efficient and provable local capability revocation using uninitialized capabilities.
Proc. ACM Program. Lang., 2021

2020
Reasoning about a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management.
ACM Trans. Program. Lang. Syst., 2020

Gavial: Programming the web with multi-tier FRP.
Art Sci. Eng. Program., 2020

Leibniz equality is isomorphic to Martin-Löf identity, parametrically.
J. Funct. Program., 2020

Abstract Congruence Criteria for Weak Bisimilarity.
CoRR, 2020

Transpension: The Right Adjoint to the Pi-type.
CoRR, 2020

Uninitialized Capabilities.
CoRR, 2020

CapablePtrs: Securely Compiling Partial Programs using the Pointers-as-Capabilities Principle.
CoRR, 2020

A Categorical Approach to Secure Compilation.
Proceedings of the Coalgebraic Methods in Computer Science, 2020

2019
Linear capabilities for fully abstract compilation of separation-logic-verified code.
Proc. ACM Program. Lang., 2019

StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities.
Proc. ACM Program. Lang., 2019

Reasoning About a Machine with Local Capabilities: Provably Safe Stack and Return Pointer Management - Technical Appendix Including Proofs and Details.
CoRR, 2019

How to do proofs: practically proving properties about effectful programs' results (functional pearl).
Proceedings of the 4th ACM SIGPLAN International Workshop on Type-Driven Development, 2019

Modular effects in Haskell through effect polymorphism and explicit dictionary applications: a new approach and the μVeriFast verifier as a case study.
Proceedings of the 12th ACM SIGPLAN International Symposium on Haskell, 2019

Temporal Safety for Stack Allocated Memory on Capability Machines.
Proceedings of the 32nd IEEE Computer Security Foundations Symposium, 2019

2018
Parametricity versus the universal type.
Proc. ACM Program. Lang., 2018

Proof-relevant unification: Dependent pattern matching with only the axioms of your type theory.
J. Funct. Program., 2018

StkTokens: Enforcing Well-bracketed Control Flow and Stack Encapsulation using Linear Capabilities - Technical Report with Proofs and Details.
CoRR, 2018

Coherent Explicit Dictionary Application for Haskell: Formalisation and Coherence Proof.
CoRR, 2018

Scalagna 0.1: towards multi-tier programming with Scala and Scala.js.
Proceedings of the Conference Companion of the 2nd International Conference on Art, 2018

Degrees of Relatedness: A Unified Framework for Parametricity, Irrelevance, Ad Hoc Polymorphism, Intersections, Unions and Algebra in Dependent Type Theory.
Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science, 2018

Coherent explicit dictionary application for Haskell.
Proceedings of the 11th ACM SIGPLAN International Symposium on Haskell, 2018

2017
Parametric quantifiers for dependent type theory.
Proc. ACM Program. Lang., 2017

Modular, Fully-abstract Compilation by Approximate Back-translation.
Log. Methods Comput. Sci., 2017

Elmsvuur: A Multi-tier Version of Elm and its Time-Traveling Debugger.
Proceedings of the Trends in Functional Programming - 18th International Symposium, 2017

Experience Report: Functional Reactive Programming and the DOM.
Proceedings of the Companion to the first International Conference on the Art, 2017

Expressive and strongly type-safe code generation.
Proceedings of the 19th International Symposium on Principles and Practice of Declarative Programming, Namur, Belgium, October 09, 2017

FRP IoT modules as a Scala DSL.
Proceedings of the 4th ACM SIGPLAN International Workshop on Reactive and Event-Based Languages and Systems, 2017

Lifting proof-relevant unification to higher dimensions.
Proceedings of the 6th ACM SIGPLAN Conference on Certified Programs and Proofs, 2017

Efficient Functional Reactive Programming Through Incremental Behaviors.
Proceedings of the Programming Languages and Systems - 15th Asian Symposium, 2017

2016
Eliminating dependent pattern matching without K.
J. Funct. Program., 2016

On Modular and Fully-Abstract Compilation - Technical Appendix.
CoRR, 2016

Security Guarantees for the Execution Infrastructure of Software Applications.
Proceedings of the IEEE Cybersecurity Development, 2016

Fully-abstract compilation by approximate back-translation.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Unifiers as equivalences: proof-relevant unification of dependently typed data.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

Reasoning about Object Capabilities with Logical Relations and Effect Parametricity.
Proceedings of the IEEE European Symposium on Security and Privacy, 2016

On Modular and Fully-Abstract Compilation.
Proceedings of the IEEE 29th Computer Security Foundations Symposium, 2016

2015
Generating safe boundary APIs between typed EDSLs and their environments.
Proceedings of the 2015 ACM SIGPLAN International Conference on Generative Programming: Concepts and Experiences, 2015

2014
Functional Techniques for Representing and Specifying Software (Functionele technieken voor het voorstellen en specifiëren van software).
PhD thesis, 2014

Secure multi-execution of web scripts: Theory and practice.
J. Comput. Secur., 2014

Partial Type Signatures for Haskell.
Proceedings of the Practical Aspects of Declarative Languages, 2014

Multi-Tier Functional Reactive Programming for the Web.
Proceedings of the Onward! 2014, 2014

Pattern matching without K.
Proceedings of the 19th ACM SIGPLAN international conference on Functional programming, 2014

Overlapping and Order-Independent Patterns - Definitional Equality for All.
Proceedings of the Programming Languages and Systems, 2014

Stateful Declassification Policies for Event-Driven Programs.
Proceedings of the IEEE 27th Computer Security Foundations Symposium, 2014

2013
Monadic abstract interpreters.
Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation, 2013

Fixing idioms: a recursion primitive for applicative DSLs.
Proceedings of the ACM SIGPLAN 2013 Workshop on Partial Evaluation and Program Manipulation, 2013

Typed syntactic meta-programming.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Information Flow Control for Web Scripts.
Proceedings of the Foundations of Security Analysis and Design VII, 2013

2012
Finally tagless observable recursion for an abstract grammar model.
J. Funct. Program., 2012

PESAP: A Privacy Enhanced Social Application Platform.
Proceedings of the 2012 International Conference on Privacy, 2012

Secure Multi-Execution through Static Program Transformation.
Proceedings of the Formal Techniques for Distributed Systems, 2012

FlowFox: a web browser with flexible and precise information flow control.
Proceedings of the ACM Conference on Computer and Communications Security, 2012

2011
Information flow enforcement in monadic libraries.
Proceedings of TLDI 2011: 2011 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2011

Explicitly Recursive Grammar Combinators - A Better Model for Shallow Parser DSLs.
Proceedings of the Practical Aspects of Declarative Languages, 2011

Reactive non-interference for a browser model.
Proceedings of the 5th International Conference on Network and System Security, 2011

Better Security and Privacy for Web Browsers: A Survey of Techniques, and a New Implementation.
Proceedings of the Formal Aspects of Security and Trust - 8th International Workshop, 2011

On the bright side of type classes: instance arguments in Agda.
Proceedings of the Proceeding of the 16th ACM SIGPLAN international conference on Functional Programming, 2011

2010
Noninterference through Secure Multi-execution.
Proceedings of the 31st IEEE Symposium on Security and Privacy, 2010


  Loading...