Reasoning About Invariant Properties of Object-oriented Programs-dynamic frames: Proof files

Footprint Logic for Object-Oriented Components

“…In this section we discuss a proof of the push operation on our stack-like data structure using the approach of dynamic frames [12] as it is implemented in the KeY tool [16]. The KeY proof of our case study can be found in the artifact [4] accompanying this paper, which includes user-defined taclets (describing inference rules in the KeY system) that we used to define the reachability predicate. Also, a video recording [3] shows the steps for reproducing the proof of invariance of reachability over the push method using KeY.…”

“…separation logic suitable for Java [9], and tools for verifying (Java) programs using separation logic such as VeriFast [11] and VerCors [5]. For example, VerCors can be used to prove the correctness of a (concurrent wait-free) push explicitly using permissions 4 . However, for the purposes of this case study we keep the discussion on a more abstract level to focus on the basic ideas underlying separation logic which allows for a better comparison with our footprints approach.…”