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

Fingerprint

Data structures
Monitoring
High level languages

ASJC Scopus subject areas

  • Software

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.

ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES. / Yau, Sik-Sang; Ramey, John L.

Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, 1979. p. 606-611.

Research output: Chapter in Book/Report/Conference proceedingChapter

Yau, S-S & Ramey, JL 1979, ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES. in Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, pp. 606-611, Proc IEEE Comput Soc Int Comput Software Appl Conf 3rd, Chicago, IL, USA, 11/6/79.
Yau S-S, Ramey JL. ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES. In Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE. 1979. p. 606-611
Yau, Sik-Sang ; Ramey, John L. / ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES. Proceedings - IEEE Computer Society's International Computer Software and Applications Conference. IEEE, 1979. pp. 606-611
@inbook{1e4eb1efeac04da4939798352c69ba2c,
title = "ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES.",
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.",
author = "Sik-Sang Yau and Ramey, {John L.}",
year = "1979",
language = "English (US)",
pages = "606--611",
booktitle = "Proceedings - IEEE Computer Society's International Computer Software and Applications Conference",
publisher = "IEEE",

}

TY - CHAP

T1 - ASSERTION TECHNIQUES FOR DYNAMIC MONITORING OF LINEAR LIST DATA STRUCTURES.

AU - Yau, Sik-Sang

AU - Ramey, John L.

PY - 1979

Y1 - 1979

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

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

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

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

M3 - Chapter

AN - SCOPUS:0018721971

SP - 606

EP - 611

BT - Proceedings - IEEE Computer Society's International Computer Software and Applications Conference

PB - IEEE

ER -