软件测试作业3：图覆盖的理解及应用

程序代码如下：

/******************************************************* 
     * Finds and prints n prime integers 
     * Jeff Offutt, Spring 2003 
     ******************************************************/ 
    public static void printPrimes (int n) 
    { 
        int curPrime; // Value currently considered for primeness 
        int numPrimes; // Number of primes found so far. 
        boolean isPrime; // Is curPrime prime? 
        int [] primes = new int [MAXPRIMES]; // The list of prime numbers. 
        
        // Initialize 2 into the list of primes. 
        primes [0] = 2; 
        numPrimes = 1; 
        curPrime = 2; 
        while (numPrimes < n) 
        { 
            curPrime++; // next number to consider ... 
            isPrime = true; 
            for (int i = 0; i <= numPrimes-1; i++) 
            { // for each previous prime. 
                if (curPrime%primes[i]==0) 
                { // Found a divisor, curPrime is not prime. 
                    isPrime = false; 
                    break; // out of loop through primes. 
                } 
            } 
            if (isPrime) 
            { // save it! 
                primes[numPrimes] = curPrime; 
                numPrimes++; 
            } 
        } // End while 
        
        // Print all the primes out. 
        for (int i = 0; i <= numPrimes-1; i++) 
        { 
            System.out.println ("Prime: " + primes[i]); 
        } 
    } // end printPrimes

题目要求如下：

　　（a）Draw the control flow graph

      （b）t1=(n=3),t2=(n=5) Design a simple fault that t2 would be more likely to discover than t1 would.

      （c）Find a test case that connects the beginning of the while statement to for statement without going through the body of while loop.

      （d）Enumerate the test requirements for node coverage, edge coverage, and prime path coverage.

         – 基于Junit及Eclemma（ jacoco）实现一个主路径覆盖的测试。

Solutions:

a)控制流图

b)t1=(n=3),t2=(n=5).当数组越界时，t2更能发现问题。

c)当n=1时，程序跳过循环。

d)node coverage:{1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16}

edge coverage:{(1,2),(2,3),(3,4),(4,5),(5,6),(5,7),(6,7),(6,8),(7,4),(8,9),(9,10),(10,11),(9,11),(4,8),(2,12),(11,2),(12,13),(13,14),(14,15),(15,13),(13,16)}

prime path coverage:

{(1,2,3,4,5,6,7),

(1,2,3,4,5,7),

(1,2,3,4,5,6,8,9,10,11),

(1,2,3,4,8,9,10,11),

(1,2,3,4,5,6,8,9,11),

(1,2,3,4,8,9,11),

(1,2,12,13,14,15),

(1,2,12,13,16),

(2,3,4,8,9,10,11,2)

(2,3,4,8,9,11,2)

(2,3,4,5,6,8,9,10,11,2),

(2,3,4,5,6,8,9,11,2),

(4,5,7,4),

(4,5,6,7,4),

(13,14,15,13)

(15,13,14,15)}

基于Junit及Eclemma实现一个主路径覆盖的测试。

对于实验一的程序：

package triangle;

public class Triangle {
    private int a,b,c;
    
    public Triangle(int a, int b, int c) {
        super();
        this.a = a;
        this.b = b;
        this.c = c;
    }

    public String judgeTriangle(){
        if(a+b>c&&a+c>b&&b+c>a){
            if(a==b&&a==c)return "equilLateral";
            else if(a==b||a==c||b==c) return "isSosceles";
            else return "scalene";
        }
        else return "notTriangle"; 
    }
}



public class TestCase {
    Triangle t;
    @Test 
    public void test(){
        t = new Triangle(1,1,1);
        assertEquals("equilLateral",t.judgeTriangle());
        t = new Triangle(1,2,2);
        assertEquals("isSosceles",t.judgeTriangle());
        t = new Triangle(2,3,4);
        assertEquals("scalene",t.judgeTriangle());
        t = new Triangle(1,2,3);
        assertEquals("notTriangle",t.judgeTriangle());
    }
}
 

测试用例（1，1，1），（1，2，2），（2，3，4），（1，2，3）可完成主路径覆盖。