Assertion techniques for dynamic monitoring of linear list data structures

Stephen S. Yau; John L. Ramey

doi:10.1109/CMPSAC.1979.762566

Assertion techniques for dynamic monitoring of linear list data structures

Research output: Contribution to journal › Conference article › peer-review

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 language	English (US)
Article number	762566
Pages (from-to)	606-611
Number of pages	6
Journal	Proceedings - International Computer Software and Applications Conference
DOIs	https://doi.org/10.1109/CMPSAC.1979.762566
State	Published - 1979
Externally published	Yes
Event	3rd IEEE International Computer Software and Applications Conference, COMPSAC 1979 - Chicago, United States Duration: Nov 6 1979 → Nov 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

Access to Document

10.1109/CMPSAC.1979.762566

Cite this

@article{3916495fab31481cba5ec0f7381afc6a,

title = "Assertion techniques for dynamic monitoring of linear list data structures",

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.",

keywords = "Array, Assertion techniques, Dynamic monitoring, Linear-list data structures, Linked-list record allocation, Program behavior, Record traversal scheme, Sequential record allocation",

author = "Yau, {Stephen S.} and Ramey, {John L.}",

note = "Publisher Copyright: {\textcopyright} 1979 IEEE.; 3rd IEEE International Computer Software and Applications Conference, COMPSAC 1979 ; Conference date: 06-11-1979 Through 08-11-1979",

year = "1979",

doi = "10.1109/CMPSAC.1979.762566",

language = "English (US)",

pages = "606--611",

journal = "Proceedings - International Computer Software and Applications Conference",

issn = "0730-3157",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

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

AU - Yau, Stephen S.

AU - Ramey, John L.

PY - 1979

Y1 - 1979

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

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

KW - Array

KW - Assertion techniques

KW - Dynamic monitoring

KW - Linear-list data structures

KW - Linked-list record allocation

KW - Program behavior

KW - Record traversal scheme

KW - Sequential record allocation

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

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

U2 - 10.1109/CMPSAC.1979.762566

DO - 10.1109/CMPSAC.1979.762566

M3 - Conference article

AN - SCOPUS:85067977696

SN - 0730-3157

SP - 606

EP - 611

JO - Proceedings - International Computer Software and Applications Conference

JF - Proceedings - International Computer Software and Applications Conference

M1 - 762566

T2 - 3rd IEEE International Computer Software and Applications Conference, COMPSAC 1979

Y2 - 6 November 1979 through 8 November 1979

ER -

Assertion techniques for dynamic monitoring of linear list data structures

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this