Download A Knowledge-Based Approach to Program Understanding by Salwa K. Abd-El-Hafiz PDF

By Salwa K. Abd-El-Hafiz

Program figuring out performs an enormous position in approximately all software program similar initiatives. it's important to the advance, upkeep and reuse actions. application knowing is quintessential for making improvements to the standard of software program improvement. a number of improvement actions similar to code stories, debugging and a few trying out methods require programmers to learn and comprehend courses. upkeep actions can't be played and not using a deep and proper realizing of the section of be maintained. software realizing is essential to the reuse of code elements simply because they can't be applied with out a transparent figuring out of what they do. If a candidate reusable part should be transformed, an knowing the way it is designed can be required. of This monograph provides a· knowledge-based method of the automation of software figuring out. This technique generates rigorous application documentation automatically via combining and construction on strengths of a realistic software decomposition strategy, the axiomatic correctness notation, and the data­ dependent research methods. extra particularly, this method files courses through producing first order predicate common sense annotations in their loops. during this method, loops are labeled in keeping with their complexity degrees. in response to this taxonomy, adaptations at the uncomplicated research technique that top healthy all of the diverse sessions are defined. in most cases, mechanical annotation of loops is played via first decomposing them utilizing information circulation research. This decomposition encapsulates interdependent statements in occasions, which might be analyzed individually.

Show description

Read Online or Download A Knowledge-Based Approach to Program Understanding PDF

Best international books

International Handbook of Mathematics Education: Part 1

ALAN J. BISHOP Monash collage, Clayton, Victoria, Australia purpose arithmetic schooling is turning into a well-documented box with many books, journals and overseas meetings concentrating on a number of elements in relation to idea, learn and perform. That documentation additionally displays the truth that the sector has accelerated greatly within the final two decades.

The International Payments and Monetary System in the Integration of the Socialist Countries

Monetary cooperation among the CMEA nations is applied in line with the financial and monetary rules labored out jointly. The rules hide the organizational constitution of overseas settlements; the alternative of foreign money for settlements; the foundations of overseas credits transactions ; the selection ofthe trade expense of the foreign money utilized in overseas settlements to nationwide currencies and to convertible currencies outdoors the CMEA; the foundations and ideas ofinternational trade and transfers; mIes for the forex allotments of voters (roles of overseas transfers for citizens).

Unconventional Computation: 6th International Conference, UC 2007, Kingston, Canada, August 13-17, 2007. Proceedings

There's a global past Turing, as increasingly more computing device researchers are demonstrating, yet the place may you discover out concerning the present cutting edge in unconventional computation? right here, during this interesting paintings that's the refereed court cases of the sixth overseas convention on Unconventional Computation, held in Kingston, Canada, in August 2007.

Additional info for A Knowledge-Based Approach to Program Understanding

Example text

If the above invariants use the notation var? to denote the initial value of a variable var, does this notation consistently refer to the value of var before the start of the outermost loop in the nested construct? If not, how can this inconsistency be removed? whil~ Do do begis Location L. SI while R. 1. A nested structure of while loops This chapter describes how to solve these problems. The descriptions of the analysis steps are interspersed with their application on the following selection sorting example.

W'there is a path from node S; to node Sk)' The final required order of each segment is, thus, obtained by making new order := m - old order. Hence, G' represents a unique decomposition of the loop body into segments. Steps 6 and 7 of the algorithm assign unique orders to the segments according to the irreflexive partial ordering relation ' ..... '. 1 provides the algorithm used in performing the loop body decomposition. The conditions of the theorem characterize the cases in which the algorithm does not give accurate results.

A. If some of the variables defined in a segment S; are referenced in a segment Sk, then there is a path (consisting of one edge) from S; to b. Sk. , no path in either direction). Because G' is a directed graph, its paths satisfy the transitive property. Furthermore, the antisymmetric property is satisfied because G ' is acyclic. d. The irreflexive property is satisfied because there is no edge from a node to itself. 6. Assign unique orders to the nodes of the DAG G' as follows [16): a. Set m to 1.

Download PDF sample

Rated 4.96 of 5 – based on 17 votes