  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. 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.
