@inproceedings{b23f3ecfe70a411eb70dc7d054215c71,
title = "VeriSmall: Verified smallfoot shape analysis",
abstract = "We have implemented a version of the Smallfoot shape analyzer, calling upon a paramodulation-based heap theorem prover. Our implementation is done in Coq and is extractable to an efficient ML program. The program is verified correct in Coq with respect to our Separation Logic for C minor; this in turn is proved correct in Coq w.r.t. Leroy's operational semantics for C minor. Thus when our VeriSmall static analyzer claims some shape property of a program, an end-to-end machine-checked proof guarantees that the assembly language of the compiled program will actually have that property.",
author = "Appel, {Andrew W.}",
year = "2011",
doi = "10.1007/978-3-642-25379-9_18",
language = "English (US)",
isbn = "9783642253782",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "231--246",
booktitle = "Certified Programs and Proofs - First International Conference, CPP 2011, Proceedings",
note = "1st International Conference on Certified Programs and Proofs, CPP 2011 ; Conference date: 07-12-2011 Through 09-12-2011",
}