Abstract: A system and method for efficiently walking a directed non-cyclic graph of hierarchical data using multiple analysis tools. The graph walking system comprises: a system for binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; graph walking logic for systematically walking through nodes within the graph, wherein the graph walking logic can be instructed by a first pruning system not to walk a set of sub-nodes of an encountered node; and a second pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until the set of sub-nodes for the encountered node has been walked. The first pruning system will cause the set of sub-nodes not to be walked only if all of the plurality of graph observers have been deactivated.

Abstract: A system, computer program product and method of selecting sectors of a disk on which to perform a virus scan are provided. Initially, all data in all sectors of a disk is scanned for viruses. After the initial scan each sector into which new or modified data is written is recorded. This allows only new or modified data that has been added to the disk since a preceding scan to be scanned for viruses at a succeeding scan.

Abstract: The present invention is directed to a method and system of allowing the user-defined code to be written in such a way as to be independent on the underlying transport yet still send and receive information via transport-specific artifacts. As such, a user may not be required to develop unique code for each different transport. A developer may set user-defined transport-agnostic properties and associated values without concerning an underlying transport. A deployer will provide an external mapping of those user-defined transport-agnostic properties to one or more specific transports which are to be supported. The system may allow new or different transports to be supported by the user-defined code without requiring the developer to change the user-defined code. Only the mapping information decoupled from the user-defined properties may need to be changed for different transports.

Abstract: A system, apparatus and method of providing at least one of a plurality of service providers of a service based on a context in which the service is to be used are provided. When a request, which includes an indication of a context in which the service is to be used, is received to locate the service, it is determined whether there is at least one service provider that is configured to be used specifically in the context in the request. If so, at least one instance of the at least one service provider is returned to the requester. Otherwise, at least one instance of a default service provider is returned, if available.

Abstract: A system and method for efficiently walking a directed non-cyclic graph of data using multiple analysis tools.

Abstract: A system and method for efficiently walking a directed non-cyclic graph of hierarchical data using multiple analysis tools. The graph walking system comprises: a system for binding a plurality of graph observers to a graph, wherein each graph observer is further bound to a set of node patterns and a set of node observers; graph walking logic for systematically walking through nodes within the graph, wherein the graph walking logic can be instructed by a first pruning system not to walk a set of sub-nodes of an encountered node; and a second pruning system that can be instructed by a node observer bound with an associated graph observer to deactivate the associated graph observer until the set of sub-nodes for the encountered node has been walked. The first pruning system will cause the set of sub-nodes not to be walked only if all of the plurality of graph observers have been deactivated.

Abstract: A system and method for efficiently walking a directed non-cyclic graph of data using multiple analysis tools.