1 citations · 1 across the 6 of their papers we have counts for
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2026
Verifying the Rust Standard Library
Byron Cook, Remi Delmas, Zyad Hassan +9
Rust's type system prevents many classes of memory errors, yet its standard library relies heavily on unsafe code whose correctness is validated through testing, including dynamic…
cs.LO2023
Completeness Thresholds for Memory Safety: Unbounded Guarantees via Bounded Proofs (Extended Abstract)
Tobias Reinhard, Justus Fasse, Bart Jacobs
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 u…
cs.LO2022★ 1 cited
Completeness Thresholds for Memory Safety of Array Traversing Programs: Early Technical Report
Tobias Reinhard
In this early technical report on an ongoing project, we present -- to the best of our knowledge -- the first study of completeness thresholds for memory safety proofs. Specificall…