Invariant functions and invariant relations: An alternative to invariant assertions

Authors:
Lamia Labed Jilani;Olfa Mraihi;Asma Louhichi;Wided Ghardallou;Khaled Bsaies;Ali Mili
Affiliations:
Institut Superieur de Gestion, RIADI Lab, Bardo, Tunisia;Institut Superieur de Gestion, Bardo, Tunisia;Faculte des Sciences de Tunis, LIPAH Lab, El Manar, Tunisia;Faculte des Sciences de Tunis, LIPAH Lab, El Manar, Tunisia;Faculte des Sciences de Tunis, LIPAH Lab, El Manar, Tunisia;New Jersey Institute of Technology, Newark, NJ, United States
Venue:
Journal of Symbolic Computation
Year:
2013

Citing 35
Cited 1

A heuristic for deriving loop functions

IEEE Transactions on Software Engineering
Strongest invariant functions: their use in the systematic analysis of while statements

Acta Informatica
The new math of computer programming

Communications of the ACM
An axiomatic basis for computer programming

Communications of the ACM
Predicate abstraction for software verification

POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
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
Houdini, an Annotation Assistant for ESC/Java

FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Symbolic evaluation of programs: a look at loop analysis

SYMSAC '76 Proceedings of the third ACM symposium on Symbolic and algebraic computation
Automatic synthesis of optimal invariant assertions: Mathematical foundations

Proceedings of the 1977 symposium on Artificial intelligence and programming languages
Non-linear loop invariant generation using Gröbner bases

Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
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
Termination proofs for systems code

Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
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
The Daikon system for dynamic detection of likely invariants

Science of Computer Programming
Proving Conditional Termination

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automated Discovery of Loop Invariants for High-Assurance Programs Synthesized Using AI Planning Techniques

HASE '08 Proceedings of the 2008 11th IEEE High Assurance Systems Engineering Symposium
Loop Summarization Using Abstract Transformers

ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
Valigator: A Verification Tool with Bound and Invariant Generation

LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

FASE '09 Proceedings of the 12th International Conference on Fundamental Approaches to Software Engineering: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Control-flow refinement and progress invariants for bound analysis

Proceedings of the 2009 ACM SIGPLAN conference on Programming language design and implementation
The verified software initiative: A manifesto

ACM Computing Surveys (CSUR)
Bottom-Up Shape Analysis

SAS '09 Proceedings of the 16th International Symposium on Static Analysis
Mathematics for reasoning about loop functions

Science of Computer Programming
Finding Loop Invariants for Programs over Arrays Using a Theorem Prover

SYNASC '09 Proceedings of the 2009 11th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing
Computing preconditions and postconditions of while loops

ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Symbolic execution with separation logic

APLAS'05 Proceedings of the Third Asian conference on Programming Languages and Systems
Program verification using automatic generation of invariants

ICTAC'04 Proceedings of the First international conference on Theoretical Aspects of Computing
Interpolation and symbol elimination in vampire

IJCAR'10 Proceedings of the 5th international conference on Automated Reasoning
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
Computing Properties of Numerical Imperative Programs by Symbolic Computation

Fundamenta Informaticae - Half a Century of Inspirational Research: Honoring the Scientific Influence of Antoni Mazurkiewicz

Verifying while loops with invariant relations

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Whereas the analysis of loops in imperative programs is, justifiably, dominated by the concept of invariant assertion, we submit a related but different concept, of invariant relation, and show how it can be used to analyze diverse aspects of a while loop. We also introduce the concept of invariant function, which is used to generate a broad class of invariant relations.