Papers & talks
How can machines reason rigorously? I approach that question through formal proof: if an AI's output can be checked by a proof assistant, we never have to take it on trust.
§1Theorem-proving agents
LLM agents, benchmarks, and data pipelines for writing machine-checked proofs in Lean, Coq, and Isabelle.
§2Verified code generation
Generating programs together with formal specifications and proofs that they are correct.
§3Neuro-symbolic AI
Pairing LLMs with symbolic structure: programming languages that agents think and act in, and systems that discover mathematics by inventing concepts and judging which ones are interesting.
§4Earlier work
§5Invited talks
- “End-to-End Verified Code Generation in Lean” · Amazon Automated Reasoning Symposium
- “CLEVER: A Benchmark for Two-staged, End-to-end Verified Code Generation” · TPC25, Trillion Parameter Consortium
- “Advancing Theorem Proving with AI: The Power of Large Language Models” · Rutgers, Department of Mathematics