Relational methods in the analysis of while loops: Observations of versatility

Document Type

Conference Proceeding

Publication Date

12-1-2009

Abstract

Despite much progress in the design of programming languages, the vast majority of software being written and deployed nowadays remains written in languages where iteration is the main inductive construct, and the main source of algorithmic complexity. For the past four decades, the analysis of iterative constructs has been dominated, not undeservedly, by the concept of invariant assertions. In this paper we submit relation-based alternatives, namely invariant relations and invariant functions, and show how these can provide complementary perspectives, and can enrich the analysis of iterations. Whereas loop invariants can be used to establish the correctness of iterative programs in Hoare logics, invariant relations and invariant functions are used to derive program functions in Mills' logic. In keeping with the conference format, we do not delve too much into theoretical results, and focus instead on the applied aspects of our relation-theoretic approach. © 2009 Springer-Verlag Berlin Heidelberg.

Identifier

70549113667 (Scopus)

ISBN

[364204638X, 9783642046384]

Publication Title

Lecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics

External Full Text Location

https://doi.org/10.1007/978-3-642-04639-1_17

e-ISSN

16113349

ISSN

03029743

First Page

242

Last Page

259

Volume

5827 LNCS

This document is currently not available here.

Share

COinS