Affiliation:
1. Purdue University, USA
Abstract
Programmers often leverage data structure libraries that provide useful and reusable abstractions. Modular verification of programs that make use of these libraries naturally rely on specifications that capture important properties about how the library expects these data structures to be accessed and manipulated. However, these specifications are often missing or incomplete, making it hard for clients to be confident they are using the library safely. When library source code is also unavailable, as is often the case, the challenge to infer meaningful specifications is further exacerbated. In this paper, we present a novel data-driven abductive inference mechanism that infers specifications for library methods sufficient to enable verification of the library's clients. Our technique combines a data-driven learning-based framework to postulate candidate specifications, along with SMT-provided counterexamples to refine these candidates, taking special care to prevent generating specifications that overfit to sampled tests. The resulting specifications form a minimal set of requirements on the behavior of library implementations that ensures safety of a particular client program. Our solution thus provides a new multi-abduction procedure for precise specification inference of data structure libraries guided by client-side verification tasks. Experimental results on a wide range of realistic OCaml data structure programs demonstrate the effectiveness of the approach.
Publisher
Association for Computing Machinery (ACM)
Subject
Safety, Risk, Reliability and Quality,Software
Reference24 articles.
1. Maximal specification synthesis
2. Andrew Appel. 2018. Software Foundations Volume 3: Verified Functional Algorithms. Andrew Appel. 2018. Software Foundations Volume 3: Verified Functional Algorithms.
3. Specification Inference Using Context-Free Language Reachability
4. QuickCheck
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Inference of Robust Reachability Constraints;Proceedings of the ACM on Programming Languages;2024-01-05
2. Synthesizing Specifications;Proceedings of the ACM on Programming Languages;2023-10-16
3. Covering All the Bases: Type-Based Verification of Test Input Generators;Proceedings of the ACM on Programming Languages;2023-06-06
4. Understanding tensions in music accessibility through song signing for and with d/Deaf and Non-d/Deaf persons;Proceedings of the 2023 CHI Conference on Human Factors in Computing Systems;2023-04-19
5. Optimal CHC Solving via Termination Proofs;Proceedings of the ACM on Programming Languages;2023-01-09