1. A method of executable computer program inspection, comprising: interrogating simultaneously, with at least one processor, each of a plurality of executable computer program objects stored in a tangible computer readable medium for one or more symbols that are embedded in the objects; identifying dependencies between the symbols based on the presence or absence of the symbols in at least two of the plurality of executable computer program objects; constructing a plurality of component groups, wherein each group of the plurality of component groups include executable computer program objects that share identical symbols, wherein the symbols of each component group are unique to that component group; constructing a directed graph representation of hierarchical relationships between the plurality of component groups based on the identified dependencies between the symbols in the plurality of executable computer program objects, wherein the directed graph includes each component group of the plurality of component groups as a node of the directed graph and a directed edge from a first node of the directed graph to a second node of the directed graph if all the symbols of the component associated with the second node are also present in the component associated with the first node; eliminating a component of the plurality of components that comprises exactly the same symbols as another component of the plurality of components; and storing the hierarchical relationships in a data structure.
1. A method of executable computer program inspection, comprising: interrogating simultaneously, with at least one processor, each of a plurality of executable computer program objects stored in a tangible computer readable medium for one or more symbols that are embedded in the objects; identifying dependencies between the symbols based on the presence or absence of the symbols in at least two of the plurality of executable computer program objects; constructing a plurality of component groups, wherein each group of the plurality of component groups include executable computer program objects that share identical symbols, wherein the symbols of each component group are unique to that component group; constructing a directed graph representation of hierarchical relationships between the plurality of component groups based on the identified dependencies between the symbols in the plurality of executable computer program objects, wherein the directed graph includes each component group of the plurality of component groups as a node of the directed graph and a directed edge from a first node of the directed graph to a second node of the directed graph if all the symbols of the component associated with the second node are also present in the component associated with the first node; eliminating a component of the plurality of components that comprises exactly the same symbols as another component of the plurality of components; and storing the hierarchical relationships in a data structure. 6. The method of claim 1 , comprising: receiving the plurality of executable computer program objects.