default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDerek Dreyer
Derek R. Dreyer
Person information
- affiliation: Max Planck Institute for Software Systems
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j41]Simon Spies
, Lennard Gäher, Michael Sammler, Derek Dreyer:
Quiver: Guided Abductive Inference of Separation Logic Specifications in Coq. Proc. ACM Program. Lang. 8(PLDI): 889-913 (2024)- [j40]Lennard Gäher, Michael Sammler, Ralf Jung, Robbert Krebbers, Derek Dreyer:
RefinedRust: A Type System for High-Assurance Verification of Rust Programs. Proc. ACM Program. Lang. 8(PLDI): 1115-1139 (2024) - 2023
- [j39]Noam Zilberstein, Derek Dreyer, Alexandra Silva:
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning. Proc. ACM Program. Lang. 7(OOPSLA1): 522-550 (2023) - [j38]Armaël Guéneau, Johannes Hostert, Simon Spies, Michael Sammler, Lars Birkedal, Derek Dreyer:
Melocoton: A Program Logic for Verified Interoperability Between OCaml and C. Proc. ACM Program. Lang. 7(OOPSLA2): 716-744 (2023) - [j37]Minki Cho, Youngju Song, Dongjae Lee, Lennard Gäher, Derek Dreyer:
Stuttering for Free. Proc. ACM Program. Lang. 7(OOPSLA2): 1677-1704 (2023) - [j36]Michael Sammler, Simon Spies, Youngju Song, Emanuele D'Osualdo, Robbert Krebbers, Deepak Garg, Derek Dreyer:
DimSum: A Decentralized Approach to Multi-language Semantics and Verification. Proc. ACM Program. Lang. 7(POPL): 775-805 (2023) - [j35]Youngju Song, Minki Cho, Dongjae Lee, Chung-Kil Hur, Michael Sammler, Derek Dreyer:
Conditional Contextual Refinement. Proc. ACM Program. Lang. 7(POPL): 1121-1151 (2023) - [i3]Noam Zilberstein, Derek Dreyer, Alexandra Silva:
Outcome Logic: A Unifying Foundation for Correctness and Incorrectness Reasoning. CoRR abs/2303.03111 (2023) - 2022
- [j34]Derek Dreyer, Benjamin C. Pierce:
On being a PhD student of Robert Harper. J. Funct. Program. 32: e3 (2022) - [j33]Simon Spies, Lennard Gäher, Joseph Tassarotti, Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer:
Later credits: resourceful reasoning for the later modality. Proc. ACM Program. Lang. 6(ICFP): 283-311 (2022) - [j32]Quang Loc Le, Azalea Raad, Jules Villard, Josh Berdine, Derek Dreyer, Peter W. O'Hearn:
Finding real bugs in big programs with incorrectness logic. Proc. ACM Program. Lang. 6(OOPSLA1): 1-27 (2022) - [j31]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving hypersafety compositionally. Proc. ACM Program. Lang. 6(OOPSLA2): 289-314 (2022) - [j30]Fengmin Zhu, Michael Sammler, Rodolphe Lepigre, Derek Dreyer, Deepak Garg:
BFF: foundational and automated verification of bitfield-manipulating programs. Proc. ACM Program. Lang. 6(OOPSLA2): 1613-1638 (2022) - [j29]Lennard Gäher, Michael Sammler, Simon Spies, Ralf Jung, Hoang-Hai Dang, Robbert Krebbers, Jeehoon Kang, Derek Dreyer:
Simuliris: a separation logic framework for verifying concurrent program optimizations. Proc. ACM Program. Lang. 6(POPL): 1-31 (2022) - [j28]Rodolphe Lepigre, Michael Sammler, Kayvan Memarian, Robbert Krebbers, Derek Dreyer, Peter Sewell:
VIP: verifying real-world C idioms with integer-pointer casts. Proc. ACM Program. Lang. 6(POPL): 1-32 (2022) - [j27]Azalea Raad, Josh Berdine, Derek Dreyer, Peter W. O'Hearn:
Concurrent incorrectness separation logic. Proc. ACM Program. Lang. 6(POPL): 1-29 (2022) - [c41]Hoang-Hai Dang, Jaehwang Jung, Jaemin Choi, Duc-Than Nguyen, William Mansky, Jeehoon Kang, Derek Dreyer:
Compass: strong and compositional library specifications in relaxed memory separation logic. PLDI 2022: 792-808 - [c40]Michael Sammler, Angus Hammond, Rodolphe Lepigre, Brian Campbell, Jean Pichon-Pharabod, Derek Dreyer, Deepak Garg, Peter Sewell:
Islaris: verification of machine code against authoritative ISA semantics. PLDI 2022: 825-840 - [c39]Yusuke Matsushita, Xavier Denis, Jacques-Henri Jourdan, Derek Dreyer:
RustHornBelt: a semantic foundation for functional verification of Rust programs with unsafe code. PLDI 2022: 841-856 - [i2]Emanuele D'Osualdo, Azadeh Farzan, Derek Dreyer:
Proving Hypersafety Compositionally. CoRR abs/2209.07448 (2022) - 2021
- [j26]Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, Derek Dreyer:
Safe systems programming in Rust. Commun. ACM 64(4): 144-152 (2021) - [j25]Joshua Yanovski, Hoang-Hai Dang, Ralf Jung, Derek Dreyer:
GhostCell: separating permissions from data in Rust. Proc. ACM Program. Lang. 5(ICFP): 1-30 (2021) - [j24]Simon Spies, Neel Krishnaswami, Derek Dreyer:
Transfinite step-indexing for termination. Proc. ACM Program. Lang. 5(POPL): 1-29 (2021) - [c38]Simon Spies, Lennard Gäher, Daniel Gratzer, Joseph Tassarotti, Robbert Krebbers, Derek Dreyer, Lars Birkedal:
Transfinite Iris: resolving an existential dilemma of step-indexed separation logic. PLDI 2021: 80-95 - [c37]Michael Sammler, Rodolphe Lepigre, Robbert Krebbers, Kayvan Memarian, Derek Dreyer, Deepak Garg:
RefinedC: automating the foundational verification of C code with refined ownership types. PLDI 2021: 158-174 - 2020
- [j23]Michael Sammler, Deepak Garg, Derek Dreyer, Tadeusz Litak:
The high-level benefits of low-level sandboxing. Proc. ACM Program. Lang. 4(POPL): 32:1-32:32 (2020) - [j22]Hoang-Hai Dang, Jacques-Henri Jourdan, Jan-Oliver Kaiser, Derek Dreyer:
RustBelt meets relaxed memory. Proc. ACM Program. Lang. 4(POPL): 34:1-34:29 (2020) - [j21]Ralf Jung, Hoang-Hai Dang, Jeehoon Kang, Derek Dreyer:
Stacked borrows: an aliasing model for Rust. Proc. ACM Program. Lang. 4(POPL): 41:1-41:32 (2020) - [j20]Ralf Jung, Rodolphe Lepigre, Gaurav Parthasarathy, Marianna Rapoport, Amin Timany, Derek Dreyer, Bart Jacobs:
The future is ours: prophecy variables in separation logic. Proc. ACM Program. Lang. 4(POPL): 45:1-45:32 (2020) - [c36]Azalea Raad, Josh Berdine, Hoang-Hai Dang, Derek Dreyer, Peter W. O'Hearn, Jules Villard:
Local Reasoning About the Presence of Bugs: Incorrectness Separation Logic. CAV (2) 2020: 225-252
2010 – 2019
- 2018
- [j19]Ralf Jung, Robbert Krebbers, Jacques-Henri Jourdan, Ales Bizjak, Lars Birkedal, Derek Dreyer:
Iris from the ground up: A modular foundation for higher-order concurrent separation logic. J. Funct. Program. 28: e20 (2018) - [j18]Robbert Krebbers, Jacques-Henri Jourdan, Ralf Jung, Joseph Tassarotti, Jan-Oliver Kaiser, Amin Timany, Arthur Charguéraud, Derek Dreyer:
MoSeL: a general, extensible modal framework for interactive proofs in separation logic. Proc. ACM Program. Lang. 2(ICFP): 77:1-77:30 (2018) - [j17]Jan-Oliver Kaiser, Beta Ziliani, Robbert Krebbers, Yann Régis-Gianas, Derek Dreyer:
Mtac2: typed tactics for backward reasoning in Coq. Proc. ACM Program. Lang. 2(ICFP): 78:1-78:31 (2018) - [j16]Ralf Jung, Jacques-Henri Jourdan, Robbert Krebbers, Derek Dreyer:
RustBelt: securing the foundations of the rust programming language. Proc. ACM Program. Lang. 2(POPL): 66:1-66:34 (2018) - 2017
- [j15]Jan-Oliver Kaiser, Hoang-Hai Dang, Derek Dreyer, Ori Lahav, Viktor Vafeiadis:
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris (Artifact). Dagstuhl Artifacts Ser. 3(2): 15:1-15:2 (2017) - [j14]David Swasey, Deepak Garg, Derek Dreyer:
Robust and compositional verification of object capability patterns. Proc. ACM Program. Lang. 1(OOPSLA): 89:1-89:26 (2017) - [c35]Jan-Oliver Kaiser, Hoang-Hai Dang, Derek Dreyer, Ori Lahav, Viktor Vafeiadis:
Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris. ECOOP 2017: 17:1-17:29 - [c34]Robbert Krebbers, Ralf Jung, Ales Bizjak, Jacques-Henri Jourdan, Derek Dreyer, Lars Birkedal:
The Essence of Higher-Order Concurrent Separation Logic. ESOP 2017: 696-723 - [c33]Ori Lahav, Viktor Vafeiadis, Jeehoon Kang, Chung-Kil Hur, Derek Dreyer:
Repairing sequential consistency in C/C++11. PLDI 2017: 618-632 - [c32]Jeehoon Kang, Chung-Kil Hur, Ori Lahav, Viktor Vafeiadis, Derek Dreyer:
A promising semantics for relaxed-memory concurrency. POPL 2017: 175-189 - 2016
- [j13]Derek Dreyer, Mary Sheeran:
Special issue dedicated to ICFP 2014: Editorial. J. Funct. Program. 26: e20 (2016) - [c31]Ralf Jung, Robbert Krebbers, Lars Birkedal, Derek Dreyer:
Higher-order ghost state. ICFP 2016: 256-269 - [c30]Jeehoon Kang, Yoonseung Kim, Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis:
Lightweight verification of separate compilation. POPL 2016: 178-190 - 2015
- [j12]Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis:
Mtac: A monad for typed tactic programming in Coq. J. Funct. Program. 25 (2015) - [c29]Georg Neis, Chung-Kil Hur, Jan-Oliver Kaiser, Craig McLaughlin, Derek Dreyer, Viktor Vafeiadis:
Pilsner: a compositionally verified compiler for a higher-order imperative language. ICFP 2015: 166-178 - [c28]Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis:
Verifying read-copy-update in a logic for weak memory. PLDI 2015: 110-120 - [c27]Ralf Jung, David Swasey, Filip Sieczkowski, Kasper Svendsen, Aaron Turon, Lars Birkedal, Derek Dreyer:
Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning. POPL 2015: 637-650 - [i1]Lars Birkedal, Derek Dreyer, Philippa Gardner, Zhong Shao:
Compositional Verification Methods for Next-Generation Concurrency (Dagstuhl Seminar 15191). Dagstuhl Reports 5(5): 1-23 (2015) - 2014
- [j11]Andreas Rossberg, Claudio V. Russo, Derek Dreyer:
F-ing modules. J. Funct. Program. 24(5): 529-607 (2014) - [j10]Derek Dreyer:
SIGPLAN awards. ACM SIGPLAN Notices 49(4S): 5-7 (2014) - [c26]Aaron Turon, Viktor Vafeiadis, Derek Dreyer:
GPS: navigating weak memory with ghosts, protocols, and separation. OOPSLA 2014: 691-707 - [c25]Scott Kilpatrick, Derek Dreyer, Simon L. Peyton Jones, Simon Marlow:
Backpack: retrofitting Haskell with interfaces. POPL 2014: 19-32 - 2013
- [j9]Georges Gonthier, Beta Ziliani, Aleksandar Nanevski, Derek Dreyer:
How to make ad hoc proof automation less ad hoc. J. Funct. Program. 23(4): 357-401 (2013) - [j8]Derek Dreyer:
SIGPLAN most influential paper awards. ACM SIGPLAN Notices 48(4S): 7-8 (2013) - [j7]Derek Dreyer, John Field, Roberto Giacobazzi, Michael Hicks, Suresh Jagannathan, Mooly Sagiv, Peter Sewell, Philip Wadler:
Principles of POPL. ACM SIGPLAN Notices 48(4S): 12-16 (2013) - [j6]Andreas Rossberg, Derek Dreyer:
Mixin' Up the ML Module System. ACM Trans. Program. Lang. Syst. 35(1): 2:1-2:84 (2013) - [c24]Neelakantan R. Krishnaswami, Derek Dreyer:
Internalizing Relational Parametricity in the Extensional Calculus of Constructions. CSL 2013: 432-451 - [c23]Beta Ziliani, Derek Dreyer, Neelakantan R. Krishnaswami, Aleksandar Nanevski, Viktor Vafeiadis:
Mtac: a monad for typed tactic programming in Coq. ICFP 2013: 87-100 - [c22]Aaron Turon, Derek Dreyer, Lars Birkedal:
Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency. ICFP 2013: 377-390 - [c21]Chung-Kil Hur, Georg Neis, Derek Dreyer, Viktor Vafeiadis:
The power of parameterization in coinductive proof. POPL 2013: 193-206 - [c20]Aaron Joseph Turon, Jacob Thamsborg, Amal Ahmed, Lars Birkedal, Derek Dreyer:
Logical relations for fine-grained concurrency. POPL 2013: 343-356 - 2012
- [j5]Derek Dreyer, Georg Neis, Lars Birkedal:
The impact of higher-order state and control effects on local relational reasoning. J. Funct. Program. 22(4-5): 477-528 (2012) - [c19]Neelakantan R. Krishnaswami, Aaron Turon, Derek Dreyer, Deepak Garg:
Superficially substructural types. ICFP 2012: 41-54 - [c18]Chung-Kil Hur, Derek Dreyer, Georg Neis, Viktor Vafeiadis:
The marriage of bisimulations and Kripke logical relations. POPL 2012: 59-72 - 2011
- [j4]Derek Dreyer, Amal Ahmed, Lars Birkedal:
Logical Step-Indexed Logical Relations. Log. Methods Comput. Sci. 7(2) (2011) - [j3]Georg Neis, Derek Dreyer, Andreas Rossberg:
Non-parametric parametricity. J. Funct. Program. 21(4-5): 497-562 (2011) - [c17]Georges Gonthier, Beta Ziliani, Aleksandar Nanevski, Derek Dreyer:
How to make ad hoc proof automation less ad hoc. ICFP 2011: 163-175 - [c16]Chung-Kil Hur, Derek Dreyer, Viktor Vafeiadis:
Separation Logic in the Presence of Garbage Collection. LICS 2011: 247-256 - [c15]Chung-Kil Hur, Derek Dreyer:
A kripke logical relation between ML and assembly. POPL 2011: 133-146 - [e2]Stephanie Weirich, Derek Dreyer:
Proceedings of TLDI 2011: 2011 ACM SIGPLAN International Workshop on Types in Languages Design and Implementation, Austin, TX, USA, January 25, 2011. ACM 2011, ISBN 978-1-4503-0484-9 [contents] - 2010
- [c14]Derek Dreyer, Georg Neis, Lars Birkedal:
The impact of higher-order state and control effects on local relational reasoning. ICFP 2010: 143-156 - [c13]Derek Dreyer, Georg Neis, Andreas Rossberg, Lars Birkedal:
A relational modal logic for higher-order stateful ADTs. POPL 2010: 185-198 - [c12]Andreas Rossberg, Claudio V. Russo, Derek Dreyer:
F-ing modules. TLDI 2010: 89-102
2000 – 2009
- 2009
- [c11]Georg Neis, Derek Dreyer, Andreas Rossberg:
Non-parametric parametricity. ICFP 2009: 135-148 - [c10]Derek Dreyer, Amal Ahmed, Lars Birkedal:
Logical Step-Indexed Logical Relations. LICS 2009: 71-80 - [c9]Amal Ahmed, Derek Dreyer, Andreas Rossberg:
State-dependent representation independence. POPL 2009: 340-353 - 2008
- [c8]Derek Dreyer, Andreas Rossberg:
Mixin' up the ML module system. ICFP 2008: 307-320 - 2007
- [j2]Derek Dreyer:
Recursive type generativity. J. Funct. Program. 17(4-5): 433-471 (2007) - [c7]Derek Dreyer, Matthias Blume:
Principal Type Schemes for Modular Programs. ESOP 2007: 441-457 - [c6]Derek Dreyer:
A type system for recursive modules. ICFP 2007: 289-302 - [c5]Derek Dreyer, Robert Harper, Manuel M. T. Chakravarty, Gabriele Keller:
Modular type classes. POPL 2007: 63-70 - [e1]Claudio V. Russo, Derek Dreyer:
Proceedings of the ACM Workshop on ML, 2007, Freiburg, Germany, October 5, 2007. ACM 2007, ISBN 978-1-59593-676-9 [contents] - 2005
- [c4]Derek Dreyer:
Recursive type generativity. ICFP 2005: 41-53 - 2004
- [c3]Derek Dreyer:
A type system for well-founded recursion. POPL 2004: 293-305 - 2003
- [c2]Derek Dreyer, Karl Crary, Robert Harper:
A type system for higher-order modules. POPL 2003: 236-249 - [c1]Joseph Vanderwaart, Derek Dreyer, Leaf Petersen, Karl Crary, Robert Harper, Perry Cheng:
Typed compilation of recursive datatypes. TLDI 2003: 98-108
1990 – 1999
- 1998
- [j1]Derek R. Dreyer, Michael L. Overton:
Two Heuristics for the Euclidean Steiner Tree Problem. J. Glob. Optim. 13(1): 95-106 (1998)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
