Automated testing system

• US 5,490,249 A
• Filed: 09/22/1994
• Issued: 02/06/1996
• Est. Priority Date: 12/23/1992
• Status: Expired due to Term

• Current Assignee: Apple Inc.
• Original Assignee: Taligent, Inc. (HP Inc.)
• Inventors: Miller, Christopher M.
• Primary Examiner(s): Beausoliel, Jr., Robert W.
• Assistant Examiner(s): LE, DIEU MINH T
• Application Number:
  US08/310,455
• Time in Patent Office: 502 Days
• Field of Search: 395/575, 395/600, 395/500, 395/650, 395/700, 395/183.14, 395/183.15, 395/183.02, 364/222.81, 364/282.1, 364/221.7, 364/243.3, 364/266, 364/265, 364/267, 364/274.1, 364/274.2, 371/19, 371/16.5, 371/15.1
• US Class Current: 714/38.14
• CPC Class Codes: G06F 11/3684 for test design, e.g. generating new test cases
• CPC Class Codes: G06F 11/3688 for test execution, e.g. scheduling of test suites

Abstract

A method and apparatus for testing software programs systematically explores valid call sequences using a collection of data with a software program comprising a collection of subroutine components. Instead of writing unit tests, the subject invention provides tools to develop precondition rules which systematically remove from the data collection, data which is syntactically incorrect for proper operation with the software program and then data which is semantically incorrect for the software program. The resulting reduced data collection is applied to the collection of components to generate output values which are then checked against postcondition rules to verify that the software program operated correctly. The test method and apparatus are implemented in object-oriented technology to allow test engineers to quickly and easily develop invariants, precondition rules and postcondition rules which are used to test the software program.

Claims

1. An apparatus for use with a computer system, including a central processing unit, for testing an application program comprised of a plurality of components, each of the plurality of components operating on parameter data and producing output values therefrom, the apparatus comprising:

(a) storage means controlled by the central processing unit and cooperating with the computer system to store the application program;

(b) means for storing predicate rules for detecting invalid data, the predicate rules comprising precondition rules for detecting semantically invalid parameter data and postcondition rules for detecting invalid output values generated by one of the plurality of components;

(c) means responsive to the stored application program and to the stored predicate rules for compiling the predicate rules and the application program to generate an executable program module, an executable precondition module and an executable postcondition module in a common library;

(d) means for generating a pool of syntactically correct parameter data from a lexical analysis of the application;

(e) means responsive to the pool of parameter data for applying the parameter data to the precondition module to remove semantically invalid parameter data therefrom and for applying parameter data remaining in the pool of parameter data to each of the plurality of components to generate output values; and

(f) means controlled by the central processing unit and responsive to the output values for applying the output values to the postcondition module to detect invalid output data.

2. The apparatus as recited in claim 1 further comprising controlling means for generating an executable wrapper module for controlling the executable program module to operate on the parameter data remaining in the pool of parameter data after processing by the precondition module.

3. The apparatus as recited in claim 1 wherein the precondition rules define parameter data on which the application program can operate without generating an error.

4. The apparatus as recited in claim 3, wherein the predicate rules include invariant means for detecting whether the parameter data has a valid state and the postcondition rules include means for detecting whether the output values indicate that semantically valid actions were performed by the plurality of components.

5. The apparatus as recited in claim 1 wherein each piece of the parameter data is one of a plurality of data types and wherein each of the predicate rules is written for one of the plurality of date types and the apparatus further comprises associate means for associating each piece of the parameter data having a particular data type with one of the predicate rules that is written for the particular data type.

6. The apparatus of claim 1 wherein the precondition rules include means for storing parameter information identifying parameter data applied to the preconditional rules and component information identifying ones of the plurality of components being tested and wherein the postcondition rules include means for accessing the stored parameter information and the stored component information to determine which parameter data and components were used to generate the output values.

7. The apparatus of claim 1 wherein the precondition rules and the postcondition rules are object classes and wherein the means for applying the parameter data to the precondition rules includes means for instantiating a precondition rule object from the precondition class and for applying the parameter data to the precondition rule object, and wherein the means for applying the output values to postcondition rules, includes means for instantiating a postcondition rule object from the postcondition rule class and for applying the output values to the postcondition rule object.