Abstract: A method for analyzing software, including defining a plurality of coverage models for testing a non-sequential program responsive to an interleaving of the program, each of the coverage models having a respective coverage level. The plurality of coverage models are then arranged in a hierarchy of increasing coverage level and the program is tested using at least a subset of the coverage models in a sequence according to the hierarchy so as to achieve a predetermined overall level of coverage.

Abstract: An apparatus is provided for performing a method (FIG. 2) for pruning an index of a corpus of text documents, wherein the method includes steps for ranking (50) the postings in the index and pruning (48) from the index the postings below a given level in the ranking. The pruning methods of the invention are lossy, since some document postings are removed from the full index; however, the user cannot differentiate the lossy index from the full index.

Abstract: A method for Automatic Query Refinement, the method including extracting at least one lexical affinity from at least one document in a search result set of documents, the set resulting from the application of a first query to a document search engine, adding the lexical affinity to the first query, thereby forming a new query, and applying the new query to the document search engine, resulting in a new search result set.

Abstract: A method for race detection in parallel software, including performing an execution of software under test (SUT), the SUT having an expected outcome. The method further includes detecting a race condition in the SUT responsive to a first interleaving generated during the execution, replaying the first interleaving to a start-point of the race condition, and imposing a second interleaving at the start-point of the race condition. The method also includes determining a second-execution outcome of the SUT responsive to the second interleaving, and comparing the expected outcome with the second-execution outcome.

Abstract: The present invention allows tests generated by multiple test generators to be merged into a comprehensive test specification, allowing multiple test generators to work together as a single unit, and allowing tests from multiple test generators to be combined to achieve a single defined testing goal.

Abstract: A method, apparatus and article of manufacture for persistent code coverage data collection are provided. Initially, a program for which code coverage data should be collected is identified and divided into code coverage tasks (i.e. basic blocks) and each code coverage task is given a unique name. Coverage points are then inserted into the program source code at the beginning of each coverage task to produce an instrumented program. The instrumented program is then compiled and link-edited with an appropriate library to produce a program executable. A set of test cases to be run for a persistent code coverage data collection purposes is identified next. Then, the code coverage database is created using the identified code coverage tasks and the test cases. The program executable is loaded and run with the set of identified test cases to write coverage point information into an output file.

Abstract: The present invention enables the modeling of plural outcomes resulting from a single stimulus, thereby allowing for automated test generation for non-deterministic software. In accordance with the present invention, a method, system, and computer program product are disclosed for testing software having a non-deterministic outcome. In accordance with the present invention, a set of rules is created, each rule having an associated stimulus, a precondition computation, and a computation procedure to produce the set of all valid outcome states. Each valid outcome state models one of several states that may result from applying the stimulus to any state which satisfies the precondition computation. Using these models, a test generation program is executed against the set of rules to recursively expand each path associated with an outcome state of a rule and outputting a list of valid possible outcomes, then selecting sequences of stimuli in accordance with coverage goals set by the test engineer.

Abstract: A test coverage tool provides output that identifies differences between the actual coverage provided by a test suite run on a program under test and the coverage criteria (e.g., the coverage criteria required by the test/development team management). The output from the test coverage tool is generated in the same language that was used to write the coverage criteria that are input to an automated test generator to create the test cases which form the test suite. As a result, the output from the coverage tool can be input back into the automated test generator to cause the generator to revise the test cases to correct the inadequacies. This allows iterative refinement of the test suite automatically, enabling automated test generation to be more effectively and efficiently used with more complex software and more complex test generation inputs.