Benjamin Delaware

Orcid: 0000-0002-1016-6261

According to our database1, Benjamin Delaware authored at least 26 papers between 2009 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A HAT Trick: Automatically Verifying Representation Invariants Using Symbolic Finite Automata.
CoRR, 2024

2023
A Type-Based Approach to Divide-and-Conquer Recursion in Coq.
Proc. ACM Program. Lang., January, 2023

Covering All the Bases: Type-Based Verification of Test Input Generators.
Proc. ACM Program. Lang., 2023

Taype: A Policy-Agnostic Language for Oblivious Computation.
Proc. ACM Program. Lang., 2023

Taypsi: Static Enforcement of Privacy Policies for Policy-Agnostic Oblivious Computation.
CoRR, 2023

2022
Oblivious algebraic data types.
Proc. ACM Program. Lang., 2022

RHLE: Modular Deductive Verification of Relational ∀ ∃ Properties.
Proceedings of the Programming Languages and Systems - 20th Asian Symposium, 2022

2021
Data-driven abductive inference of library specifications.
Proc. ACM Program. Lang., 2021

Relational Type Theory (All Proofs).
CoRR, 2021

Repairing serializability bugs in distributed database programs via automated schema refactoring.
Proceedings of the PLDI '21: 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, 2021


2020
HACCLE: An Ecosystem for Building Secure Multi-Party Computations.
CoRR, 2020

RHLE: Automatic Verification of ∀∃-Hyperproperties.
CoRR, 2020

Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs.
Proceedings of the Automated Reasoning - 10th International Joint Conference, 2020

2019
CLOTHO: directed test generation for weakly consistent database systems.
Proc. ACM Program. Lang., 2019

Narcissus: correct-by-construction derivation of decoders and encoders from binary formats.
Proc. ACM Program. Lang., 2019

A verified protocol buffer compiler.
Proceedings of the 8th ACM SIGPLAN International Conference on Certified Programs and Proofs, 2019

2018
Narcissus: Deriving Correct-By-Construction Decoders and Encoders from Binary Formats.
CoRR, 2018

2017
The End of History? Using a Proof Assistant to Replace Language Design with Library Design.
Proceedings of the 2nd Summit on Advances in Programming Languages, 2017

Using Coq to write fast and correct Haskell.
Proceedings of the 10th ACM SIGPLAN International Symposium on Haskell, 2017

2015
Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant.
Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2015

2013
Meta-theory à la carte.
Proceedings of the 40th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2013

Modular monadic meta-theory.
Proceedings of the ACM SIGPLAN International Conference on Functional Programming, 2013

2011
Product lines of theorems.
Proceedings of the 26th Annual ACM SIGPLAN Conference on Object-Oriented Programming, 2011

2009
Fitting the pieces together: a machine-checked model of safe composition.
Proceedings of the 7th joint meeting of the European Software Engineering Conference and the ACM SIGSOFT International Symposium on Foundations of Software Engineering, 2009

A machine-checked model of safe composition.
Proceedings of the 8th Workshop on Foundations of Aspect-Oriented Languages, 2009


  Loading...