Snyk Limited

Assaf Hefetz

Guy Podjarny

Shaun Smith

Michael Gokhman

A package dependencies representation and usage thereof. A data structure representing package dependencies in a computer program. The data structure comprising: a set of package instance nodes, each of which representing a different instance of a code package, wherein each package instance node comprising a unique identifier in the set of package instance nodes and a reference to a package record, wherein the package record representing a package, wherein the instance package is an instance of the package; a set of edges connecting package instance nodes of the set of package instance nodes, wherein an edge from a source node to a target node represents a dependency relationship of a package represented by the source node on a package represented by the target node.

Package dependencies representation

Flaws in dependencies of deployed applications are identified. In one embodiment, a list of dependencies used by a deployed application that is deployed on the deployment platform is obtained. Each dependency of the list of dependencies is mapped with a flaws database, wherein the flaws database comprising an indication of known flaws for different dependencies and different versions thereof. Based on such mapping, one or more flaws in the deployed application are determined. The determination is performed externally to the deployment platform and without executing a monitoring process thereon.

Identifying flawed dependencies in deployed applications

A system, product and process for building a package dependencies data structure. The method comprises determining a package instance identifier of the package to be processed. The package instance identifier is determined based on a unique identifier of the package to be processed and based on a unique identifier of a dependency sub-tree of the package to be processed in the package instance identifier. The package instance identifier is utilized to determine if a node representing the package to be processed exists or not. In case the node does not exist already in the data structure, the node is created and added.

Growing community of inventors

Holon, Israel

Assaf Hefetz