-
公开(公告)号：US20240211784A1
公开(公告)日：2024-06-27
申请号：US17074292
申请日：2020-10-19
Inventor： Colin D. Rosendahl , Temitope Ibukunoluwa Oladipo , Adam Benjamin Nunez , Matthew Joshua Tijerina , Adam Smith , Hugens Ulysse
IPC: G06N7/00 , G06F8/30 , G06F8/41 , G06F9/54 , G06F16/901
CPC classification number: G06N7/005 , G06F8/31 , G06F8/433 , G06F9/547 , G06F16/9024
Abstract: A system for creating a processing graph configured to: (i) create the processing graph to include at least a plurality of nodes and one or more edges, each edge of the one or more edges connects a pair of nodes, each node of the graph represents a component of computation performed by at least one program referenced by that node; (ii) identify a first node of the plurality of nodes within the graph; (iii) access a first node definition of the first node from a nodes database, the first node definition identifies a dependency node, the dependency node represents a component of computation that generates output data used by the first node; (iv) add a second node to the graph as a child of the first node, the second node representing the dependency node; and (v) add a first edge to the graph connecting the first node and second node.
-
公开(公告)号：US11144643B1
公开(公告)日：2021-10-12
申请号：US16830350
申请日：2020-03-26
Inventor： Joseph W. Norton , Michael Gregory Schwarz , Paul David Kimbrel , William Knight Harrod , Matthew Joshua Tijerina , Kevin Knipmeyer
Abstract: A code scanning system has a syntax generation component that receives source code and generates an abstract syntax tree file. The system includes a white list of permitted pure functions, and a black list of prohibited impure functions. In addition, the system includes a static code analyzer for performing static analysis of the source code. The static code analyzer includes a function analyzer that receives the AST file and identifies the functions. Each function is compared to the white list, and if it is present, marked as permitted in a static analysis file. If the function is not on the white list, it is compared to the black list. If it is present on the black list, it is marked as prohibited in the static analysis file. If the function is not on the white or black list, it is marked as “unknown” and subjected to manual analysis.
-
公开(公告)号：US20240119092A1
公开(公告)日：2024-04-11
申请号：US18492243
申请日：2023-10-23
Inventor： Colin D. Rosendahl , Temitope Ibukunoluwa Oladipo , Adam Benjamin Nunez , Matthew Joshua Tijerina , Adam Smith , Hugens Ulysse
IPC: G06F16/901 , G06F9/54
CPC classification number: G06F16/9024 , G06F9/547
Abstract: A computer system for executing a processing graph including: (A) accessing a graph definition of the processing graph from a nodes database, each node of the processing graph representing a component of computation performed by at least one program referenced by that node; (B) constructing the processing graph in the at least one memory device; (C) identifying at least one group of nodes in the processing graph; (D) traversing the at least one group of nodes; (E) upon visiting a node of the at least one group of nodes, accessing a node definition of the node from the nodes database, the node definition identifying a program referenced by the node; (F) executing the program to generate an output; and (G) passing the output to a parent node of the node, the parent node using the output during processing of the parent node.
-
公开(公告)号：US11815943B1
公开(公告)日：2023-11-14
申请号：US17074283
申请日：2020-10-19
Inventor： Colin D. Rosendahl , Temitope Ibukunoluwa Oladipo , Adam Benjamin Nunez , Matthew Joshua Tijerina , Adam Smith , Hugens Ulysse
IPC: G06F16/901 , G06F9/54
CPC classification number: G06F16/9024 , G06F9/547
Abstract: A computer system for executing a processing graph including: (A) access a graph definition of the processing graph from a nodes database, the graph definition identifies nodes and edges, each edge connects a pair of nodes, each node represents a component of computation performed by at least one program referenced by that node; (B) constructing the processing graph in the memory; (C) traversing the processing graph to visit and process each node in the processing graph; (D) upon visiting a first node of the processing graph, accessing a first node definition of the first node from the nodes database, the first node definition identifies a first program; (E) executing the first program to generate a first output; and (F) passing the first output to a parent node of the first node, the parent node uses the first output during processing of the parent node.
-
-
-
Search Results
4
records
(took 0.016 seconds)
