SA-Pass (*Semantic Alignment Pass*), which tests formal statements using auxiliary statements called shadows that characterize the intended statement, is proposed, which achieves binary agreement with expert judgments.
Abstract
Autoformalization translates informal mathematical theorems into code for proof assistants such as Lean. A central challenge is that current evaluation metrics can accept type-correct but misaligned statements or reject correct statements written in a different formulation. Inspired by Pass@$k$, we propose SA-Pass (*Semantic Alignment Pass*), which tests formal statements using auxiliary statements called *shadows* that characterize the intended statement. A generated statement receives full credit only when it compiles, implies each shadow (forward check), and is implied by their conjunction (backward check). We instantiate SA-Pass in ShadowBench, a Lean 4 full autoformalization benchmark of 178 postgraduate- to research-level problems spanning eight mathematical areas. Claude Code (Opus 4.8) with Numina-Lean-Agent reaches $61.8\%$ compile rate and $11.2\%$ SA-Pass. Across outputs generated by six agentic configurations, SA-Pass achieves $98.8\%$ binary agreement with expert judgments. An early version of ShadowBench served as the benchmark for Track 4 of the ICML 2026 AI4Math Challenge.
Verifying large C codebases requires translating them into formally checkable semantics, but most autoformalization work reports a single aggregate success rate that conflates two different failure modes: code the translator declined to handle and code the translator translated incorrectly. We present a deterministic c...
SOVER, an LLM-assisted SMT framework that separates semantic mapping from formal certification, is introduced, and Z3 checks domain cross-feasibility and global objective-order preservation for mixed-integer linear formulations, while dReal provides tolerance-aware feasibility/range and $\epsilon$-argmin checks for con...
MathForm is introduced, an autoformalization framework for constructing verified training data through Mathlib knowledge retrieval and verification-guided iterative refinement, and outperforming multiple specialized 32B autoformalizers.
Lushi Pu, Weiming Zhang, Xinheng Xie et al.· 0 citations
Agentic AI systems can now produce fluent code, but the core question persists: does the code reflect the user's actual intent? The long-standing gap between informal natural-language requirements and precise program behavior—the intent gap—is magnified by AI-generated code. The path to reliability runs through intent...
Shuvendu K. Lahiri· Proceedings of the 1st Inter...· 0 citations
An automated TCS research framework that generates, formalizes, filters, and proves new claims, and further develops an automated TCS research framework that generates, formalizes, filters, and proves new claims.
Dingzirui Wang, Xuan-Liang Zhang, Keyan Xu et al.· 2 citations
BRIDGE is presented, a structured prompting framework that decomposes verification into three interconnected domains: Code (implementations), Specifications (formal intent), and Theorem State-ments (constructive correctness claims), and elicits domain-specific intermediate reasoning to connect them.
Robert Joseph George, Carson Eisenach, Udaya Ghai et al.· 0 citations