Browse Prior Art Database

Program Function Test Execution Tracking Method

IP.com Disclosure Number: IPCOM000086355D
Original Publication Date: 1976-Aug-01
Included in the Prior Art Database: 2005-Mar-03
Document File: 2 page(s) / 13K

Publishing Venue

IBM

Related People

Shih, S: AUTHOR [+2]

Abstract

In the formalized testing of functions written in APL, as with other programs, it is useful, to confirm which of a set of functions have been exercised and, further, which lines of the functions have been executed during a test session. It may be desirable to obtain actual counts on the number of times each line in each of a set of functions has been executed.

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

Page 1 of 2

Program Function Test Execution Tracking Method

In the formalized testing of functions written in APL, as with other programs, it is useful, to confirm which of a set of functions have been exercised and, further, which lines of the functions have been executed during a test session. It may be desirable to obtain actual counts on the number of times each line in each of a set of functions has been executed.

A method of satisfying the stated need in an automatic way involves the following steps: 1. Create a data structure which will have as each of its elements either; a. An indication that one line of one function has been executed; or b. A count of the number of times one line of one function has been executed. 2. Append to each line of each of the set of functions, the execution of which is to be tracked, a function which will set or update the appropriate element of the data structure defined in 1 above. The appendage must have the following characteristics: 1. It must set or update only the single correct element of the repository data structure. 2. It must not have any effect on the execution of the function to which it has been appended.

One ancillary step is required: The names of the functions, the execution of which is to be tracked, must be associated with subsets of elements of the repository data structure (a subset member for each line of a corresponding function) in such a way that a unique data element can be identified as the repository of data pertaining to each executable line of each of the functions. An exemplary implementation may be as follows:. Let; FNLST be the listed names of the functions to be tracked. FNM be the line counts of the functions included in FNLST...