| dc.contributor.author | 
Schach, Stephen R. 
 | 
 | 
| dc.date.accessioned | 
2018-05-23T14:59:40Z | 
 | 
| dc.date.available | 
2018-05-23T14:59:40Z | 
 | 
| dc.date.issued | 
1983 | 
 | 
| dc.identifier.citation | 
Schach, S. R. (1983) Data Structure Traces.  Quaestiones Informaticae Vol 2 No 2 1983 | 
en | 
| dc.identifier.issn | 
0254-2757 | 
 | 
| dc.identifier.uri | 
http://hdl.handle.net/10500/24046 | 
 | 
| dc.description.abstract | 
Three levels of traces for data structures (as opposed to simple variables) are defined. A machine-code core dump
is essentially a low level trace. A high level trace reflects the high level language in which the data structure being
traced has been implemented. A very high level trace displays the data structure in the format in which the programmer
conceptualizes it. Three traces written by the author (a graphical FORTRAN array trace, a portable trace for the
Pascal heap, and a graphical Pascal data structure trace) are described, and the level of each trace is then analyzed. | 
en | 
| dc.language.iso | 
en | 
en | 
| dc.publisher | 
Computer Society of South Africa (on behalf of SAICSIT) | 
en | 
| dc.title | 
Data Structure Traces | 
en | 
| dc.type | 
Article | 
en | 
| dc.description.department | 
School of Computing | 
en |