Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2510.06296

Help | Advanced Search

Computer Science > Programming Languages

arXiv:2510.06296 (cs)
[Submitted on 7 Oct 2025 ]

Title: VeriEquivBench: An Equivalence Score for Ground-Truth-Free Evaluation of Formally Verifiable Code

Title: VeriEquivBench:一种用于无真实值评估形式可验证代码的等价分数

Authors:Lingfei Zeng, Fengdi Che, Xuhan Huang, Fei Ye, Xu Xu, Binhang Yuan, Jie Fu
Abstract: Formal verification is the next frontier for ensuring the correctness of code generated by Large Language Models (LLMs). While methods that co-generate code and formal specifications in formal languages, like Dafny, can, in principle, prove alignment with user intent, progress is bottlenecked by specification quality evaluation. Current benchmarks rely on matching against ground-truth specifications, a manual and expertise-intensive process that has limited existing datasets to a few hundred simple problems and also suffers from a reliability issue. To address this, we introduce VeriEquivBench, a new benchmark with $2,389$ complex algorithmic problems that probe the limitations of current models in both code generation and formal reasoning. Our evaluation framework replaces ground-truth matching with a formally grounded metric, the equivalence score, and rigorously verifies the quality of generated specifications and code. Our results show that generating formally verifiable code remains a profound challenge for state-of-the-art LLMs. This underscores both the difficulty of the task and the need for benchmarks like VeriEquivBench to drive progress toward scalable and reliable coding agents.
Abstract: 形式化验证是确保由大型语言模型(LLMs)生成的代码正确性的下一个前沿领域。 虽然在形式语言中共同生成代码和形式规范的方法,如Dafny,原则上可以证明与用户意图的一致性,但进展受到规范质量评估的瓶颈限制。 当前的基准测试依赖于与真实规范的匹配,这是一个手动且需要专业知识的过程,使得现有数据集仅限于几百个简单问题,并且也存在可靠性问题。 为了解决这个问题,我们引入了VeriEquivBench,一个新的基准测试,包含$2,389$个复杂的算法问题,用于探测当前模型在代码生成和形式推理方面的局限性。 我们的评估框架用一个形式基础的度量标准——等价分数,取代了真实规范匹配,并严格验证了生成的规范和代码的质量。 我们的结果表明,生成可形式化验证的代码仍然是最先进的LLMs面临的重大挑战。 这突显了任务的难度以及需要类似VeriEquivBench的基准测试来推动可扩展和可靠的编码代理的发展。
Subjects: Programming Languages (cs.PL) ; Artificial Intelligence (cs.AI)
Cite as: arXiv:2510.06296 [cs.PL]
  (or arXiv:2510.06296v1 [cs.PL] for this version)
  https://doi.org/10.48550/arXiv.2510.06296
arXiv-issued DOI via DataCite

Submission history

From: Lingfei Zeng [view email]
[v1] Tue, 7 Oct 2025 13:19:05 UTC (4,676 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • TeX Source
view license
Current browse context:
cs
< prev   |   next >
new | recent | 2025-10
Change to browse by:
cs.AI
cs.PL

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号