Affiliation:
1. Stanford University, Stanford, CA, USA
Abstract
We present a framework for computing context-free language reachability properties when parts of the program are missing. Our framework infers candidate specifications for missing program pieces that are needed for verifying a property of interest, and presents these specifications to a human auditor for validation. We have implemented this framework for a taint analysis of Android apps that relies on specifications for Android library methods. In an extensive experimental study on 179 apps, our tool performs verification with only a small number of queries to a human auditor.
Funder
Air Force Research Laboratory
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Recursive State Machine Guided Graph Folding for Context-Free Language Reachability;Proceedings of the ACM on Programming Languages;2023-06-06
2. Data-driven abductive inference of library specifications;Proceedings of the ACM on Programming Languages;2021-10-20
3. Systemizing Interprocedural Static Analysis of Large-scale Systems Code with Graspan;ACM Transactions on Computer Systems;2021-07
4. Specification synthesis with constrained Horn clauses;Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2021-06-18
5. C2S: translating natural language comments to formal program specifications;Proceedings of the 28th ACM Joint Meeting on European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2020-11-07