A Model for Representing Programs Using Hierarchical Graphs

Author

Yau, Stephen S. ; Grabow, Paul C.

Author_Institution

Department of Electrical Engineering and Computer Science, Northwestern University

Issue

6

fYear

1981

Firstpage

556

Lastpage

574

Abstract

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.

Keywords

Codd relations; control flow; data flow; graph grammar; hierarchical graphs; program analysis; program model; program modifications; program objects; recursive graph; Application software; Contracts; Data analysis; Database systems; Flow graphs; Graphics; Performance analysis; Relational databases; Roentgenium; Software maintenance; Codd relations; control flow; data flow; graph grammar; hierarchical graphs; program analysis; program model; program modifications; program objects; recursive graph;

fLanguage

English

Journal_Title

Software Engineering, IEEE Transactions on

Publisher

ieee

ISSN

0098-5589

Type

jour

DOI

10.1109/TSE.1981.226473

Filename

1702888