Enchanting Program Specification Synthesis by Large Language Models Using Static Analysis and Program Verification
Top Cited Papers
Open Access
- 25 July 2024
- book chapter
- Published by Springer Nature
- p. 302-328
Abstract
Formal verification provides a rigorous and systematic approach to ensure the correctness and reliability of software systems. Yet, constructing specifications for the full proof relies on domain expertise and non-trivial manpower. In view of such needs, an automated approach for specification synthesis is desired. While existing automated approaches are limited in their versatility,i.e., they either focus only on synthesizing loop invariants for numerical programs, or are tailored for specific types of programs or invariants. Programs involving multiple complicated data types (e.g., arrays, pointers) and code structures (e.g., nested loops, function calls) are often beyond their capabilities. To help bridge this gap, we presentAutoSpec, an automated approach to synthesize specifications for automated program verification. It overcomes the shortcomings of existing work in specification versatility, synthesizing satisfiable and adequate specifications for full proof. It is driven by static analysis and program verification, and is empowered by large language models (LLMs).AutoSpecaddresses the practical challenges in three ways: (1) drivingAutoSpecby static analysis and program verification, LLMs serve as generators to generate candidate specifications, (2) programs are decomposed to direct the attention of LLMs, and (3) candidate specifications are validated in each round to avoid error accumulation during the interaction with LLMs. In this way,AutoSpeccan incrementally and iteratively generate satisfiable and adequate specifications. The evaluation shows its effectiveness and usefulness, as it outperforms existing works by successfully verifying 79% of programs through automatic specification synthesis, a significant improvement of 1.592x. It can also be successfully applied to verify the programs in a real-world X509-parser project.Keywords
All Related Versions
This publication has 53 references indexed in Scilit:
- nl2spec: Interactively Translating Unstructured Natural Language to Temporal Logics with Large Language Models2023
- Progress on Software Verification: SV-COMP 20222022
- Synthesizing Invariant Barrier Certificates via Difference-of-Convex Programming2021
- Nonlinear Craig Interpolant Generation2020
- Maximum Causal Entropy Specification Inference from Demonstrations2020
- Generation of Formal Requirements from Structured Natural LanguageLecture Notes in Computer Science, 2020
- Towards Full Proof Automation in Frama-C Using Auto-active Verification2019
- Deductive Verification of Unmodified Linux Kernel Library Functions2018
- A Case Study on Verification of a Cloud Hypervisor by Proof and Structural TestingLecture Notes in Computer Science, 2014
- Shape Analysis via Second-Order Bi-Abduction2014