Reflexive transitive invariant relations: A basis for computing loop functions

Authors

Ali Mili, New Jersey Institute of Technology
Shir Aharon, New Jersey Institute of Technology
Chaitanya Nadkarni, New Jersey Institute of Technology
Lamia Labed Jilani, Institut Supérieur de Gestion de Tunis
Asma Louhichi, Institut Supérieur de Gestion de Tunis
Olfa Mraihi, Institut Supérieur de Gestion de Tunis

Document Type

Article

Publication Date

11-1-2010

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. © 2009 Elsevier Ltd.

Identifier

77956467988 (Scopus)

Publication Title

Journal of Symbolic Computation

External Full Text Location

https://doi.org/10.1016/j.jsc.2008.11.007

ISSN

07477171

First Page

1114

Last Page

1143

Issue

11

Volume

45

Recommended Citation

Mili, Ali; Aharon, Shir; Nadkarni, Chaitanya; Jilani, Lamia Labed; Louhichi, Asma; and Mraihi, Olfa, "Reflexive transitive invariant relations: A basis for computing loop functions" (2010). Faculty Publications. 6028.
https://digitalcommons.njit.edu/fac_pubs/6028