Using invariant functions and invariant relations to compute loop functions
Abstract
References
Index Terms
- Using invariant functions and invariant relations to compute loop functions
Recommendations
Invariant functions and invariant relations: An alternative to invariant assertions
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 ...
Invariant relations: an automated tool to analyze loops
VECoS'11: Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication SystemsSince their introduction more than four decades ago, invariant assertions have, justifiably, dominated the analysis of while loops, and have been the focus of sustained research interest in the seventies and eighties, and renewed interest in the last ...
Loop invariant
Encyclopedia of Computer ScienceConsider a loop while B do S, where B is a Boollean expression and S a statement. This form of loop appears in most modern high-level languages. Let P be some true-false statement about the variables of the programm in which the loop appears. P is a ...
Comments
Information & Contributors
Information
Published In
- General Chairs:
- Jeff Kramer,
- Judith Bishop,
- Program Chairs:
- Prem Devanbu,
- Sebastian Uchitel
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
Acceptance Rates
Upcoming Conference
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 165Total Downloads
- Downloads (Last 12 months)1
- Downloads (Last 6 weeks)0
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in