Automatic Analysis of the Logical Structure of Programs
| dc.date.accessioned | 2004-10-20T20:08:10Z | |
| dc.date.accessioned | 2018-11-24T10:22:30Z | |
| dc.date.available | 2004-10-20T20:08:10Z | |
| dc.date.available | 2018-11-24T10:22:30Z | |
| dc.date.issued | 1978-12-01 | en_US |
| dc.identifier.uri | http://hdl.handle.net/1721.1/6929 | |
| dc.identifier.uri | http://repository.aust.edu.ng/xmlui/handle/1721.1/6929 | |
| dc.description.abstract | This report presents a method for viewing complex programs as built up out of simpler ones. The central idea is that typical programs are built up in a small number of stereotyped ways. The method is designed to make it easier for an automatic system to work with programs. It focuses on how the primitive operations performed by a program are combined together in order to produce the actions of the program as a whole. It does not address the issue of how complex data structures are built up from simpler ones, nor the relationships between data structures and the operations performed on them. | en_US |
| dc.format.extent | 26249593 bytes | |
| dc.format.extent | 20712639 bytes | |
| dc.language.iso | en_US | |
| dc.title | Automatic Analysis of the Logical Structure of Programs | en_US |
Files in this item
| Files | Size | Format | View |
|---|---|---|---|
| AITR-492.pdf | 20.71Mb | application/pdf | View/ |
| AITR-492.ps | 26.24Mb | application/postscript | View/ |