2 ms·
> We might turn to theorem proving Question: what typically happens when you attempt to prove a program that is not correct, especially a large program? 1. Yo
by tzs 8y ago
> We might turn to theorem proving
Question: what typically happens when you attempt to prove a program that is not correct, especially a large program?
1. You come to a point where to proceed with the proof you have to show some particular thing, and it is apparent that you cannot show that. The nature of this snag does tell you what to change in the program in order to clear this block. I.e., the proof attempt finds actionable bugs in the program.
2. You come to such a point, but the nature of the snag doesn't tell you anything about why it happened or how to fix it. All you learn is that your techniques are insufficient to resolve the status of this program.
3. You reach a point where you have deduced all that you can deduce and made all the inferences that you can make, but that was not enough to prove the program correct. You haven't hit any particular concrete blocker though. You have simply run out of ideas. Maybe someone else can do better.
Question 2: when you have proven some program correct, how hard is it to adapt or update the proof when new features are added to the program?
If it takes a lot of work up update proofs, they may only be feasible for programs where the proved version can stay in service for a long time.
For programs where a given version can stay in service for a long time, I think we probably should be making more effort to prove them if they are used in areas of importance.
SQLite probably does fall into that category for most of its users and use cases.