Verification Environment in Theorema
| Venue: | Articles in Refereed Conference Proceedings 1. N. Popov and |
| Citations: | 4 - 1 self |
BibTeX
@INPROCEEDINGS{Kovács_verificationenvironment,
author = {Laura Ildikó Kovács and Nikolaj Popov and Tudor Jebelean},
title = {Verification Environment in Theorema},
booktitle = {Articles in Refereed Conference Proceedings 1. N. Popov and},
year = {}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract — We present a verification environment for imperative programs (using Hoare logic) and for functional programs (using fixpoint theory) in the frame of the Theorema system (www.theorema.org). In particular, we discuss some methods for finding the invariants of loops and specifications of auxiliary tail recursive functions. These methods use techniques from (polynomial) algebra and combinatorics, namely Groebner bases, variable elimination and symbolic summation (the Gosper algorithm, the technique of generating functions). The methods are demonstrated on several examples which have been treated automatically by our implementation. Index Terms — program analysis and verification, loop invariant generation, theorem proving, symbolic summation I.
