Abstract
As depicted in Figure 4.1, the analysis of flat loops is performed in a step by step process consisting of four main phases. Descriptions of these phases and their application to the following example are given in the remainder of this chapter [64]. The loop in this example is general with a composite condition. It searches for a course number, course_no, in a course number data base, course_no_db. If the course number is not found, the flag stays false}. If found, the flag is set to true and the location is saved in course_i.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1995 Springer Science+Business Media New York
About this chapter
Cite this chapter
Abd-El-Hafiz, S.K., Basili, V.R. (1995). Analysis of Flat Loops. In: A Knowledge-Based Approach to Program Understanding. The Springer International Series in Engineering and Computer Science, vol 325. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-2279-9_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-2279-9_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5961-6
Online ISBN: 978-1-4615-2279-9
eBook Packages: Springer Book Archive