A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Lightweight integration of the Ergo theorem prover inside a proof assistant
2007
Proceedings of the second workshop on Automated formal methods - AFM '07
Ergo is a little engine of proof dedicated to program verification. It fully supports quantifiers and directly handles polymorphic sorts. Its core component is CC(X), a new combination scheme for the theory of uninterpreted symbols parameterized by a built-in theory X. In order to make a sound integration in a proof assistant possible, Ergo is capable of generating proof traces for CC(X). Alternatively, Ergo can also be called interactively as a simple oracle without further verification. It is
doi:10.1145/1345169.1345176
fatcat:k6tzizy3lzciho5az7rmka2xu4