软件测试——Graph Coverage (1)

Use the following method printPrimes() for questions a-d below.

1.  /** *****************************************************

2.  * Finds and prints n prime integers

3.  * Jeff Offutt, Spring 2003

4.  ********************************************************* */

5.  private static void printPrimes (int n)

6.  {

7.      int curPrime; // Value currently considered for primeness

8.      int numPrimes; // Number of primes found so far.

9.      boolean isPrime; // Is curPrime prime?

10.    int [] primes = new int [MAXPRIMES]; // The list of prime numbers.

11.

12.    // Initialize 2 into the list of primes.

13.    primes [0] = 2;

14.    numPrimes = 1;

15.    curPrime = 2;

16.    while (numPrimes < n)

17.    {

18.        curPrime++; // next number to consider ...

19.        isPrime = true;

20.        for (int i = 0; i <= numPrimes-1; i++)

21.        { // for each previous prime.

22.            if (isDivisible (primes[i], curPrime))

23.            { // Found a divisor, curPrime is not prime.

24.                isPrime = false;

25.                break; // out of loop through primes.

26.            }

27.        }

28.        if (isPrime)

29.        { // save it!

30.            primes[numPrimes] = curPrime;

31.            numPrimes++;

32.        }

33.    } // End while

34.

35.    // Print all the primes out.

36.    for (int i = 0; i <= numPrimes-1; i++)

37.    {

38.        System.out.println ("Prime: " + primes[i]);

39.    }

40. } // end printPrimes

Q:            

(a) Draw the control flow graph for the printPrimes() method.

(b) Consider test cases t1 = (n = 3) and t2 = (n = 5). Although these tour the same prime paths in printPrimes(), they do not necessarily find the same faults. Design a simple fault that t2 would be more likely to discover than t1 would.

(c) For printPrimes(), find a test case such that the corresponding test path visits the edge that connects the beginning of the while statement to the for statement without going through the body of the while loop.

(d) Enumerate the test requirements for node coverage, edge coverage, and prime path coverage for the graph for printPrimes().

A:

(a)

(b) Move line 19(isPrime = true) above line 16 so that no primes after 4.

(c) test t3 = (n = 1)

