CounterExample Guided Neural Synthesis
원문 초록
Program synthesis is the generation of a program from a specification. Correct synthesis is difficult, and methods that provide formal guarantees suffer from scalability issues. On the other hand, neural networks are able to generate programs from examples quickly but are unable to guarantee that the program they output actually meets the logical specification. In this work we combine neural networks with formal reasoning: using the latter to convert a logical specification into a sequence of examples that guides the neural network towards a correct solution, and to guarantee that any solution returned satisfies the formal specification. We apply our technique to synthesising loop invariants and compare the performance to existing solvers that use SMT and existing techniques that use neural networks. Our results show that the formal reasoning based guidance improves the performance of the neural network substantially, nearly doubling the number of benchmarks it can solve.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
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
토론
이 논문과 연결된 포럼 글이 아직 없습니다.