Jasper Lee

dblp:48/6954 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
2since 2021 · last 2025
0000-0003-0472-827XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 since 2021Systems, architecture and hardware · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Software engineering, system software, and programming languages
1 paper
Program synthesis and code generation · 50% Requirements engineering and software design · 25% Program verification · 25%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 6 heaviest of 7, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Program synthesis and code generation
code generation with language models
0.912025
CLEVER: A Curated Benchmark for Formally Verified Code Generation · NeurIPS 2025
Program verification
proof assistants
0.912025
CLEVER: A Curated Benchmark for Formally Verified Code Generation · NeurIPS 2025
Requirements engineering and software design › specification
specification generation
0.912025
CLEVER: A Curated Benchmark for Formally Verified Code Generation · NeurIPS 2025
Program synthesis and code generation › formal synthesis
verified code generation
0.912025
CLEVER: A Curated Benchmark for Formally Verified Code Generation · NeurIPS 2025
Automated reasoning and model checking › automated theorem proving
neural theorem proving
0.812024
PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition · NeurIPS 2024
Automated reasoning and model checking
theorem proving
0.812024
PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition · NeurIPS 2024

Methods — techniques the papers use, named apart from their topics

type checking · 0.9large language model · 0.9agentic approaches · 0.9symbolic theorem prover · 0.8neural theorem prover · 0.8
YearPublicationVenuePosition
2025 CLEVER: A Curated Benchmark for Formally Verified Code Generation
abstract
We introduce ${\rm C{\small LEVER}}$, a high-quality, manually curated benchmark of 161 problems for end-to-end verified code generation in Lean. Each problem consists of (1) the task of generating a specification that matches a held-out ground-truth specification, and (2) the task of generating a Lean implementation that provably satisfies this specification. Unlike prior benchmarks,${\rm C{\small LEVER}}$ avoids test-case supervision, LLM-generated annotations, and specifications that leak implementation logic or allow vacuous solutions. All outputs are verified post-hoc using Lean's type checker to ensure machine-checkable correctness. We use ${\rm C{\small LEVER}}$ to evaluate several few-shot and agentic approaches based on state-of-the-art language models. These methods all struggle to achieve full verification, establishing it as a challenging frontier benchmark for program synthesis and formal reasoning. Our benchmark can be found on [GitHub](https://github.com/trishullab/clever) as well as [HuggingFace](https://huggingface.co/datasets/amitayusht/clever). All our evaluation code is also available [online](https://github.com/trishullab/clever-prover).
Amitayush Thakur, Jasper Lee, George Tsoukalas, Meghana Aparna Sistla, Matthew Zhao, Stefan Zetzsche, Greg Durrett, Yisong Yue, Swarat Chaudhuri
NeurIPS2
2024 PutnamBench: Evaluating Neural Theorem-Provers on the Putnam Mathematical Competition
abstract
We present PutnamBench, a new multi-language benchmark for evaluating the ability of neural theorem-provers to solve competition mathematics problems. PutnamBench consists of 1692 hand-constructed formalizations of 640 theorems sourced from the William Lowell Putnam Mathematical Competition, the premier undergraduate-level mathematics competition in North America. All the problems have formalizations in Lean 4 and Isabelle; a substantial subset also has Coq formalizations. PutnamBench requires significant problem-solving ability and proficiency in a broad range of topics taught in undergraduate mathematics courses. We use PutnamBench to evaluate several established neural and symbolic theorem-provers. These approaches can only solve a handful of the PutnamBench problems, establishing the benchmark as a difficult open challenge for research on neural theorem-proving. PutnamBench is available at https://github.com/trishullab/PutnamBench.
George Tsoukalas, Jasper Lee, John Jennings, Jimmy Xin, Michelle Ding, Michael Jennings, Amitayush Thakur, Swarat Chaudhuri
NeurIPS2
2018 Fast Algorithms for Computing Interim Allocations in Single-Parameter Environments
Amy Greenwald, Jasper Lee, Takehiro Oyakawa
PRIMA2
2007 A Computer-Aided Diagnostic System using a Global Data Grid Repository for the Evaluation of Ultrasound Carotid Images
abstract
A computer-aided diagnostic (CAD) method of calculating lumen and wall thickness of carotid vessels is presented. The CAD is able to measure the geometry of the lumen and plaque surfaces in ultrasound carotid images using a least-square fitting of the active contours obtained automatically from the vessels border. To evaluate the approach, ultrasound image sequences from 30 patients were submitted to the procedure. The images were stored on an international data grid repository that consists of three international sites: IPI Laboratory at University of Southern California, USA; Heart Institute at University Sao Paulo, Brazil, and Hong Kong Polytechnic University, Hong Kong. The three chosen sites are connected with high speed international networks including the Internet, and the Brazilian 'National Research and Education Network (RNP2). The Data Grid was used to store, backup, and share the ultrasound images and analysis results, which provided a large-scale and a virtual data system.
Marco A. Gutierrez 0001, Silvia Helena Gelas Lage, Jasper Lee, Zheng Zhou 0002
CCGRID3