# US 2008/0288965 A1 · Application search tool for rapid prototyping and development of new applications

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2008/0288965 A1
- Document ID: US20080288965A1
- Status: Published application
- Kind: A1
- Application number: 11/804,030
- Filed: 2007-05-16
- Published: 2008-11-20
- Earliest claimed: 2007-05-16
- Assignees: Accenture Global Services Limited
- Inventors: Mark Grechanik; Katharina Andrea Probst; Kevin Michael Conroy
- Web page: https://patentgrep.com/patent/US20080288965A1

## CPC

- G06F 3/00: Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F 8/36: Software reuse
- G06F 16/3325: {Reformulation based on results of preceding query}
- G06F 16/3338: {Query expansion}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A code search tool greatly reduces time, cost, and other resource expenditures associated with implementing a new application. The tool is a search, navigation and visualization tool that accepts high-level processing concepts as inputs to identify, rank, and return the code of relevant existing applications. A software developer may use the relevant applications to rapidly build prototypes, identify requirements, and develop new applications. The tool provides an efficient way to improve the reuse of application logic to realize the high-level processing concepts, and more efficiently deliver proof of concept.

## Claims

### Claim 1

A product comprising:
a machine readable medium; and
logic stored on the machine readable medium comprising:
interface logic operable to obtain an original search result comprising a first basis application programming interface (API) call identifier arising from an original query;
expanded search logic operable to:
combine the original query with the first basis API call identifier to form an expanded query;
execute an expanded search using the expanded query to obtain an expanded search result comprising a first potentially relevant application identifier of a first potentially relevant application;
relevance ranking logic operable to analyze logic in the first potentially relevant application to determine an application relevance ranking for the first potentially relevant application; and
threshold logic operable to obtain a relevant application list comprising a first relevant application identifier by filtering the first potentially relevant application identifier based on the application relevance ranking and an application relevance threshold.

### Claim 2 (depends on 1)

The product of claim 1, where the interface logic is further operable to display the relevant application list comprising the first relevant application identifier.

### Claim 3 (depends on 2)

The product of claim 2, further comprising:
selection logic operable to detect a selection of the first relevant application identifier; and where the interface logic is further operable to:
display the logic in response to the selection.

### Claim 4 (depends on 1)

The product of claim 1, where the expanded search result further comprises a second basis API call identifier, and where the relevance ranking logic is further operable to:
build an API call graph for the first potentially relevant application comprising:
graph nodes for API calls corresponding to the first and second API call identifiers; and
relationship edges between the nodes.

### Claim 5 (depends on 4)

The product of claim 4, further comprising:
a connectivity weight assigned to at least one of the relationship edges.

### Claim 6 (depends on 5)

The product of claim 5, where the connectivity weight comprises a strong connectivity weight.

### Claim 7 (depends on 5)

The product of claim 5, where the connectivity weight comprises a weak connectivity weight.

### Claim 8 (depends on 4)

The product of claim 4, where the relevance ranking logic is further operable to:
generate a data flow graph and a control flow graph for the first potentially relevant application; and
generate the API call graph from the data flow graph and the control flow graph.

### Claim 9 (depends on 4)

The product of claim 4, where the application relevance ranking is obtained according to:
∑
i
=
1
n

(
n
-
1
)

W
i

L
i
n

(
n
-
1
)
,
where Wi comprise edge weights, Li comprise link values between nodes, and ‘n’ comprises a number of nodes in the API call graph.

### Claim 10 (depends on 1)

The product of claim 1, further comprising basis search logic operable to:
execute the original search using the original query to obtain the original search result.

### Claim 11

A method comprising:
obtaining an original search result comprising a first basis application programming interface (API) call identifier arising from an original query;
combining the original query with the first basis API call identifier to form an expanded query;
executing an expanded search using the expanded query to obtain an expanded search result comprising a first potentially relevant application identifier of a first potentially relevant application;
analyzing logic in the first potentially relevant application to determine an application relevance ranking for the first potentially relevant application; and
obtaining a relevant application list comprising a first relevant application identifier by filtering the first potentially relevant application identifier based on the application relevance ranking and an application relevance threshold.

### Claim 12 (depends on 11)

The method of claim 11, where the expanded search result further comprises a second basis API call identifier, and further comprising:
building an API call graph for the first potentially relevant application comprising graph nodes for API calls corresponding to the first and second API call identifiers and relationship edges between the nodes.

### Claim 13 (depends on 12)

The method of claim 12, further comprising:
assigning a connectivity weight to at least one of the relationship edges.

### Claim 14 (depends on 12)

The method of claim 12, further comprising:
assigning a weak connectivity weight to at least one of the relationship edges.

### Claim 15 (depends on 12)

The method of claim 12, further comprising:
assigning a strong connectivity weight to at least one of the relationship edges.

### Claim 16 (depends on 11)

The method of claim 11, further comprising:
generating a data flow graph and a control flow graph for the first potentially relevant application; and
generating the API call graph from the data flow graph and the control flow graph.

### Claim 17 (depends on 11)

The method of claim 11, where determining the application relevance ranking comprises determining:
∑
i
=
1
n

(
n
-
1
)

W
i

L
i
n

(
n
-
1
)
,
where Wi comprise edge weights, Li comprise link values between nodes, and ‘n’ comprises a number of nodes in the API call graph.

### Claim 18

A product comprising:
a memory; and
interface logic stored in the memory operable to obtain a basis logic identifier arising from an original query;
expanded search logic stored in the memory operable to execute a logic repository search on the basis logic identifier to obtain an expanded search result comprising a first potentially relevant logic identifier of first potentially relevant logic;
ranking logic stored in the memory operable to analyze the first potentially relevant logic to determine a logic relevance ranking for the first potentially relevant logic; and
threshold logic stored in the memory operable to determine a relevant logic list comprising a first relevant logic identifier by filtering the first potentially relevant logic identifier based on the logic relevance ranking and a logic relevance threshold.

### Claim 19 (depends on 28)

The product of claim 28, where the ranking logic is further operable to:
generate a logic call graph comprising nodes and edges that represent logic relationships present in the first potentially relevant logic.

### Claim 20 (depends on 20)

The product of claim 20, where the ranking logic is further operable to:
assign edge weights to the edges; and
determine the logic relevant ranking based on the edge weights.

### Claim 21 (depends on 19)

The product of claim 19, where the nodes represent API calls present in the first potentially relevant logic, including an API call corresponding to the basis logic identifier.
