Work

Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract)

Year: 2023

Type: preprint

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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2309.09731

Authors: Reinhard, Tobias, Fasse, Justus, Jacobs, Bart

Institution: KU Leuven

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4386875912

Cites:

Cited by:

Related to: 10