Dynamic fine-grained dependency analysis for a functional language
US5940619A · kind A · utility
Assignee
Inventors
Key dates
| Filing date | Oct 25, 1996 |
| Grant date | Aug 17, 1999 |
| Priority date | — |
| Expiry date | Oct 25, 2016 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06F9/45508
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
In a computerized method, a computer program is analyzed while the program is interpreted. The program is expressed in a first memory as input values and functions. Some of the input values are complex values which can have a plurality of component values. Each function operates on combinations of the input values and the functions of the program. The program is interpreted in a processor connected to the first memory. The processor is also connected to a second memory to store result values produced during the interpretation. Selected input values, components of the complex values, and functions are named only if the selected values, components, and functions are necessary to produce a selected result value. For each function of the program, the function which is interpreted, the input values on which the function depends, and the result value produced by the function during interpretation, are recorded in the second memory to dynamically perform a precise dependency analysis of the program.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.