(d) Node coverage test requirement: {1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14}

     Edge coverage test requirement: {(1, 2), (2, 3), (3, 4), (4, 5), (5, 6), (6, 8), (5, 7), (7, 4), (4, 8), (8, 9), (8, 10), (9, 10), (10, 2), (2, 11), (11, 12), (12, 13), (13, 12), (12, 14)}

     Prime path coverage test requirement: {[1, 2, 3, 4, 5, 6, 8, 9, 10], [1, 2, 3, 4, 5, 7], [1, 2, 3, 4, 8, 9, 10], [1, 2, 3, 4, 5, 6, 8, 10], [1, 2, 3, 4, 8, 10], [2, 3, 4, 5, 6, 8, 9, 10, 2], [4, 5, 7, 4], [2, 3, 4, 8, 9, 10, 2], [2, 3, 4, 5, 6, 8, 10, 2], [2, 3, 4, 8, 10, 2], [1, 2, 11, 12, 13], [1, 2, 11, 12, 14], [12, 13, 12], [13, 12, 13], [13, 12, 14], [3, 4, 5, 6, 8, 9, 10, 2, 11, 12, 13], [3, 4, 5, 6, 8, 9, 10, 2, 11, 12, 14], [3, 4, 5, 6, 8, 10, 2, 11, 12, 13], [3, 4, 5, 6, 8, 10, 2, 11, 12, 14], [3, 4, 8, 9, 10, 2, 11, 12, 13], [3, 4, 8, 9, 10, 2, 11, 12, 14], [3, 4, 8, 10, 2, 11, 12, 13], [3, 4, 8, 10, 2, 11, 12, 14], [7, 4, 5, 6, 8, 9, 10, 2, 11, 12, 13], [7, 4, 5, 6, 8, 9, 10, 2, 11, 12, 14], [7, 4, 5, 6, 8, 10, 2, 11, 12, 13], [7, 4, 5, 6, 8, 10, 2, 11, 12, 14], [7, 4, 8, 9, 10, 2, 11, 12, 13], [7, 4, 8, 9, 10, 2, 11, 12, 14], [7, 4, 8, 10, 2, 11, 12, 13], [7, 4, 8, 10, 2, 11, 12, 14], [5, 7, 4, 5], [7, 4, 5, 7], [3, 4, 5, 6, 8, 9, 10, 2, 3], [3, 4, 5, 6, 8, 10, 2, 3], [3, 4, 8, 9, 10, 2, 3], [3, 4, 8, 10, 2, 3], [4, 8, 9, 10, 2, 3, 4], [4, 8, 10, 2, 3, 4], [4, 5, 6, 8, 9, 10, 2, 3, 4], [4, 5, 6, 8, 10, 2, 3, 4], [5, 6, 8, 9, 10, 2, 3, 4, 5], [5, 6, 8, 10, 2, 3, 4, 5], [6, 8, 9, 10, 2, 3, 4, 5, 6], [6, 8, 10, 2, 3, 4, 5, 6], [8, 9, 10, 2, 3, 4, 5, 6, 8], [8, 10, 2, 3, 4, 5, 6, 8], [8, 9, 10, 2, 3, 4, 8], [8, 10, 2, 3, 4, 8], [9, 10, 2, 3, 4, 5, 6, 8, 9], [9, 10, 2, 3, 4, 8, 9], [10, 2, 3, 4, 5, 6, 8, 9, 10], [10, 2, 3, 4, 5, 6, 8, 10], [10, 2, 3, 4, 8, 9, 10], [10, 2, 3, 4, 8, 9, 10], [10, 2, 3, 4, 8, 10]}

A prime path coverage test for program of Lab1:

Each test case is prime path test.

package lab1;

public class Lab1 {

    public String check( int a, int b, int c){
        //排序使a<=b<=c
        int temp;
        if( a > b){
            if( a > c){
                temp = c;
                c = a;
                if( b > temp)
                    a = temp;
                else{
                    a = b;
                    b = temp;
                }
            }else{
                temp = a;
                a = b;
                b = temp;
            }
        }else if( b > c){
            temp = c;
            c = b;
            b = temp;
        }
        
        if( a <= 0 || a + b <= c)
            return "输入的边不能构成三角形";
        else if (a == b || b == c)
            return a == c ? "等边三角形" : "等腰三角形";
        else
            return "一般三角形";
    }

}

package lab1;

import static org.junit.Assert.assertEquals;

@RunWith(Parameterized.class)
public class Lab1Test {

    private int input1;
    private int input2;
    private int input3;
    private String expected;
    private Lab1 test;
    
    public Lab1Test(int input1,int input2,int input3, String expected){
        this.input1 = input1;
        this.input2 = input2;
        this.input3 = input3;
        this.expected = expected;
    }
    
    @Before
    public void setUp(){
        test = new Lab1();
    }
    
    @Parameters
    public static Collection<Object[]> getData(){
        return Arrays.asList(new Object[][]{
            {2, 3, 4, "一般三角形"},
            {8, 7, 9, "一般三角形"},
            {5, 5, 5, "等边三角形"},
            {1, 1, 1, "等边三角形"},
            {6, 7, 7, "等腰三角形"},
            {10, 7, 9, "一般三角形"},
            {9, 7, 4, "一般三角形"},
            {2, 2, 3, "等腰三角形"},
            {1, 6, 4, "输入的边不能构成三角形"},
            {0, -1, 3, "输入的边不能构成三角形"},
        });
    }
    
    @Test
    public void testCheck() {
        assertEquals(this.expected, test.check(input1, input2, input3));
    }
}