Computer-implemented methods and systems for determining application matching status

Abstract

Computer-implemented systems and methods are provided for determining application matching status. In one implementation, a method is implemented with one or more processors and includes accessing, at a server, a first dependency tree representing a first application and a second dependency tree, and acquiring one or more values for the first dependency tree and one or more values for the second dependency tree. The method also includes comparing the one or more values of the first dependency tree with the one or more values of the second dependency tree. The method further includes determining a matching status between the first application and an application represented by the second dependency tree based on the comparison, and providing, for display, an indication of the matching status.

What is claimed is: 
     
       1. A system comprising:
 a server having one or more processors configured to:
 access a first dependency tree and a second dependency tree, each dependency tree representing a relationship between one or more executable files, one or more library files, and one or more API calls of a respective application; 
 acquire a first hash value representing the entire first dependency tree and a second hash value representing the entire second dependency tree; 
 compare the first hash value of the first dependency tree with the second hash value of the second dependency tree; 
 determine a matching status between the application represented by the first dependency tree and the application represented by the second dependency tree based on the comparison; and 
 generate a report for display to provide an indication of the matching status, with the report indicating that there is a match or no match based on the comparison. 
 
 
     
     
       2. The system of  claim 1 , wherein the application represented by the first dependency tree is associated with a first platform and the application represented by the second dependency tree is compatible with a second platform that is different from the first platform. 
     
     
       3. The system of  claim 1 , wherein the first hash value is generated using a hash function operated on the entire first dependency tree, and the second hash value is generated using a hash function operated on the entire second dependency tree. 
     
     
       4. The system of  claim 1 , wherein each of the application represented by the first dependency tree and the application represented by the second dependency tree is either a new application or a newer version of an existing application. 
     
     
       5. The system of  claim 1 , wherein the determination of the matching status is a match when the first hash value matches the second hash value. 
     
     
       6. A non-transitory computer-readable medium storing a set of instructions that are executable by one or more processors of one or more servers to cause the one or more servers to perform operations comprising:
 access a first dependency tree and a second dependency tree, each dependency tree representing a relationship between one or more executable files, one or more library files, and one or more API calls of a respective application; 
 acquiring, at a server, a first hash value representing the entire first dependency tree and a second hash value representing the entire second dependency tree; 
 comparing the first hash value of the first dependency tree with the second hash value of the second dependency tree; and 
 determining a matching status between the application represented by the first dependency tree and the application represented by the second dependency tree based on the comparison; and 
 generate a report for display to provide an indication of the matching status, with the report indicating that there is a match or no match based on the comparison. 
 
     
     
       7. The non-transitory computer-readable medium of  claim 6 , wherein the application represented by the first dependency tree is associated with a first platform and the application represented by the second dependency tree is compatible with a second platform that is different from the first platform. 
     
     
       8. The non-transitory computer-readable medium of  claim 6 , wherein the first hash value is generated using a hash function operated on the entire first dependency tree, and the second hash value is generated using a hash function operated on the entire second dependency tree. 
     
     
       9. The non-transitory computer-readable medium of  claim 6 , wherein each of the application represented by the first dependency tree and the application represented by the second dependency tree is either a new application or a newer version of an existing application. 
     
     
       10. The non-transitory computer-readable medium of  claim 6 , wherein determining the matching status is a match when the first hash value matches the second hash value. 
     
     
       11. A system comprising:
 a server having one or more processors configured to:
 access, in a database, dependency tree information associated with one or more applications; 
 access a first dependency tree and a second dependency tree, each dependency tree representing a relationship between one or more executable files, one or more library files, and one or more API calls of a respective application; 
 generate, using a first hash function, a first hash value representing the first dependency tree; 
 generate, using a second hash function, a second hash value representing the second dependency tree; 
 compare the first hash value of the first dependency tree with the second hash value of the second dependency tree; 
 determine a matching status between the first application and an application represented by the second dependency tree based on the comparison; and 
 provide, for display, a report to an indication of the matching status, with the report indicating that there is a match or no match based on the comparison. 
 
 
     
     
       12. The system of  claim 11 , wherein the application represented by the first dependency tree is associated with a first platform and the application represented by the second dependency tree is compatible with a second platform that is different from the first platform. 
     
     
       13. The system of  claim 11 , wherein each of the application represented by the first dependency tree and the application represented by the second dependency tree is either a new application or a newer version of an existing application. 
     
     
       14. The system of  claim 11 , wherein the determination of the matching status is a match when the first hash value matches the second hash value.