Assertion techniques for dynamic monitoring of linear list data structures

Sik-Sang Yau, John L. Ramey

Research output: Contribution to journalConference article

Abstract

In this paper, some techniques for dynamic 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 in typical high level languages. These examples include various linear-list data structures, and both sequential and linked-list allocation schemes.

Original languageEnglish (US)
Article number762566
Pages (from-to)606-611
Number of pages6
JournalProceedings - International Computer Software and Applications Conference
DOIs
StatePublished - Jan 1 1979
Externally publishedYes
Event3rd IEEE International Computer Software and Applications Conference, COMPSAC 1979 - Chicago, United States
Duration: Nov 6 1979Nov 8 1979

Keywords

  • Array
  • Assertion techniques
  • Dynamic monitoring
  • Linear-list data structures
  • Linked-list record allocation
  • Program behavior
  • Record traversal scheme
  • Sequential record allocation

ASJC Scopus subject areas

  • Software
  • Computer Science Applications

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

  • Cite this