## Verification Condition Generation via Theorem Proving (2006)

### Cached

### Download Links

- [www.cs.utexas.edu]
- [www.cse.ogi.edu]
- [web.cecs.pdx.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2006), Vol. 4246 of LNCS |

Citations: | 13 - 3 self |

### BibTeX

@INPROCEEDINGS{Matthews06verificationcondition,

author = {John Matthews and J Strother Moore and Ip Ray and Daron Vroon},

title = {Verification Condition Generation via Theorem Proving},

booktitle = {Proceedings of the 13th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning (LPAR 2006), Vol. 4246 of LNCS},

year = {2006},

pages = {362--376}

}

### OpenURL

### Abstract

Abstract. We present a method to convert (i) an operational semantics for a given machine language, and (ii) an off-the-shelf theorem prover, into a high assurance verification condition generator (VCG). Given a program annotated with assertions at cutpoints, we show how to use the theorem prover directly on the operational semantics to generate verification conditions analogous to those produced by a custom-built VCG. Thus no separate VCG is necessary, and the theorem prover can be employed both to generate and to discharge the verification conditions. The method handles both partial and total correctness. It is also compositional in that the correctness of a subroutine needs to be proved once, rather than at each call site. The method has been used to verify several machine-level programs using the ACL2 theorem prover. 1