Assertion techniques for dynamic monitoring of linear list data structures

Sik-Sang Yau, John L. Ramey, Robin A. Nicholl

Research output: Contribution to journalArticlepeer-review


In this paper the use of dynamic monitoring in the area of software development is discussed, with particular emphasis on its relation to software maintenance. 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 concept, the programmer can explicitly define the record traversal scheme for a linear list data structure implemented with either sequential or linked-list record allocation. A number of examples are given to illustrate how these techniques may be used with both sequential and linked representations of various linear list data structures in typical high-level languages, such as jovial. Finally, the practicality of the techniques, together with some performance figures and a description of the jovial implementation, are discussed.

Original languageEnglish (US)
Pages (from-to)319-336
Number of pages18
JournalThe Journal of Systems and Software
Issue numberC
StatePublished - 1979
Externally publishedYes

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software


Dive into the research topics of 'Assertion techniques for dynamic monitoring of linear list data structures'. Together they form a unique fingerprint.

Cite this