A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Verification of B $$^+$$ trees by integration of shape analysis and interactive theorem proving
2013
Journal of Software and Systems Modeling
Interactive proofs of correctness of pointermanipulating programs tend to be difficult. We propose an approach that integrates shape analysis and interactive theorem proving, namely TVLA and KIV. The approach uses shape analysis to automatically discharge proof obligations for various data structure properties, such as "acyclicity". To this purpose we define a mapping between typed algebraic heaps and TVLA. We verify the main operations of B + trees by decomposing the problem into three layers:
doi:10.1007/s10270-013-0320-1
fatcat:u3plcztperh43bu5scy2oga7zq