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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE Computer Society's International Computer Software and Applications Conference |
| Publisher | IEEE |
| Pages | 153-160 |
| Number of pages | 8 |
| State | Published - 1980 |
| Externally published | Yes |
| Event | Proc IEEE Comput Soc Int Comput Software Appl Conf 4th, COMPSAC 80 - Chicago, IL, USA Duration: Oct 27 1980 → Oct 31 1980 |
Other
| Other | Proc IEEE Comput Soc Int Comput Software Appl Conf 4th, COMPSAC 80 |
|---|---|
| City | Chicago, IL, USA |
| Period | 10/27/80 → 10/31/80 |
ASJC Scopus subject areas
- Software