Reflexive transitive invariant relations: A basis for computing loop functions

• Autores: Ali Mili, Shir Aharon, Chaitanya Nadkarni, Lamia Labed Jilani, Asma Louhichi, Olfa Mraihi
• Localización: Journal of symbolic computation, ISSN 0747-7171, Vol. 45, Nº 11, 2010, págs. 1114-1143
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.