Automated Generation of Loop Invariants by Recurrence Solving in Theorema (2004)
| Venue: | Proc. of SNASC’04 (Symbolic and Numeric Algorithms for Scientific Computing |
| Citations: | 4 - 2 self |
BibTeX
@INPROCEEDINGS{Kovács04automatedgeneration,
author = {Laura Ildikó Kovács and Tudor Jebelean},
title = {Automated Generation of Loop Invariants by Recurrence Solving in Theorema},
booktitle = {Proc. of SNASC’04 (Symbolic and Numeric Algorithms for Scientific Computing},
year = {2004},
pages = {451--464}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. Most of the properties established during program verification are either invariants or depend crucially on invariants. The effectiveness of automated verification of (imperative) programs is therefore sensitive to the ease with which invariants, even trivial ones, can be automatically deduced. We present a method for invariant generation that relies on combinatorial techniques, namely on recurrence solving and variable elimination. The effectiveness of the method is demonstrated on examples.
