Dynamic Monitoring for Linear List Data Structures.
Stephen S. Yau, John L. Ramey · 1979
In this report, the contributions that dynamic monitoring can make in the area of software maintenance are discussed. New techniques that enable monitoring of most array-implemented linear list data structures are presented. The main advantage of these assertion techniques is the ability to construct a loop around a group of simple assertions. With this construct, the programmer can explicitly define the record traversal scheme for a linear list data structure implemented with either sequential or linked-list record allocation. (Author)