Dynamic Monitoring for Linear List Data Structures.

Abstract

In this report, the contributions that dynamic monitoring can make in the area of software maintenance are discussed. New techniques that enable 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 construct, the programmer can explicitly define the record traversal scheme for a linear list data structure implemented with either sequential or linked-list record allocation. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1979
Accession Number
ADA072381

Entities

People

  • John L. Ramey
  • Stephen Sik-Sang Yau

Organizations

  • Northwestern University

Tags

Communities of Interest

  • Energy and Power Technologies
  • Human Systems

DTIC Thesaurus Topics

  • Arrays (Data Structures)
  • Computer Programming
  • Computer Programs
  • Computers
  • High Level Languages
  • Instrumentation
  • Language
  • Life Cycles
  • Lists (Data Structures)
  • Monitors
  • New York
  • Operating Systems
  • Programming Languages
  • Software Development
  • Software Development Tools
  • Specifications

Fields of Study

  • Computer science

Readers

  • Database Systems and Applications
  • Operations Research
  • Theoretical Analysis.