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 language | English (US) |
|---|---|
| Title of host publication | Proceedings - IEEE Computer Society's International Computer Software and Applications Conference |
| Publisher | IEEE |
| Pages | 606-611 |
| Number of pages | 6 |
| State | Published - 1979 |
| Externally published | Yes |
| Event | Proc IEEE Comput Soc Int Comput Software Appl Conf 3rd - Chicago, IL, USA Duration: Nov 6 1979 → Nov 8 1979 |
Other
| Other | Proc IEEE Comput Soc Int Comput Software Appl Conf 3rd |
|---|---|
| City | Chicago, IL, USA |
| Period | 11/6/79 → 11/8/79 |
ASJC Scopus subject areas
- Software