Harnessing a Refinement Theory to Compute Loop Functions

Document Type

Article

Publication Date

7-28-2009

Abstract

We consider a while loop on some space S and we are interested in deriving the function that this loop defines between its initial states and its final states (when it terminates). Such a capability is useful in a wide range of applications, including reverse engineering, software maintenance, program comprehension, and program verification. In the absence of a general theoretical solution to the problem of deriving the function of a loop, we explore engineering solutions. In this paper we use a relational refinement calculus to approach this complex problem in a systematic manner. Our approach has many drawbacks, some surmountable and some not (being inherent to the approach); nevertheless, it offers a way to automatically derive the function of loops or an approximation thereof, under some conditions. © 2009.

Identifier

67651039696 (Scopus)

Publication Title

Electronic Notes in Theoretical Computer Science

External Full Text Location

https://doi.org/10.1016/j.entcs.2009.07.010

ISSN

15710661

First Page

139

Last Page

155

Volume

243

This document is currently not available here.

Share

COinS