IP Library Granted Patent US 8,387,001
Granted Patent B2
US 8,387,001 · App. 12/469,198 · Granted Feb 26, 2013

Method for finding an impact on a computer generated code

Inventors: Renuka Sindhgatta (Bangalore, IN); Rajesh Balakrishnan (Bangalore, IN); Krishnakumar Pooloth (Bangalore, IN)
Assignee: Infosys Technologies Limited
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 8,387,001
App. No.
12/469,198
Granted
Feb 26, 2013
Kind
B2
Abstract

The present invention describes a method and a computer program product for finding an impact of a change on a computer generated code. The method includes the generation of a dependency graph for the computer generated code. The dependency graph includes a plurality of nodes that are connected logically by one or more edges. The method enables an expert to assign nodal weights to the nodes, based on their importance. The method also enables the expert to assign edge weights and distribution ratios, based on the criticality of the relationship between the nodes and their distance from the root node. Thereafter, the impact of the change is found by implementing a spreading activation technique on the dependency graph. The output gathered after the activation represents the impact of the change on the computer generated code.

Claims (31)

1. A method for determining impact of a modification of computer generated code, the method comprising:

a. reading a computer generated code from a computer memory;

b. generating a dependency graph representing the computer generated code that is sought to be modified, the dependency graph comprising a plurality of nodes connected logically by one or more edges, wherein each node represents a method within the computer generated code prior to modification;

c. assigning nodal weights to each of the plurality of nodes, wherein the nodal weights are assigned based on a predefined criteria;

d. assigning edge weights to each of the one or more edges;

e. assigning distribution ratios to each of the one or more edges;

f. representing modification of a method within the computer generated code by activating a first node corresponding to the method in the dependency graph, wherein activation comprises modifying the nodal weight assigned to the first node;

g. propagating impact of activation of the first node in the dependency graph to one or more nodes logically connected to the first node, by calculating and assigning a modified nodal weight to each of the one or more logically connected nodes based on the modified nodal weight assigned to the first node; and

h. determining the impact of modification of the method within the computer generated source code, based on at least one of the modified nodal weights of the one or more logically connected nodes;

wherein the nodal weights, the edge weights and the distribution ratios are assigned by a user, and the modified nodal weight assigned to a logically connected node is calculated according to the formula:

w ′( m i )= w ( m i )+ d ij *w ( e ij )* w ( m j ),

wherein w′ m is the modified nodal weight of a node i, w(m i ) is the nodal weight of node i prior to modification, w(m j ) is the modified nodal weight of a logically connected preceding node w(e ij ) is the edge weight of the edge connecting node i and node j, and d ij is the distribution ratio assigned to the edge connecting node i and j.

2. The method according to claim 1 , wherein the nodal weights, the edge weights and the distribution ratios are assigned automatically by applying a heuristic.

3. The method according to claim 1 , wherein the modified nodal weight assigned to a logically connected node is additionally based on edge weights and distribution ratios assigned to edges connecting the first node to the logically connected node.

4. The method according to claim 3 further comprises a user configuring the computer generated code based on the modified nodal weights.

5. The method according to claim 1 , wherein the edge weights are assigned within a first predefined range.

6. The method according to claim 1 , wherein the distribution ratios are assigned within a second predefined range.

7. The method according to claim 1 , wherein the dependency graph is a method dependency graph.

8. A computer program product for determining impact of a modification of computer generated code, the computer program product comprising a non-transitory computer usable medium having computer readable instructions for:

a. generating a dependency graph representing a computer generated code that is sought to be modified, the dependency graph comprising a plurality of nodes connected logically by one or more edges, wherein each node represents a method within the computer generated code prior to modification;

b. assigning nodal weights to each of the plurality of nodes, wherein the nodal weights are assigned based on a predefined criteria;

c. assigning edge weights to each of the one or more edges;

d. assigning distribution ratios to each of the one or more edges;

e. representing modification of a method within the computer generated code by activating a first node corresponding to the method in the dependency graph, wherein activation comprises modifying the modal weight assigned to the first node;

f. propagating impact of activation of the first node in the dependency graph to one or more nodes logically connected to the first node, by calculating and assigning a modified nodal weight to each of the one or more logically connected nodes based on the modified nodal weight assigned to the first node; and

g. determining the impact of modification of the method within the computer generated source code, based on at least one of the modified nodal weights of the one or more logically connected nodes;

wherein the nodal weights, the edge weights and the distribution ratios are assigned by a user, and the modified nodal weight assigned to a logically connected node is calculated according to the formula:

w′ ( m i )= w ( m i )+ d ij *w ( e ij )* w ( m j ),

wherein w′(m i ) is the modified nodal weight of a node i, w(m j ) is the nodal weight of node i prior to modification w(m i ) is the modified nodal weight of a logically connected receding node w(e ij ) is the edge weight of the edge connecting node i and node j, and d ij is the distribution ratio assigned to the edge connecting node i and j.

9. The computer program product according to claim 8 , further having computer readable instructions for automatically assigning the nodal weights, the edge weights and the distribution ratios.

10. The computer program product according to claim 8 , further comprising computer readable instructions for configuring the computer generated code based on the modified nodal weights.

Assignments (2)
CHANGE OF NAME Recorded Mar 22, 2013
From: INFOSYS TECHNOLOGIES LIMITED
To: INFOSYS LIMITED
Reel/Frame 030069/0879 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 4, 2010
From: SINDHGATTA, RENUKA; BALAKRISHNAN, RAJESH; POOLOTH, KRISHNAKUMAR
To: INFOSYS TECHNOLOGIES LIMITED
Reel/Frame 023726/0097 →
Continuity (1)
Related Publication 20100100867A1 · Apr 22, 2010