US4903199A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method of increasing the speed of test program execution for testing electrical characteristics of integrated circuits
Assignee: Texas Instruments Inc
•
Filing: 1988-04-19
•
Granted: 1990-02-20
•
Expires: 2008-04-19
Abstract
Abstract Disclosed is a method which speeds up interpretive test program code execution and allows rapid changes to the test code. The tester utilized with the present invention uses the interpretive language TPL (Test Program Language) for device test programs. The present invention uses the first execution of a statement in an interpreted environment to build a table of address value pairs corresponding to the values computed by the statement. It then changes the pseudo code of the statement to use a short assembly language routine to write the values in the table fo their appropriate addresses, using the memory mapped features of the test head hardware. This is done by translating each TPL line into pseudo code as it is loaded. The first time a line of code is executed, it builds a table which contains all the values computed and the addresses to which they are written. The next time the statement is executed, the verb pointer points to the turbo software which is executed rather than the TPL statement. Since the test head hardware is memory mapped, no distinction needs to be made between data being saved by the software and data being written to the test head. All error checking and calibration is done by the emulator code the first time the statement is executed and does not need to be repeated thereafter.
Inventors
- 👤 W. Russ Keenan
- 👤 Stephen F. Comen
- 👤 Robert J. Brainard
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-05 19:08
CPC Classifications
G; G01; G01R; G01R31/00; G01R31/28; G01R31/316; G01R31/317; G01R31/3181; G01R31/319; G01R31/31903; G06; G06F; G06F2201/00; G06F2201/865
Claims Analysis
Total Claims: 13
Claim 1
Independent Claim
139 words
A method of increasing the speed of test program execution performed by a computer, the computer being part of a test system having a processor controlled test head and in which the test program executes a single test loop continuously to test a large number of semiconductor devices the test program having one or more program statements, and, the computer performing a first execution of at least some of the program statements of the test program, including the steps of: changing each program statement into a pseudo code; using the first execution of each program statement of the test program in an interpreted environment to build a table of values and addresses for the values computed or used by the statement; and changing the pseudo code of each statement to execute a new routine which uses the computed values.
Claim 2
Independent Claim
139 words
A method of increasing the speed of test program execution performed by a computer, the computer being part of a test system having a processor controlled test head and in which the test program executes a single test loop continuously to test a large number of semiconductor devices the test program having one or more program statements, and, the computer performing a first execution of at least some of the program statements of the test program, including the steps of: changing each program statement into a pseudo code; using the first execution of each program statement of the test program in an interpreted environment to build a table of values and addresses for the values computed or used by the statement; and changing the pseudo code of each statement to execute a new routine which uses the computed values.
Claim 3
Dependent Claim
49 words
The method according to claim 1, wherein the table created on the first execution of the program statement contains a set of address-value pairs corresponding to the values computed by the statement, and the routine used on subsequent executions writes each value of said table to its appropriate address.
Claim 4
Dependent Claim
38 words
The method according to claim 1, wherein the step of using the first execution of each program statement further comprises the step of: placing the addresses of the values computed by the routine into the table of values.
Claim 5
Dependent Claim
50 words
The method according to claim 2, wherein the table of values contains a set of address-value pairs corresponding to all possible values of an array, each address-value pair having a subscript dependent upon its position in the array, and the set of address-value pair selected depending upon its array subscript.
Claim 6
Independent Claim
144 words
A method of increasing the speed of test program execution performed by a computer, the computer being part of a test system having a processor controlled test head and in which the test program executes a single test loop continuously to test a large number of semiconductor devices, the test program having one or more program statements, and, the computer performing a first execution of at least some of the program statements of the test program, including the steps of: changing each program statement into a pseudo code; using the first execution of each program statement of the test program in an interpreted environment to build a table of address-value pairs corresponding to values computed by the statement; and changing the pseudo code of each statement to use a short assembly language routine to write each value in said table to its appropriate address.
Claim 7
Independent Claim
144 words
A method of increasing the speed of test program execution performed by a computer, the computer being part of a test system having a processor controlled test head and in which the test program executes a single test loop continuously to test a large number of semiconductor devices, the test program having one or more program statements, and, the computer performing a first execution of at least some of the program statements of the test program, including the steps of: changing each program statement into a pseudo code; using the first execution of each program statement of the test program in an interpreted environment to build a table of address-value pairs corresponding to values computed by the statement; and changing the pseudo code of each statement to use a short assembly language routine to write each value in said table to its appropriate address.
Claim 8
Dependent Claim
46 words
The method according to claim 5, wherein said test system has a memory map feature, and said test head hardware is memory mapped by the memory map feature and the memory map feature is used to write each value in said table to its appropriate address.
Claim 9
Dependent Claim
42 words
The method of claim 5, wherein the test program has a flow of execution, and, wherein the pseudo code structure of each program statement is structured to allow the pseudo code to be altered at runtime to change the flow of execution.
Claim 10
Dependent Claim
57 words
The method according to claim 5, wherein a plurality of the program statements compute values which do not change from one execution of the statement to the next and compute variables which depend only on the selection of an array element where all possible values of the array can be determined during first execution of the statement.
Claim 11
Dependent Claim
22 words
The method according to claim 5, executing the program loop once for each value that needs to be written by the routine.
Claim 12
Dependent Claim
20 words
The method of claim 5, including the step of error checking and calibration at first execution of a code statement.
Claim 13
Dependent Claim
22 words
The method according to claim 5, wherein only three instructions are executed per value computed plus a fixed number of overheated statements.
References Cited (Backward Citations)
US4339819A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1993-02-19 | 1993-08-21 | 1994-02-20 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 1997-02-19 | 1997-08-21 | 1998-02-20 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2001-02-19 | 2001-08-21 | 2002-02-20 | $7700.00 | Window Closed / Lapsed |