EUVIMEDEUVIMED entdecken
Crossref

Memory-Safety Verification of Open Programs with Angelic Assumptions

Gourav Takhar, Baldip Bijlani, Prantik Chatterjee, Akash Lal, Subhajit Roy

Proceedings of the ACM on Programming Languages · 09.10.2025 · 9 (OOPSLA2) · 1119-1147

DOI: 10.1145/3763090 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the ACM on Programming Languages, online erschienen am 09.10.2025. Verfasst von Gourav Takhar und 4 weiteren Autor:innen. Die Arbeit wurde bisher 4-mal zitiert (Crossref) und nennt 72 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

An open program is one for which the complete source code is not available, which is a reality for real-world program verification. Software verification tools tend to assume the worst about any unconstrained behavior and this can yield an enormous number of spurious warnings for open programs. For any serious verification effort, the engineer must invest time up-front in building a suitable model (or mock) of any missing code, which is time-consuming and error-prone. Inaccuracies in the mocks can lead to incorrect verification results. In this paper, we demonstrate a technique that is capable of distinguishing between false positives and actual bugs from potential memory-safety violations in an open program with high accuracy. Central to the technique is the ability of making angelic assumptions about missing code. To accomplish this, we first mine a set of idiomatic patterns in buffer-manipulating programs using a large language model (LLM). This is complemented by a formal synthesis strategy that performs property-directed reasoning to select, adapt and instantiate these idiomatic patterns into angelic assumptions on the target program. Overall, our system, Seeker, guarantees that a program is deemed correct only if it can be verified under a well-defined set of “trusted” idiomatic patterns. In our experiments over a set of benchmarks curated from popular open-source software, our tool Seeker is able to identify 79% of the false positives with zero false negatives.

Zitieren

APA

Takhar, G., Bijlani, B., Chatterjee, P., Lal, A., & Roy, S. (2025). Memory-Safety Verification of Open Programs with Angelic Assumptions. Proceedings of the ACM on Programming Languages, 9(OOPSLA2), 1119-1147. https://doi.org/10.1145/3763090

Vancouver

Takhar G, Bijlani B, Chatterjee P, Lal A, Roy S. Memory-Safety Verification of Open Programs with Angelic Assumptions. Proceedings of the ACM on Programming Languages. 2025;9(OOPSLA2):1119-1147. doi:10.1145/3763090

BibTeX
@article{Takhar2025,
  author = {Takhar, Gourav and Bijlani, Baldip and Chatterjee, Prantik and Lal, Akash and Roy, Subhajit},
  title = {Memory-Safety Verification of Open Programs with Angelic Assumptions},
  journal = {Proceedings of the ACM on Programming Languages},
  year = {2025},
  volume = {9},
  number = {OOPSLA2},
  pages = {1119--1147},
  doi = {10.1145/3763090}
}
Kostenlos starten →