An algorithm for automated generation of invariants for loops with conditionals

We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis is performed in order to transform the code into a form for which algebraic and combinatorial techniques can be applied to obtain invariant pr...

Full description

Saved in:
Bibliographic Details
Published in:Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC'05) p. 5 pp.
Main Authors: Kovacs, L.I., Jebelean, T.
Format: Conference Proceeding
Language:English
Published: IEEE 2005
Subjects:
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present an algorithm that generates automatically (algebraic) invariant properties of a loop with conditionals. In the proposed algorithm program analysis is performed in order to transform the code into a form for which algebraic and combinatorial techniques can be applied to obtain invariant properties. These invariants are then used for verifying partial correctness of imperative programs in the Theorema system (www.theorema.org). The application of the method is demonstrated in few examples.
ISBN:0769524532
9780769524535
DOI:10.1109/SYNASC.2005.19