About
Benjamin Delaware is an active Associate Professor in the Department of Computer Science within Purdue University's College of Science. His research focuses on programming languages and formal verification, with significant contributions to relational verification, proof automation, and oblivious computation.
His research interests span Programming Languages, Program Verification, Formal Methods, Relational Verification, and Proof Automation. Delaware develops techniques for verifying program correctness using type systems, automated reasoning, and language-based security approaches. His work bridges theoretical foundations with practical tools for secure and reliable software systems.
Analysis of his recent publications shows strong trends in leveraging large language models for verification tasks (2025), advancing relational verification through E-graphs (2023-2025), and developing type-based approaches for security and privacy (2022-2024). His work consistently addresses fundamental challenges in program equivalence, test generation, and oblivious computation.
- Distinguished Reviewer (PLDI 2023)
Delaware actively serves as committee member and session chair across major programming language conferences (POPL, PLDI, SPLASH). His grant activities focus on NSF-funded research in programming language theory and verification tools. He has mentored students through research papers and conference contributions, though specific advisees aren't listed in the source material.
His work involves collaboration with research groups focused on formal methods and programming language design, particularly in developing verification frameworks like KestRel and Taypsi. Current projects explore LLM-assisted verification and policy-agnostic oblivious computation.
