Journal Article10.1109/TSE.1984.5010236
A Heuristic for Deriving Loop Functions
TL;DR: The problem of analyzing an initialized loop and verifying that the program computes some particular function of its inputs is addressed and a heuristic technique for solving these problems is proposed that appears to work well in many commonly occurring cases.
read more
Abstract: The problem of analyzing an initialized loop and verifying that the program computes some particular function of its inputs is addressed. A heuristic technique for solving these problems is proposed that appears to work well in many commonly occurring cases. The use of the technique is illustrated with a number of applications. An attribute of initialized loops is identified that corresponds to the ``effort'' required to apply this method in a deterministic (i.e., guaranteed to succeed) manner. It is explained that in any case, the success of the proposed heuristic relies on the loop exhibiting a ``reasonable'' form of behavior.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Dynamically discovering likely program invariants
Michael D. Ernst,David Notkin +1 more
- 01 Jan 2000
TL;DR: This dissertation shows how invariants can be dynamically detected from program traces that capture variable values at program points of interest and presents techniques for detecting such invariants from traces, assesses their efficacy, and points the way for future research.
Relational heuristics for the design of deterministic programs
TL;DR: This paper formulate some heuristic solutions to relational equations and shows that the design of deterministic programs can be formulated as the resolution of relational equations.
50
A knowledge-based approach to the analysis of loops
TL;DR: A knowledge-based analysis approach that generates first order predicate logic annotations of loops is presented and a consistent and rigorous functional abstraction of the whole loop is synthesized from the specifications of its individual events.
•Book
Software Specification: A Comparison of Formal Methods
J. D. Gannon,Marvin V. Zelkowitz,James M. Purtilo +2 more
- 01 May 1995
TL;DR: The axiomatic approach functional correctness predicate transformers algebraic specifications denotational semantics specification models models are presented.
A method for documenting code components
TL;DR: An analysis approach designed to generate program documentation that satisfies a set of criteria for facilitating the rigorous understanding of code components via documentation is presented and existing notations and approaches with respect to these criteria are evaluated.
12
References
•Book
An axiomatic basis for computer programming
C. A. R. Hoare
- 01 Jan 2002
TL;DR: In this article, the logical foundations of computer programming are explored by using techniques first applied in the study of geometry and later extended to other branches of mathematics, and a formal proof of a simple theorem is displayed.
3.3K
Towards automatic program synthesis.
Zohar Manna,Richard Waldinger +1 more
- 01 Jan 1971
TL;DR: An elementary outline of theorem-proving approach to automatic program synthesis is given, without dwelling on technical details.
223
New Math of Computer Programming
Harlan D. Mills
- 01 Jan 1975
TL;DR: Structured programming has proved to be an important methodology for systematic program design and development and is characterized in terms of the selection and solution of certain elementary equations defined in the algebra of functions.