Automated verification of memory safety and functional correctness for heap-manipulating programs has been a challenging task, especially when dealing with complex data structures with strong invariants involving both shape and numerical properties. Existing verification systems usually rely on users to supply annotations to guide the verification, which can be cumbersome and error-prone by hand and can significantly restrict the usability of the verification system. In this paper, we reduce the need for some user annotations by automatically inferring loop invariants over an abstract domain with both shape and numerical information. Our loop invariant synthesis is conducted automatically by a fixed-point iteration process, equipped with newly designed abstraction mechanism, together with join and widening operators over the combined domain. We have also proven the soundness and termination of our approach. Initial experiments confirm that we can synthesise loop invariants with non-trivial constraints.
Bibliographical noteAuthor can archive post-print (ie final draft post-refereeing).
Qin, S., He, G., Luo, C., Chin, W-N., & Chen, X. (2013). Loop invariant synthesis in a combined abstract domain. Journal of Symbolic Computation, 50, 386-408. https://doi.org/10.1016/j.jsc.2012.08.007