Browse Prior Art Database

Read Only Store Coverage Algorithm

IP.com Disclosure Number: IPCOM000080366D
Original Publication Date: 1973-Dec-01
Included in the Prior Art Database: 2005-Feb-27
Document File: 1 page(s) / 11K

Publishing Venue

IBM

Related People

Richardson, EL: AUTHOR [+2]

Abstract

The effectiveness of complex diagnostic program sequences may be assessed by: 1) Constructing a table of possible branch addresses for each possible instruction step of diagnostic program handling; 2) Sorting this branch addressing information in a numerically ordered sequence (e.g., monotonic ascending order) and storing the results as a reference address listing; 3) Processing a given diagnostic program in a representative context, while monitoring and recording the actually taken branch addresses in sorted (e.g., in ascending) order; and 4) Comparing the actually taken branch addresses with the reference listing to determine which possible branches were not taken, and using this information to assess the effectiveness of the diagnostic program.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 100% of the total text.

Page 1 of 1

Read Only Store Coverage Algorithm

The effectiveness of complex diagnostic program sequences may be assessed by:
1) Constructing a table of possible branch addresses for each

possible instruction step of diagnostic program handling;
2) Sorting this branch addressing information in a numerically

ordered sequence (e.g., monotonic ascending order) and storing

the results as a reference address listing;
3) Processing a given diagnostic program in a representative

context, while monitoring and recording the actually taken

branch addresses in sorted (e.g., in ascending) order; and
4) Comparing the actually taken branch addresses with the

reference listing to determine which possible branches were

not taken, and using this information to assess the

effectiveness of the diagnostic program.

1