A Model for Representing Programs Using Hierarchical Graphs

Stephen S. Yau, Paul C. Grabow

Research output: Contribution to journalArticlepeer-review

14 Scopus citations

Abstract

In this paper a hierarchical graph model for programs based on the concepts of recursive graphs (RG‘s) and Codd relations ispresented. 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 RGrepresentation for the control flow and the data flow with an equivalent relational representation. It also has a relational representation for the objects defined within the program. The various aspects of the model are illustrated using Pascal constructs and a model for an example Pascal program is given.

Original languageEnglish (US)
Pages (from-to)556-574
Number of pages19
JournalIEEE Transactions on Software Engineering
VolumeSE-7
Issue number6
DOIs
StatePublished - Nov 1981
Externally publishedYes

Keywords

  • Codd relations
  • control flow
  • data flow
  • graph grammar
  • hierarchical graphs
  • program analysis
  • program model
  • program modifications
  • program objects
  • recursive graph

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'A Model for Representing Programs Using Hierarchical Graphs'. Together they form a unique fingerprint.

Cite this