Automating Proofs of Data-Structure Properties in Imperative Programs

Abstract

We consider the problem of automated reasoning about dynamically manipulated data structures. The state-of-the-art methods are limited to the unfold-and-match (U+M) paradigm, where predicates are transformed via (un)folding operations induced from their definitions before being treated as uninterpreted. However, proof obligations from verifying programs… (More)

Topics

11 Figures and Tables

Cite this paper

@article{Chu2014AutomatingPO, title={Automating Proofs of Data-Structure Properties in Imperative Programs}, author={Duc-Hiep Chu and Joxan Jaffar and Minh-Thai Trinh}, journal={CoRR}, year={2014}, volume={abs/1407.6124} }