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.
Original language | English (US) |
---|---|
Pages (from-to) | 1-36 |
Number of pages | 36 |
Journal | Journal of Symbolic Computation |
Volume | 48 |
DOIs | |
State | Published - Jan 2013 |
All Science Journal Classification (ASJC) codes
- Algebra and Number Theory
- Computational Mathematics
Keywords
- Invariant assertions
- Invariant functions
- Invariant generation
- Invariant relations
- Loop functions
- Reasoning about loops
- While loops