TY - GEN

T1 - Verified heap theorem prover by paramodulation

AU - Stewart, Gordon

AU - Beringer, Lennart

AU - Appel, Andrew W.

PY - 2012

Y1 - 2012

N2 - We present VeriStar, a verified theorem prover for a decidable subset of separation logic. Together with VeriSmall [3], 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 [4], 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.

AB - We present VeriStar, a verified theorem prover for a decidable subset of separation logic. Together with VeriSmall [3], 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 [4], 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.

KW - paramodulation

KW - separation logic

KW - theorem proving

UR - http://www.scopus.com/inward/record.url?scp=84867503995&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867503995&partnerID=8YFLogxK

U2 - 10.1145/2364527.2364531

DO - 10.1145/2364527.2364531

M3 - Conference contribution

AN - SCOPUS:84867503995

SN - 9781450310543

T3 - Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

SP - 3

EP - 14

BT - ICFP'12 - Proceedings of the 2012 ACM SIGPLAN International Conference on Functional Programming

T2 - 17th ACM SIGPLAN International Conference on Functional Programming, ICFP 2012

Y2 - 9 September 2012 through 15 September 2012

ER -