This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Model for Representing Programs Using Hierarchical Graphs
November 1981 (vol. 7 no. 6)
pp. 556-574
S.S. Yau, Department of Electrical Engineering and Computer Science, Northwestern University
In this paper a hierarchical graph model for programs based on the concepts of recursive graphs (RG's) and Codd relations is presented. The purpose of the model is to clearly represent the structure of a program implemented in a structured language, such as Pascal, Algol, or PL/1, so that the program can be analyzed and modifications to the program can be clearly specified. The model uses an RG representation for the control flow and the data flow with an equivalent relational representation. It also has a relational representation for the objects defmed within the program. The various aspects of the model are illustrated using Pascal constructs and a model for an example Pascal program is given.
Index Terms:
recursive graph, Codd relations, control flow, data flow, graph grammar, hierarchical graphs, program analysis, program model, program modifications, program objects
Citation:
S.S. Yau, P.C. Grabow, "A Model for Representing Programs Using Hierarchical Graphs," IEEE Transactions on Software Engineering, vol. 7, no. 6, pp. 556-574, Nov. 1981, doi:10.1109/TSE.1981.226473
Usage of this product signifies your acceptance of the Terms of Use.