ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES.

Sik-Sang Yau, John L. Ramey

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

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)
Title of host publicationProceedings - IEEE Computer Society's International Computer Software and Applications Conference
PublisherIEEE
Pages606-611
Number of pages6
StatePublished - 1979
Externally publishedYes
EventProc IEEE Comput Soc Int Comput Software Appl Conf 3rd - Chicago, IL, USA
Duration: Nov 6 1979Nov 8 1979

Other

OtherProc IEEE Comput Soc Int Comput Software Appl Conf 3rd
CityChicago, IL, USA
Period11/6/7911/8/79

ASJC Scopus subject areas

  • Software

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

    Yau, S-S., & Ramey, J. L. (1979). ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES. In Proceedings - IEEE Computer Society's International Computer Software and Applications Conference (pp. 606-611). IEEE.