MODEL FOR REPRESENTING THE CONTROL FLOW AND DATA FLOW OF PROGRAM MODULES.

Sik-Sang Yau, Paul C. Grabow

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

A hierarchical graph model for a program module based on the concept of a recursive graph (RG) is presented. The purpose of the model is to clearly describe the structure of a module implemented in a structured language, such as Pascal, so that the behavior of the module can be easily analyzed and modifications to the module can be clearly specified. Nodes are defined in terms of the statement types in the implementation language. A statement graph is defined for each statement type. Each statement graph is represented as an RG and, equivalently, as a collection of Codd relations. These ideas are illustrated by constructing the control-flow and data-flow representations for an example module in Pascal.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software and Applications Conference
PublisherIEEE
Pages153-160
Number of pages8
StatePublished - 1980
Externally publishedYes
EventProc IEEE Comput Soc Int Comput Software Appl Conf 4th, COMPSAC 80 - Chicago, IL, USA
Duration: Oct 27 1980Oct 31 1980

Other

OtherProc IEEE Comput Soc Int Comput Software Appl Conf 4th, COMPSAC 80
CityChicago, IL, USA
Period10/27/8010/31/80

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'MODEL FOR REPRESENTING THE CONTROL FLOW AND DATA FLOW OF PROGRAM MODULES.'. Together they form a unique fingerprint.

Cite this