Showing cs.SEShow all
3 papers · 1 filter
cs.SE2026
A Learning Method for Symbolic Systems Using Large Language Models
Jian Fang, Yixun Yao, Yingfei Xiong
Automated theorem proving is essential for the formal verification of safety-critical systems. As the corpus of formal proofs grows, a natural paradigm is to learn from existing pr…
cs.SE2026
On Reasoning-Centric LLM-based Automated Theorem Proving
Yican Sun, Chengwei Shi, Hangzhou Lyu +1
Automated theorem proving is fundamental to formal methods, and the recent trend is to integrate large language models (LLMs) and proof assistants to form effective proof agents. W…
cs.SE2025
HoarePrompt: Structural Reasoning About Program Correctness in Natural Language
Dimitrios Stamatios Bouras, Yihan Dai, Tairan Wang +2
While software requirements are often expressed in natural language, verifying the correctness of a program against such requirements is a hard and underexplored problem. Large lan…