archives

automatic theorem proving

I've been looking at Coq and automatic theorem proving for a while, although I'm not sure if I completely understand it. From what I can tell, the idea is to create a core set of routines from which a function can be proven correct, given a detailed specification of what it should do. Is this right, or am I completely off track?

By Curtis W at 2006-08-07 21:58 | LtU Forum | 13 comments | other blogs | 11022 reads