1. A method of determining whether a binary file includes a call path between two functions: receiving information representing a starting node in a function call graph, the starting node being associated with a starting function; receiving information representing an ending node in a function call graph, the ending node being associated with an ending function; testing a binary file associated with at least one of the starting node and the ending node with a first Bloom filter, said testing including applying the first Bloom filter to the binary file in order to determine whether the binary file includes the starting function and the ending function.