| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 401224 | Journal of Symbolic Computation | 2013 | 36 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
