Benjamin Delaware
Computer Science · Purdue University West Lafayette
Publications
58
Citations
545
Est. group size
~5
Recurring co-author estimate
Active years
18
Publishing since 2009
Benjamin Delaware works on programming languages and formal verification, focusing on tools that help programmers prove their code is correct or automatically generate test cases and proofs. Much of the work uses proof assistants like Coq to build systems that translate verified specifications into efficient, working programs, including using AI tools like large language models to help automate proofs.
Publication output has grown from a handful of papers per year in 2017-2019 to a steady 6-7 per year from 2022-2025, indicating sustained and slightly increasing activity over the past decade.
Generated by claude-sonnet-5 from public bibliographic data · Jul 20, 2026
- Trace-Guided Synthesis of Effectful Test Generators
arXiv (Cornell University) · 2026
- Trace-Guided Synthesis of Effectful Test Generators
arXiv (Cornell University) · 2026
- Trace-Guided Synthesis of Effectful Test Generators
Proceedings of the ACM on Programming Languages · 2025
- Proof Automation with Large Language Models
2024
- Proof Automation with Large Language Models
arXiv (Cornell University) · 2024
- A Type-Based Approach to Divide-And-Conquer Recursion in Coq
Zenodo (CERN European Organization for Nuclear Research) · 2023
- A Type-Based Approach to Divide-and-Conquer Recursion in Coq
Proceedings of the ACM on Programming Languages · 2023
- Relational Type Theory (All Proofs)
arXiv (Cornell University) · 2021
- Extensible Extraction of Efficient Imperative Programs with Foreign Functions, Manually Managed Memory, and Proofs
Lecture notes in computer science · 2020
- Narcissus: Deriving Correct-By-Construction Decoders and Encoders from Binary Formats
arXiv (Cornell University) · 2018
- The End of History? Using a Proof Assistant to Replace Language Design with Library Design
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2017
- Using Coq to write fast and correct Haskell
2017
- Using Coq to write fast and correct Haskell
ACM SIGPLAN Notices · 2017
- arXiv (Cornell University)×17
- Proceedings of the ACM on Programming Languages×12
- Zenodo (CERN European Organization for Nuclear Research)×6
- Lecture notes in computer science×2
- Artifact Digital Object Group×2
- Xiaokang Qiu
Computer Science · Purdue University West Lafayette
- Songlin Jia
Computer Science · Purdue University West Lafayette
- Sam Tobin-Hochstadt
Computer Science · Indiana University
- Jeremy G. Siek
Computer Science · Indiana University
- Julia Belyakova
Computer Science · Purdue University West Lafayette
This profile was generated automatically from public scholarly data (OpenAlex). Group size and activity levels are estimates derived from co-authorship patterns.
Last updated Jul 20, 2026.
Claim or correct this profile