How does one prove that a computational theorem prover is correct?

95 Views Asked by At

There are many computational theorem provers, such as Z3 (http://z3.codeplex.com/). Such provers employ many thousands of lines of code. How can one prove that the results are correct and can be trusted?