Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract)
Logic in Computer Science
2023-09-19 v1
Abstract
Bounded proofs are convenient to use due to the high degree of automation that exhaustive checking affords. However, they fall short of providing the robust assurances offered by unbounded proofs. We sketch how completeness thresholds serve as a bridge, allowing us to derive unbounded guarantees from bounded proofs. Using a bubble sort implementation as example, we demonstrate that a bounded proof only needs to consider a few specific inputs to yield unbounded guarantees.
Cite
@article{arxiv.2309.09731,
title = {Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract)},
author = {Tobias Reinhard and Justus Fasse and Bart Jacobs},
journal= {arXiv preprint arXiv:2309.09731},
year = {2023}
}
Comments
extended abstract, 2 pages, 2 figures