Can LLMs Formally Reason as Abstract Interpreters for Program Analysis?
원문 초록
LLMs have demonstrated impressive capabilities in code generation and comprehension, but their potential in being able to perform program analysis in a formal, automatic manner remains under-explored. To that end, we systematically investigate whether LLMs can reason about programs using a program analysis framework called abstract interpretation. We prompt LLMs to follow two different strategies, denoted as Compositional and Fixed Point Equation, to formally reason in the style of abstract interpretation, which has never been done before to the best of our knowledge. We validate our approach using state-of-the-art LLMs on 22 challenging benchmark programs from the Software Verification Competition (SV-COMP) 2019 dataset, widely used in program analysis. Our results show that our strategies are able to elicit abstract interpretation-based reasoning in the tested models, but LLMs are susceptible to logical errors, especially while interpreting complex program structures, as well as general hallucinations. This highlights key areas for improvement in the formal reasoning capabilities of LLMs.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
The Devil behind the mask: An emergent safety vulnerability of Diffusion LLMs
Kodezi Chronos: A Debugging-First Language Model for Repository-Scale, Memory-Driven Code Understanding
Rethinking Verification for LLM Code Generation: From Generation to Testing
EvoAgentX: An Automated Framework for Evolving Agentic Workflows
CoreCodeBench: A Configurable Multi-Scenario Repository-Level Benchmark
Estimating Correctness Without Oracles in LLM-Based Code Generation
토론
이 논문과 연결된 포럼 글이 아직 없습니다.