An Algorithm for Automated Generation of Invariants for Loops with Conditionals

Authors:
Laura Ildiko Kovacs;Tudor Jebelean
Affiliations:
Johannes Kepler University and Institute e-Austria;Johannes Kepler University and Institute e-Austria
Venue:
SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Year:
2005

Citing 0
Cited 13

Using SMT solvers to verify high-integrity programs

Proceedings of the second workshop on Automated formal methods
Harnessing a Refinement Theory to Compute Loop Functions

Electronic Notes in Theoretical Computer Science (ENTCS)
Mathematics for reasoning about loop functions

Science of Computer Programming
Relational Methods in the Analysis of While Loops: Observations of Versatility

RelMiCS '09/AKA '09 Proceedings of the 11th International Conference on Relational Methods in Computer Science and 6th International Conference on Applications of Kleene Algebra: Relations and Kleene Algebra in Computer Science
Polynomial invariants for linear loops

Cybernetics and Systems Analysis
Reflexive transitive invariant relations: A basis for computing loop functions

Journal of Symbolic Computation
Loop invariant synthesis in a combined domain

ICFEM'10 Proceedings of the 12th international conference on Formal engineering methods and software engineering
Anti-unification algorithms and their applications in program analysis

PSI'09 Proceedings of the 7th international Andrei Ershov Memorial conference on Perspectives of Systems Informatics
Invariant relations: an automated tool to analyze loops

VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
Invariant functions and invariant relations: An alternative to invariant assertions

Journal of Symbolic Computation
Invariant relations, invariant functions, and loop functions

Innovations in Systems and Software Engineering
Loop invariant synthesis in a combined abstract domain

Journal of Symbolic Computation
Verifying while loops with invariant relations

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

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.