Software Testing: Strategies, Classifications, and Metrics, Essays (university) of Combinatorics

Download Software Testing: Strategies, Classifications, and Metrics and more Essays (university) Combinatorics in PDF only on Docsity!

• (^) Definitions and objectives
• (^) Software testing strategies
• (^) Software test classifications

• (^) White box testing

   **Data processing and calculation correctness tests** 

  • (^) Correctness tests and path coverage
  • (^) Correctness tests and line coverage
  • (^) McCabe’s cyclomatic complexity metrics
  • (^) Software qualification and reusability testing
  • (^) Advantages and disadvantages of white box testing
• (^) Black box testing
  • (^) Equivalence classes for output correctness tests
  • (^) Other operation factor testing classes
  • (^) Revision factor testing classes
  • (^) Transition factor testing classes
  • (^) Advantages and disadvantages of black box testing
• Galin, SQA from Theory to Implementation

Direct objectives

a. To identify and reveal as many errors as possible in

the tested software

b. To bring the tested software, after correction of the

identified errors and retesting, to an acceptable

level of quality.

c. To perform the required tests efficiently and

effectively, within the limits budgetary and

scheduling limitation.

Indirect objectives

a. To compile a record of software errors for use in

error prevention (by corrective and preventive

actions)

• Galin, SQA from Theory to Implementation

• Incremental testing strategies:

• (^) Bottom-up testing
• (^) Top-down testing

• Big bang testing

• Galin, SQA from Theory to Implementation

M M M1 M M3 M4 M M6 M M M Integration C Integration A Integration B Stage 3 Stage 1 Stage 2 Stage 5 Integration D Stage 4 Stage 6

• Galin, SQA from Theory to Implementation

Top-down testing of module M8 Bottom-up testing of module M

Module on test

M

Stub

of M

Stub

of M

M

Module on test

Drive

of M

M1 M

M

Module tested in an earlier stage Modules tested in an earlier stage

• Galin, SQA from Theory to Implementation

Path coverage

• (^) Path coverage of a test is measured by the percentage of all possible program paths included in planned testing. Line coverage
• (^) Line coverage of a test is measured by the percentage of program code lines included in planned testing. - Galin, SQA from Theory to Implementation

Example ITS taxi fares for one-time passengers are calculated as follows:

Minimal fare: $2. This fare covers the distance traveled up to 1000 yards and waiting time (stopping for traffic lights or traffic jams, etc.) of up to 3 minutes.

For every additional 250 yards or part of it: 25 cents.

For every additional 2 minutes of stopping or waiting or part thereof: 20 cents.

One suitcase: 0 change; each additional suitcase: $1.

Night supplement: 25%, effective for journeys between 21.00 and 06.00. Regular clients are entitled to a 10% discount and are not charged the night supplement.

• Galin, SQA from Theory to Implementation

R R R R R R

• Galin, SQA from Theory to Implementation

R R R R R R

• Galin, SQA from Theory to Implementation

Advantages:

• Direct determination of software correctness as expressed in the processing paths, including algorithms.
• Allows performance of line coverage follow up.
• Ascertains quality of coding work and its adherence to coding standards. Disadvantages :
• The vast resources utilized, much above those required for black box testing of the same software package.
• The inability to test software performance in terms of availability (response time), reliability, load durability, etc.

• Galin, SQA from Theory to Implementation

A black box method aimed at

increasing the efficiency of testing

and, at the same time, improving

coverage of potential error

conditions.

• Galin, SQA from Theory to Implementation

According to the equivalence class partitioning method:

• (^) E ach valid EC and each invalid EC are included in at least one test case.
• (^) D efinition of test cases is done separately for the valid and invalid ECs.
• (^) I n defining a test case for the valid ECs, we try to cover as many as possible “new” ECs in that same test case.
• (^) I n defining invalid ECs, we must assign one test case to each “new” invalid EC, as a test case that includes more than one invalid EC may not allow the tester to distinguish between the program’s separate reactions to each of the invalid ECs.
• (^) T est cases are added as long as there are uncovered ECs.
  • Galin, SQA from Theory to Implementation

Age: 60.01- $8 $8 $4 $4 $12 $12 $5. 50 $5. 50 120. Age 16.01- $10 $17 $5 $6 $15 $18 $7 $ 60. Age: 0.00- $5 $6 $2. 50 $3 $7.50 $9 $3. 50 $ 16.

6.00-

19.01-

6.00-

19.01-

6.00-

19.01-

6.00-

Entry hour Visitor’s Ot Ot Mem Mem Ot Ot Mem Mem status Day Mon., Tue., Wed., Thu, Fri. Sat., Sun.

• Galin, SQA from Theory to Implementation