To refer to this page use:
|Abstract:||We present VeriStar, a verified theorem prover for a decidable subset of separation logic. Together with VeriSmall , a proved-sound Smallfoot-style program analysis for C minor, VeriStar demonstrates that fully machine-checked static analyses equipped with efficient theorem provers are now within the reach of formal methods. As a pair, VeriStar and VeriSmall represent the first application of the Verified Software Toolchain , a tightly integrated collection of machine-verified program logics and compilers giving foundational correctness guarantees. VeriStar is (1) purely functional, (2) machine-checked, (3) end-to-end, (4) efficient and (5) modular. By purely functional, we mean it is implemented in Gallina, the pure functional programming language embedded in the Coq theorem prover. By machine-checked, we mean it has a proof in Coq that when the prover says "valid", the checked entailment holds in a proved-sound separation logic for C minor. By end-to-end, we mean that when the static analysis+theorem prover says a C minor program is safe, the program will be compiled to a semantically equivalent assembly program that runs on real hardware. By efficient, we mean that the prover implements a state-of-the-art algorithm for deciding heap entailments and uses highly tuned verified functional data structures. By modular, we mean that VeriStar can be retrofitted to other static analyses as a plug-compatible entailment checker and its soundness proof can easily be ported to other separation logics. © 2012 ACM.|
|Citation:||Stewart, G, Beringer, L, Appel, AW. "Verified heap theorem prover by paramodulation" Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, 3 - 14, doi:10.1145/2364527.2364531|
|Pages:||3 - 14|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of the 17th ACM SIGPLAN International Conference on Functional Programming|
|Version:||This is the author’s final manuscript. All rights reserved to author(s).|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.