Assertion techniques for dynamic monitoring of linear list data structures

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

Research output: Contribution to journalArticle

Abstract

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
Volume1
Issue numberC
DOIs
StatePublished - 1979
Externally publishedYes

Fingerprint

Data structures
Monitoring
Computer software maintenance
High level languages
Software engineering

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software

Cite this

Assertion techniques for dynamic monitoring of linear list data structures. / Yau, Sik-Sang; Ramey, John L.; Nicholl, Robin A.

In: The Journal of Systems and Software, Vol. 1, No. C, 1979, p. 319-336.

Research output: Contribution to journalArticle

Yau, Sik-Sang ; Ramey, John L. ; Nicholl, Robin A. / Assertion techniques for dynamic monitoring of linear list data structures. In: The Journal of Systems and Software. 1979 ; Vol. 1, No. C. pp. 319-336.
@article{42a05c588863422288e599c94b4b3ad3,
title = "Assertion techniques for dynamic monitoring of linear list data structures",
abstract = "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.",
author = "Sik-Sang Yau and Ramey, {John L.} and Nicholl, {Robin A.}",
year = "1979",
doi = "10.1016/0164-1212(79)90034-7",
language = "English (US)",
volume = "1",
pages = "319--336",
journal = "Journal of Systems and Software",
issn = "0164-1212",
publisher = "Elsevier Inc.",
number = "C",

}

TY - JOUR

T1 - Assertion techniques for dynamic monitoring of linear list data structures

AU - Yau, Sik-Sang

AU - Ramey, John L.

AU - Nicholl, Robin A.

PY - 1979

Y1 - 1979

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=50849148727&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=50849148727&partnerID=8YFLogxK

U2 - 10.1016/0164-1212(79)90034-7

DO - 10.1016/0164-1212(79)90034-7

M3 - Article

VL - 1

SP - 319

EP - 336

JO - Journal of Systems and Software

JF - Journal of Systems and Software

SN - 0164-1212

IS - C

ER -