Optimizing Prestate Copies in Runtime Verification of Function Postconditions

Abstract

In behavioural specifications of imperative languages, postconditions may refer to the prestate of the function, usually with an old operator. Therefore, code performing runtime verification has to record prestate values required to evaluate the postconditions, typically by copying part of the memory state, which causes severe verification overhead, both in memory and CPU time. In this paper, we consider the problem of efficiently capturing prestates in the context of Ortac, a runtime assertion checking tool for OCaml. Our contribution is a postcondition transformation that reduces the subset of the prestate to copy. We formalize this transformation, and we provide proof that it is sound and improves the performance of the instrumented programs. We illustrate the benefits of this approach with a maze generator. Our benchmarks show that unoptimized instrumentation is not practicable, while our transformation restores performances similar to the program without any runtime check.

Abstract Interpretation of Recursive Logic Definitions for Efficient Runtime Assertion Checking

“…They also do not deal with logic denitions. Recently, they formally studied how to optimize referring to the pre-state from the post-state of a function [12]. This work is complementary to ours.…”

“…Three dierent widening strategies have been explored in this paper: investigating others strategies is left to future work, as well evaluating other abstract domains. Extending our formalization to rational numbers [13], memory properties [16], multi-state properties [18,12] or how to deal with undened terms such as division by zero [9] is also left to future work. Our formalization eort would also greatly benet from using a proof assistant, such as Coq [4].…”