Derek Dreyer

Orcid: 0000-0002-3884-6867

Affiliations:
  • Max Planck Institute for Software Systems


According to our database1, Derek Dreyer authored at least 73 papers between 1998 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C.
Proc. ACM Program. Lang., October, 2023

Stuttering for Free.
Proc. ACM Program. Lang., October, 2023

Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning.
Proc. ACM Program. Lang., April, 2023

Conditional Contextual Refinement.
Proc. ACM Program. Lang., January, 2023

DimSum: A Decentralized Approach to Multi-language Semantics and Verification.
Proc. ACM Program. Lang., January, 2023

2022
BFF: foundational and automated verification of bitfield-manipulating programs.
Proc. ACM Program. Lang., 2022

Later credits: resourceful reasoning for the later modality.
Proc. ACM Program. Lang., 2022

Concurrent incorrectness separation logic.
Proc. ACM Program. Lang., 2022

VIP: verifying real-world C idioms with integer-pointer casts.
Proc. ACM Program. Lang., 2022

Finding real bugs in big programs with incorrectness logic.
Proc. ACM Program. Lang., 2022

Simuliris: a separation logic framework for verifying concurrent program optimizations.
Proc. ACM Program. Lang., 2022

Proving hypersafety compositionally.
Proc. ACM Program. Lang., 2022

On being a PhD student of Robert Harper.
J. Funct. Program., 2022

Islaris: verification of machine code against authoritative ISA semantics.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

Compass: strong and compositional library specifications in relaxed memory separation logic.
Proceedings of the PLDI '22: 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation, San Diego, CA, USA, June 13, 2022

2021
GhostCell: separating permissions from data in Rust.
Proc. ACM Program. Lang., 2021

Transfinite step-indexing for termination.
Proc. ACM Program. Lang., 2021

Safe systems programming in Rust.
Commun. ACM, 2021

Transfinite Iris: resolving an existential dilemma of step-indexed separation logic.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

RefinedC: automating the foundational verification of C code with refined ownership types.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021

2020
The high-level benefits of low-level sandboxing.
Proc. ACM Program. Lang., 2020

The future is ours: prophecy variables in separation logic.
Proc. ACM Program. Lang., 2020

Stacked borrows: an aliasing model for Rust.
Proc. ACM Program. Lang., 2020

RustBelt meets relaxed memory.
Proc. ACM Program. Lang., 2020

Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic.
Proceedings of the Computer Aided Verification - 32nd International Conference, 2020

2018
MoSeL: a general, extensible modal framework for interactive proofs in separation logic.
Proc. ACM Program. Lang., 2018

Mtac2: typed tactics for backward reasoning in Coq.
Proc. ACM Program. Lang., 2018

RustBelt: securing the foundations of the rust programming language.
Proc. ACM Program. Lang., 2018

Iris from the ground up: A modular foundation for higher-order concurrent separation logic.
J. Funct. Program., 2018

2017
Robust and compositional verification of object capability patterns.
Proc. ACM Program. Lang., 2017

Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris (Artifact).
Dagstuhl Artifacts Ser., 2017

A promising semantics for relaxed-memory concurrency.
Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages, 2017

Repairing sequential consistency in C/C++11.
Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2017

The Essence of Higher-Order Concurrent Separation Logic.
Proceedings of the Programming Languages and Systems, 2017

Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris.
Proceedings of the 31st European Conference on Object-Oriented Programming, 2017

2016
Special issue dedicated to ICFP 2014: Editorial.
J. Funct. Program., 2016

Lightweight verification of separate compilation.
Proceedings of the 43rd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2016

Higher-order ghost state.
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, 2016

2015
Mtac: A monad for typed tactic programming in Coq.
J. Funct. Program., 2015

Compositional Verification Methods for Next-Generation Concurrency (Dagstuhl Seminar 15191).
Dagstuhl Reports, 2015

Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

Verifying read-copy-update in a logic for weak memory.
Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation, 2015

Pilsner: a compositionally verified compiler for a higher-order imperative language.
Proceedings of the 20th ACM SIGPLAN International Conference on Functional Programming, 2015

2014
SIGPLAN awards.
ACM SIGPLAN Notices, 2014

F-ing modules.
J. Funct. Program., 2014

Backpack: retrofitting Haskell with interfaces.
Proceedings of the 41st Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2014

GPS: navigating weak memory with ghosts, protocols, and separation.
Proceedings of the 2014 ACM International Conference on Object Oriented Programming Systems Languages & Applications, 2014

2013
Mixin' Up the ML Module System.
ACM Trans. Program. Lang. Syst., 2013

Principles of POPL.
ACM SIGPLAN Notices, 2013

SIGPLAN most influential paper awards.
ACM SIGPLAN Notices, 2013

How to make ad hoc proof automation less ad hoc.
J. Funct. Program., 2013

Logical relations for fine-grained concurrency.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

The power of parameterization in coinductive proof.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

Internalizing Relational Parametricity in the Extensional Calculus of Constructions.
Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012
The impact of higher-order state and control effects on local relational reasoning.
J. Funct. Program., 2012

The marriage of bisimulations and Kripke logical relations.
Proceedings of the 39th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2012

Superficially substructural types.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2012

2011
Non-parametric parametricity.
J. Funct. Program., 2011

Logical Step-Indexed Logical Relations
Log. Methods Comput. Sci., 2011

A kripke logical relation between ML and assembly.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

Separation Logic in the Presence of Garbage Collection.
Proceedings of the 26th Annual IEEE Symposium on Logic in Computer Science, 2011

2010
A relational modal logic for higher-order stateful ADTs.
Proceedings of the 37th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2010

2009
State-dependent representation independence.
Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2009

2007
Recursive type generativity.
J. Funct. Program., 2007

Modular type classes.
Proceedings of the 34th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2007

A type system for recursive modules.
Proceedings of the 12th ACM SIGPLAN International Conference on Functional Programming, 2007

Principal Type Schemes for Modular Programs.
Proceedings of the Programming Languages and Systems, 2007

2004
A type system for well-founded recursion.
Proceedings of the 31st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2004

2003
Typed compilation of recursive datatypes.
Proceedings of TLDI'03: 2003 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, 2003

A type system for higher-order modules.
Proceedings of the Conference Record of POPL 2003: The 30th SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2003

1998
Two Heuristics for the Euclidean Steiner Tree Problem.
J. Glob. Optim., 1998


  Loading...