AoA: Theorem Proving Agent over Abstract Syntax Tree of Redesigned Language
Researchers introduce AoA, a theorem-proving agent that operates directly on abstract syntax trees (AST) of a redesigned proof language, rather than serialized concrete syntax. AoA significantly reduces token consumption and API costs compared to Amazon's Isabelle Agent, achieving 2.3–4.7x lower API cost, 2.9–6.9x fewer tokens, and solving more problems on challenging verification benchmarks.
Why it matters: This approach makes LLM-based interactive theorem proving more efficient and scalable, potentially broadening the practical use of formal verification.
Full story at: arXiv Software Engineering ↗