Patent US5428554A successfully refreshed from Google Patents.
US5428554A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Hierarchical graph analysis method and apparatus
Assignee: International Business Machines Corp
•
Filing: 1992-09-03
•
Granted: 1995-06-27
•
Expires: 2012-09-03
Abstract
Abstract A source computer program is analyzed and transformed into a directed graph file comprising a function list file, listing all functions (nodes) in the directed graph file, and a function call list file, listing all calls between said functions (arcs). A hierarchical graph analysis (HGA) function: calculates a "node reach" for each node--comprising the set of all nodes which may be reached from the node in question; produces a node display threshold value--indicating the maximum node reach to be displayed; and uses the node display threshold value to produce an HGA directed graph--comprising only those nodes to be displayed. Finally, a display function displays the HGA directed graph. Optionally, the node display threshold value may be modified after the display, and a new HGA directed graph produced and displayed.
Inventors
- 👤 Gary M. Laskoski
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 13:19
CPC Classifications
G; G06; G06F; G06F30/00; G06F30/10; G06F30/18; Y; Y10; Y10S; Y10S715/00; Y10S715/961; Y10S715/965; Y10S715/966; Y10S715/967
Claims Analysis
Total Claims: 17
Claim 1
Independent Claim
106 words
A system for displaying structure of a source computer program comprising: a) an output display; b) graph analysis means for analyzing said source computer program, said graph analysis means comprising: i) analysis means for transforming said source computer program into a directed graph file comprising a function list file and a function call list file, said function list file comprising one or more nodes, said function call list file comprising one or more arcs; ii) hierarchical graph analysis (HGA) means for transforming said directed graph file into an HGA directed graph file; iii) display means for displaying said HGA directed graph file on said output display.
Claim 2
Independent Claim
106 words
A system for displaying structure of a source computer program comprising: a) an output display; b) graph analysis means for analyzing said source computer program, said graph analysis means comprising: i) analysis means for transforming said source computer program into a directed graph file comprising a function list file and a function call list file, said function list file comprising one or more nodes, said function call list file comprising one or more arcs; ii) hierarchical graph analysis (HGA) means for transforming said directed graph file into an HGA directed graph file; iii) display means for displaying said HGA directed graph file on said output display.
Claim 3
Dependent Claim
73 words
The system of claim 1 in which said HGA means comprises: a) node reach means for producing a node reach file comprising a node reach value for each of said one or more nodes; b) threshold determination means for producing a node display threshold value for said directed graph file; c) graph transformation means for producing a HGA directed graph corresponding to said directed graph as modified by said node display threshold value.
Claim 4
Dependent Claim
28 words
The system of claim 2 in which said threshold determination means comprises means for soliciting from a user and accepting from said user, said node display threshold value.
Claim 5
Dependent Claim
28 words
The system of claim 2 in which said threshold determination means comprises algorithmic means for calculating said node display threshold value using as input said node reach file.
Claim 6
Independent Claim
94 words
A method for operating a computer system to display a structure of a source computer program, said method comprising the steps of: a) transforming said source computer program into a directed graph file comprising a function list file and a function call list file, said function list file comprising one or more nodes, said function call list file comprising one or more arcs; b) transforming said directed graph file into an hierarchical graph analysis (HGA) directed graph file; and c) displaying said HGA directed graph file on an output display of said computer system.
Claim 7
Independent Claim
94 words
A method for operating a computer system to display a structure of a source computer program, said method comprising the steps of: a) transforming said source computer program into a directed graph file comprising a function list file and a function call list file, said function list file comprising one or more nodes, said function call list file comprising one or more arcs; b) transforming said directed graph file into an hierarchical graph analysis (HGA) directed graph file; and c) displaying said HGA directed graph file on an output display of said computer system.
Claim 8
Dependent Claim
144 words
The method of claim 5 in which said step of transforming said directed graph file into said HGA directed graph file comprises the steps of: a) producing a node reach file comprising one or more node reach values, each of said one or more node reach values being associated with a single one of said one or more nodes in said function list file; b) producing a node display threshold value for said directed graph file; c) producing an HGA directed graph by transforming said directed graph using said node display threshold value, said transforming being accomplished by including one of said one or more nodes in said HGA directed graph only if said one of said one or more nodes has an associated one of said one or more node reach values having a first particular relation to said node display threshold value.
Claim 9
Dependent Claim
17 words
The method of claim 6 in which said first particular relation is "greater than or equal to".
Claim 10
Dependent Claim
34 words
The method of claim 6 in which said step of producing said node display threshold value comprises the step of soliciting from a user and accepting from said user, said node display threshold value.
Claim 11
Dependent Claim
74 words
The method of claim 8 further comprising the steps of soliciting from said user, a new node display threshold value after said step of displaying said HGA directed graph file and, if said user provides said new node display threshold value, using said new node display threshold value to transform said directed graph file into a new HGA directed graph file, and then displaying said new HGA directed graph file on said output display.
Claim 12
Dependent Claim
32 words
The method of claim 6 in which said step of producing said node display threshold value comprises the step of algorithmically computing said node display threshold value from said node reach file.
Claim 13
Dependent Claim
38 words
The method of claim 10 in which said step of algorithmically computing said node display threshold value comprises setting said node display threshold value equal to a mean of all of said one or more node reach values.
Claim 14
Dependent Claim
98 words
The method of claim 6 in which each of said one or more arcs comprises a source node and a target node, and in which said step of producing an HGA directed graph by transforming said directed graph using said node display threshold value further comprises the step of including one of said one or more arcs in said HGA directed graph only if both said source node and said target node comprising said one of said one or more arcs have an associated node reach value having a second particular relation to said node display threshold value.
Claim 15
Dependent Claim
17 words
The method of claim 12 in which said second particular relation is "greater than or equal to".
Claim 16
Dependent Claim
52 words
The system of claim 1, wherein each of said one or more nodes has an associated node reach value and wherein said HGA means uses the associated node reach value of at least one of said one or more nodes in transforming said directed graph file into said HGA directed graph file.
Claim 17
Dependent Claim
53 words
The method of claim 5, wherein each of said one or more nodes has an associated node reach value and wherein said transforming step (b) uses the associated node reach value of at least one of said one or more nodes in transforming said directed graph file into said HGA directed graph file.
References Cited (Backward Citations)
US4613946A
Cited
US4800510A
Cited
US4731606A
Cited
US4852019A
Cited
US5021947A
Cited
US5129046A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1998-06-26 | 1998-12-26 | 1999-06-27 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2002-06-26 | 2002-12-26 | 2003-06-27 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2006-06-26 | 2006-12-26 | 2007-06-27 | $7700.00 | Window Closed / Lapsed |