Completeness Thresholds for Memory Safety: Early Preliminary Report

11/21/2022
by   Tobias Reinhard, et al.
0

In this early preliminary report on an ongoing project, we present – to the best of our knowledge – the first study of completeness thresholds for memory safety proofs. Specifically we consider heap-manipulating programs that iterate over arrays without allocating or freeing memory. We present the first notion of completeness thresholds for program verification which reduce unbounded memory safety proofs to bounded ones. Moreover, we present some preliminary ideas on how completeness thresholds can be computed for concrete programs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/05/2023

Completeness Thresholds for Memory Safety of Array Traversing Programs

We report on intermediate results of – to the best of our knowledge – th...
research
09/18/2023

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

Bounded proofs are convenient to use due to the high degree of automatio...
research
04/12/2021

Predicting the Accuracy of Early-est Earthquake Magnitude Estimates with an LSTM Neural Network: A Preliminary Analysis

This report presents a preliminary analysis of an LSTM neural network de...
research
12/05/2022

Leroy and Blazy were right: their memory model soundness proof is automatable (Extended Version)

Xavier Leroy and Sandrine Blazy in 2007 conducted a formal verification,...
research
10/29/2018

To Memory Safety through Proofs

We present a type system capable of guaranteeing the memory safety of pr...
research
05/15/2021

Delay-Bounded Scheduling Without Delay! (Extended Technical Report)

We consider the broad problem of analyzing safety properties of asynchro...
research
06/23/2023

Quantum Merlin-Arthur and proofs without relative phase

We study a variant of QMA where quantum proofs have no relative phase (i...

Please sign up or login with your details

Forgot password? Click here to reset