Reflexive transitive invariant relations: A basis for computing loop functions

Authors:
Ali Mili;Shir Aharon;Chaitanya Nadkarni;Lamia Labed Jilani;Asma Louhichi;Olfa Mraihi
Affiliations:
New Jersey Institute of Technology, Newark, NJ 07102-1982, USA;New Jersey Institute of Technology, Newark, NJ 07102-1982, USA;New Jersey Institute of Technology, Newark, NJ 07102-1982, USA;Institut Superieur de Gestion, Bardo 2000, Tunisia;Institut Superieur de Gestion, Bardo 2000, Tunisia;Institut Superieur de Gestion, Bardo 2000, Tunisia
Venue:
Journal of Symbolic Computation
Year:
2010

Citing 17
Cited 3

A heuristic for deriving loop functions

IEEE Transactions on Software Engineering
Relational heuristics for the design of deterministic programs

Acta Informatica
Properties of data flow frameworks: a unified model

Acta Informatica
The new math of computer programming

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
The Science of Programming

The Science of Programming
A Discipline of Programming

A Discipline of Programming
Symbolic evaluation of programs: a look at loop analysis

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Non-linear loop invariant generation using Gröbner bases

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Loop Squashing Transformations for Amorphous Slicing

WCRE '04 Proceedings of the 11th Working Conference on Reverse Engineering
An Algorithm for Automated Generation of Invariants for Loops with Conditionals

SYNASC '05 Proceedings of the Seventh International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
A generic annotation inference algorithm for the safety certification of automatically generated code

Proceedings of the 5th international conference on Generative programming and component engineering
Next-Generation Software Engineering: Function Extraction for Computation of Software Behavior

HICSS '07 Proceedings of the 40th Annual Hawaii International Conference on System Sciences
Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz
Program verification using automatic generation of invariants

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Proving loop programs

IEEE Transactions on Software Engineering

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
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 relations, invariant functions, and loop functions

Innovations in Systems and Software Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

Invariant assertions play an important role in the analysis and verification of iterative programs. In this paper, we introduce a related but distinct concept, namely that of invariant relation. While invariant assertions are useful to prove the correctness of a loop with respect to a specification (represented by a precondition/ postcondition pair) in Hoare's logic, invariant relations are useful to derive the function of the loop in Mills' logic.