LoopInvGen: A Loop Invariant Generator based on Precondition Inference
원문 초록
We describe the LoopInvGen tool for generating loop invariants that can provably guarantee correctness of a program with respect to a given specification. LoopInvGen is an efficient implementation of the inference technique originally proposed in our earlier work on PIE (https://doi.org/10.1145/2908080.2908099). In contrast to existing techniques, LoopInvGen is not restricted to a fixed set of features -- atomic predicates that are composed together to build complex loop invariants. Instead, we start with no initial features, and use program synthesis techniques to grow the set on demand. This not only enables a less onerous and more expressive approach, but also appears to be significantly faster than the existing tools over the SyGuS-COMP 2018 benchmarks from the INV track.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
CLEVER: A Curated Benchmark for Formally Verified Code Generation
Transductively Informed Inductive Program Synthesis
PoE-World: Compositional World Modeling with Products of Programmatic Experts
Enhancing Code Generation via Bidirectional Comment-Level Mutual Grounding
Rewriting Pre-Training Data Boosts LLM Performance in Math and Code
OSVBench: Benchmarking LLMs on Specification Generation Tasks for Operating System Verification
토론
이 논문과 연결된 포럼 글이 아직 없습니다.