A Model for Representing Programs Using Hierarchical Graphs
- 1 November 1981
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. SE-7 (6), 556-574
- https://doi.org/10.1109/tse.1981.226473
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
This publication has 20 references indexed in Scilit:
- Blank design and formability for non-circular deep drawing processes by the finite-element methodJournal of Materials Processing Technology, 1998
- A practical interprocedural data flow analysis algorithmCommunications of the ACM, 1978
- High-level data flow analysisCommunications of the ACM, 1977
- A Requirements Engineering Methodology for Real-Time Processing RequirementsIEEE Transactions on Software Engineering, 1977
- An Extendable Approach to Computer-Aided Software Requirements EngineeringIEEE Transactions on Software Engineering, 1977
- SEQUEL 2: A Unified Approach to Data Definition, Manipulation, and ControlIBM Journal of Research and Development, 1976
- Data Flow Analysis in Software ReliabilityACM Computing Surveys, 1976
- A Simple Algorithm for Global Data Flow Analysis ProblemsSIAM Journal on Computing, 1975
- The programming language pascalActa Informatica, 1971
- A relational model of data for large shared data banksCommunications of the ACM, 1970