Finding Polynomial Invariants for Imperative Loops in the Theorema System

@inproceedings{Kovcs2006FindingPI,
  title={Finding Polynomial Invariants for Imperative Loops in the Theorema System},
  author={Laura Ildik{\'o} Kov{\'a}cs and Tudor Jebelean},
  year={2006}
}
We present an algorithm for finding valid polynomial relations (i. e. invariants) among program variables for imperative loops. The algorithm is implemented in the verification environment for imperative programs (using Hoare logic) in the frame of the Theorema system (www.theorema.org). We use techniques from (polynomial) algebra and combinatorics, namely Gröbner Bases, variable elimination, algebraic dependencies and symbolic summation (the Gosper algorithm, handling geometric series, C… CONTINUE READING
Highly Cited
This paper has 21 citations. REVIEW CITATIONS
14 Citations
25 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 25 references

Theorema: Towards Systematic Mathematical Theory Exploration

  • B.Buchberger, A.Craciun, +7 authors M.Rosenkranz
  • Journal of Applied Logic, Special Issue on…
  • 2005
Highly Influential
4 Excerpts

Algorithms for Nonlinear Higher Order Difference Equations

  • M. Kauers
  • PhD thesis, RISC-Linz, Johannes Kepler University…
  • 2005
Highly Influential
4 Excerpts

Using Combinatorial and Algebraic Techniques for Automatic Generation of Loop Invariants

  • L. Kovacs
  • Technical Report 05-16, RISC-Linz, Austria,
  • 2005
2 Excerpts

Nonlinear Loop Invariant Generation using Groebner Bases

  • S. Sankaranaryanan, B. S. Henry, Z. Manna
  • In Proc. of POPL’04, Italy,
  • 2004
2 Excerpts

Similar Papers

Loading similar papers…