# US 2019/0171425 A1 · Method and system to provide a generalized framework for dynamic creation of module analytic applications

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

- Number: US 2019/0171425 A1
- Document ID: US20190171425A1
- Status: Published application
- Kind: A1
- Application number: 15/892,940
- Filed: 2018-02-09
- Published: 2019-06-06
- Earliest claimed: 2017-12-04
- Assignees: Booz Allen Hamilton Inc.
- Applicants: Booz Allen Hamilton Inc.
- Inventors: James DEMPSEY
- Web page: https://patentgrep.com/patent/US20190171425A1

## CPC

- G06F 8/30: Creation or generation of source code
- G06F 8/433: {Dependency analysis; Data or control flow analysis}
- G06F 8/36: Software reuse
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A method and apparatus for generating an application flow logic are disclosed which include performing an initialization process based on storage of at least one software toolbox in a toolbox list of a computer memory device; parsing an application description into a series of module descriptors; creating a module primitive defined in a dictionary as a data string representing a name of a tool in the software toolbox, and a data string for least one of: an input, an output, or a data string; producing a module for each module primitive, an input to each tool being produced as an output of another tool; assembling an application flow logic as a combination of produced modules; and providing access to the application flow logic for execution as a combination of calls to the produced modules stored in the computer memory device.

## Claims

### Claim 1

Method for generating an application flow logic, the method comprising:
performing an initialization process based on storage of at least one software toolbox in a toolbox list of a computer memory device, the software toolbox having tools for performing software functions, and based on receipt of at least one application description by a computer;
parsing the application description into a series of module descriptors;
creating, for each parsed module descriptor, a module primitive defined in a dictionary as a data string representing a name of a tool in the software toolbox, and a data string for least one of: an input, an output, or a data string to describe at least one parameter;
producing a module for each module primitive by accessing an existing tool stored in the computer memory device and by creating at least one list of input and/or output functions for combination with the existing tool, and input to each tool being produced as an output of another tool;
assembling an application flow logic as a combination of produced modules; and
providing access to the application flow logic for execution as a combination of calls to the produced modules stored in the computer memory device.

### Claim 2 (depends on 1)

The method of claim 1, wherein the parsing comprises:
parsing multiple application files to create the application flow logic.

### Claim 3 (depends on 1)

The method of claim 1, wherein the parsing comprises:
reading an application file to obtain data strings for constructing the module primitive.

### Claim 4 (depends on 1)

The method of claim 1, wherein the creating comprises:
creating a module primitive for each of plural parsed modules, wherein each module primitive is defined by a data string representing a name of a toll within the software toolbox, at least one of an input or an output, and at least one parameter.

### Claim 5 (depends on 4)

The method of claim 4, wherein the producing comprises:
accessing a tool in the software toolbox as a memory location of a function; and
creating functions stored in the computer memory device which are accessible by values that correspond to the input and/or output data strings of the function.

### Claim 6 (depends on 1)

The method of claim 1, wherein the assembling comprises:
collecting the modules together into computer executable structure, wherein positions of the modules in the structure denote an order of execution.

### Claim 7 (depends on 1)

The method of claim 1, comprising:
executing each module in an order of execution, whereby the executing includes input functions for the module to retrieve data from the computer memory device, the data being passed to the module's tool; and
returning values for storage in the computer memory device using an output function for that module.

### Claim 8

A system for generating an application flow logic, the system comprising:
a computer and an associated datastore configured for:
performing an initialization process based on storage of at least one software toolbox in a toolbox list of a computer memory device, the software toolbox having tools for performing software functions, or based on receipt of at least one application description by a computer;
parsing the application description into a series of module descriptors;
creating, for each parsed module descriptor, a module primitive defined in a dictionary as a data string representing a name of a tool in the software toolbox, and a data string for least one of: an input, an output, and a data string to describe at least one parameter;
producing a module for each module primitive by accessing an existing tool stored in the computer memory device and by creating at least one list of input and/or output functions for combination with the existing tool, and input to each tool being produced as an output of another tool;
assembling an application flow logic as a combination of produced modules; and
providing access to the application flow logic for execution as a combination of calls to the produced modules stored in the computer memory device.

### Claim 9 (depends on 8)

A system of claim 8, wherein the parsing comprises:
reading an application file to obtain data strings for constructing the module primitive.

### Claim 10 (depends on 8)

A system of claim 8, wherein the parsing comprises:
creating a module primitive for each of plural parsed modules, wherein each module primitive is defined by a data string representing a name of a toll within the software toolbox, at least one of an input or an output, and at least one parameter.

### Claim 11 (depends on 8)

A system of claim 8, wherein the parsing comprises:
accessing a tool in the software toolbox as a memory location of a function; and
creating functions stored in the computer memory device which are accessible by values that correspond to the input and/or output data strings of the function.

### Claim 12 (depends on 8)

A system of claim 8, wherein the parsing comprises:
collecting the modules together into computer executable structure, wherein positions of the modules in the structure denote an order of execution.
