Logic Coverage in Software Testing
I
n
t
r
o
d
u
c
t
i
o
n
t
o
S
o
f
t
w
a
r
e
T
e
s
t
i
n
g
C
h
a
p
t
e
r
3
.
3
L
o
g
i
c
C
o
v
e
r
a
g
e
f
r
o
m
S
o
u
r
c
e
C
o
d
e
Paul Ammann & Jeff Offutt
Paul Ammann & Jeff Offutt
L
o
g
i
c
E
x
p
r
e
s
s
i
o
n
s
f
r
o
m
S
o
u
r
c
e
Predicates are derived from
Predicates are derived from
decision
decision
statements in programs
statements in programs
In programs, most predicates have
In programs, most predicates have
less than four
less than four
clauses
clauses
Wise programmers actively strive to keep predicates simple
Wise programmers actively strive to keep predicates simple
When a predicate only has one clause, COC, ACC, ICC, and CC all
When a predicate only has one clause, COC, ACC, ICC, and CC all
collapse to
collapse to
predicate coverage
predicate coverage
(PC)
(PC)
Applying logic criteria to program source is hard because of
Applying logic criteria to program source is hard because of
reachability
reachability
and
and
controllability
controllability
:
:
Reachability
Reachability
: Before applying the criteria on a predicate at a particular statement,
: Before applying the criteria on a predicate at a particular statement,
we have to get to that statement
we have to get to that statement
Controllability
Controllability
: We have to find input values that indirectly assign values to the
: We have to find input values that indirectly assign values to the
variables in the predicates
variables in the predicates
Variables in the predicates that are not inputs to the program are called
Variables in the predicates that are not inputs to the program are called
internal
internal
variables
variables
These issues are illustrated through the triangle example in the
These issues are illustrated through the triangle example in the
following slides …
following slides …
2
3
3
0
p
r
i
v
a
t
e
s
t
a
t
i
c
i
n
t
T
r
i
a
n
g
(
i
n
t
s
1
,
i
n
t
s
2
,
i
n
t
s
3
)
3
1
{3
2
i
n
t
t
r
i
_
o
u
t
;
3
3
3
4
/
/
t
r
i
_
o
u
t
i
s
o
u
t
p
u
t
f
r
o
m
t
h
e
r
o
u
t
i
n
e
:
3
5
/
/
t
r
i
_
o
u
t
=
1
i
f
t
r
i
a
n
g
l
e
i
s
s
c
a
l
e
n
e
3
6
/
/
t
r
i
_
o
u
t
=
2
i
f
t
r
i
a
n
g
l
e
i
s
i
s
o
s
c
e
l
e
s
3
7
/
/
t
r
i
_
o
u
t
=
3
i
f
t
r
i
a
n
g
l
e
i
s
e
q
u
i
l
a
t
e
r
a
l
3
8
/
/
t
r
i
_
o
u
t
=
4
i
f
n
o
t
a
t
r
i
a
n
g
l
e
3
9
4
0
/
/
A
f
t
e
r
a
q
u
i
c
k
c
o
n
f
i
r
m
a
t
i
o
n
t
h
a
t
i
t
’
s
a
l
e
g
a
l
4
1
/
/
t
r
i
a
n
g
l
e
,
d
e
t
e
c
t
a
n
y
s
i
d
e
s
o
f
e
q
u
a
l
l
e
n
g
t
h
4
2
i
f
(
s
1
<
=
0
|
|
s
2
<
=
0
|
|
s
3
<
=
0
)
4
3
{4
4
t
r
i
_
o
u
t
=
4
;
4
5
r
e
t
u
r
n
(
t
r
i
_
o
u
t
)
;
4
6
}
4
7
4
8
t
r
i
_
o
u
t
=
0
;
4
9
i
f
(
s
1
=
=
s
2
)
5
0
t
r
i
_
o
u
t
=
t
r
i
_
o
u
t
+
1
;
5
1
i
f
(
s
1
=
=
s
3
)
5
2
t
r
i
_
o
u
t
=
t
r
i
_
o
u
t
+
2
;
5
3
i
f
(
s
2
=
=
s
3
)
5
4
t
r
i
_
o
u
t
=
t
r
i
_
o
u
t
+
3
;
5
5
i
f
(
t
r
i
_
o
u
t
=
=
0
)
5
6
{/
/
C
o
n
f
i
r
m
i
t
’
s
a
l
e
g
a
l
t
r
i
a
n
g
l
e
b
e
f
o
r
e
d
e
c
l
a
r
i
n
g
5
7
/
/
i
t
t
o
b
e
s
c
a
l
e
n
e
5
9
i
f
(
s
1
+
s
2
<
=
s
3
|
|
s
2
+
s
3
<
=
s
1
6
0
|
|
s
1
+
s
3
<
=
s
2
)
6
1
t
r
i
_
o
u
t
=
4
;
6
2
e
l
s
e
6
3
t
r
i
_
o
u
t
=
1
;
6
4
r
e
t
u
r
n
(
t
r
i
_
o
u
t
)
;
6
5
}
6
7
/
*
C
o
n
f
i
r
m
i
t
’
s
a
l
e
g
a
l
t
r
i
a
n
g
l
e
b
e
f
o
r
e
d
e
c
l
a
r
i
n
g
6
8
i
t
t
o
b
e
i
s
o
s
c
e
l
e
s
o
r
e
q
u
i
l
a
t
e
r
a
l
*
/
6
9
7
0
i
f
(
t
r
i
_
o
u
t
>
3
)
7
1
t
r
i
_
o
u
t
=
3
;
7
2
e
l
s
e
i
f
(
t
r
i
_
o
u
t
=
=
1
&
&
s
1
+
s
2
>
s
3
)
7
3
t
r
i
_
o
u
t
=
2
;
7
4
e
l
s
e
i
f
(
t
r
i
_
o
u
t
=
=
2
&
&
s
1
+
s
3
>
s
2
)
7
5
t
r
i
_
o
u
t
=
2
;
7
6
e
l
s
e
i
f
(
t
r
i
_
o
u
t
=
=
3
&
&
s
2
+
s
3
>
s
1
)
7
7
t
r
i
_
o
u
t
=
2
;
7
8
e
l
s
e
7
9
t
r
i
_
o
u
t
=
4
;
8
0
r
e
t
u
r
n
(
t
r
i
_
o
u
t
)
;
8
1
}
/
/
e
n
d
T
r
i
a
n
g
T
e
n
T
r
i
a
n
g
l
e
P
r
e
d
i
c
a
t
e
s
4
4
2
:
(
s
1
<
=
0
|
|
s
2
<
=
0
|
|
s
3
<
=
0
)
4
9
:
(
s
1
=
=
s
2
)
5
1
:
(
s
1
=
=
s
3
)
5
3
:
(
s
2
=
=
s
3
)
5
5
:
(
t
r
i
O
u
t
=
=
0
)
5
9
:
(
s
1
+
s
2
<
=
s
3
|
|
s
2
+
s
3
<
=
s
1
|
|
s
1
+
s
3
<
=
s
2
)
7
0
:
(
t
r
i
O
u
t
>
3
)
7
2
:
(
t
r
i
O
u
t
=
=
1
&
&
s
1
+
s
2
>
s
3
)
7
4
:
(
t
r
i
O
u
t
=
=
2
&
&
s
1
+
s
3
>
s
2
)
7
6
:
(
t
r
i
O
u
t
=
=
3
&
&
s
2
+
s
3
>
s
1
)
R
e
a
c
h
a
b
i
l
i
t
y
f
o
r
T
r
i
a
n
g
P
r
e
d
i
c
a
t
e
s
5
4
2
:
T
r
u
e
4
9
:
P
1
=
s
1
>
0
&
&
s
2
>
0
&
&
s
3
>
0
5
1
:
P
1
5
3
:
P
1
5
5
:
P
1
5
9
:
P
1
&
&
t
r
i
O
u
t
=
0
6
2
:
P
1
&
&
t
r
i
O
u
t
=
0
&
&
(
s
1
+
s
2
>
s
3
)
&
&
(
s
2
+
s
3
>
s
1
)
&
&
(
s
1
+
s
3
>
s
2
)
7
0
:
P
1
&
&
t
r
i
O
u
t
!
=
0
7
2
:
P
1
&
&
t
r
i
O
u
t
!
=
0
&
&
t
r
i
O
u
t
<
=
3
7
4
:
P
1
&
&
t
r
i
O
u
t
!
=
0
&
&
t
r
i
O
u
t
<
=
3
&
&
(
t
r
i
O
u
t
!
=
1
|
|
s
1
+
s
2
<
=
s
3
)
7
6
:
P
1
&
&
t
r
i
O
u
t
!
=
0
&
&
t
r
i
O
u
t
<
=
3
&
&
(
t
r
i
O
u
t
!
=
1
|
|
s
1
+
s
2
<
=
s
3
)
&
&
(
t
r
i
O
u
t
!
=
2
|
|
s
1
+
s
3
<
=
s
2
)
7
8
:
P
1
&
&
t
r
i
O
u
t
!
=
0
&
&
t
r
i
O
u
t
<
=
3
&
&
(
t
r
i
O
u
t
!
=
1
|
|
s
1
+
s
2
<
=
s
3
)
&
&
(
t
r
i
O
u
t
!
=
2
|
|
s
1
+
s
3
<
=
s
2
)
&
&
(
t
r
i
O
u
t
!
=
3
|
|
s
2
+
s
3
<
=
s
1
)
N
e
e
d
t
o
s
o
l
v
e
f
o
r
t
h
e
i
n
t
e
r
n
a
l
v
a
r
i
a
b
l
e
t
r
i
O
u
t
S
o
l
v
i
n
g
f
o
r
I
n
t
e
r
n
a
l
V
a
r
i
a
b
l
e
t
r
i
O
u
t
6
A
t
l
i
n
e
5
5
,
t
r
i
O
u
t
h
a
s
a
v
a
l
u
e
i
n
t
h
e
r
a
n
g
e
(
0
.
.
6
)
t
r
i
O
u
t
=
0
s
1
!
=
s
2
&
&
s
1
!
=
s
3
&
&
s
2
!
=
s
3
1
s
1
=
s
2
&
&
s
1
!
=
s
3
&
&
s
2
!
=
s
3
2
s
1
!
=
s
2
&
&
s
1
=
s
3
&
&
s
2
!
=
s
3
3
s
1
!
=
s
2
&
&
s
1
!
=
s
3
&
&
s
2
=
s
3
4
s
1
=
s
2
&
&
s
1
!
=
s
3
&
&
s
2
=
s
3
5
s
1
!
=
s
2
&
&
s
1
=
s
3
&
&
s
2
=
s
3
6
s
1
=
s
2
&
&
s
1
=
s
3
&
&
s
2
=
s
3
R
e
a
c
h
a
b
i
l
i
t
y
f
o
r
T
r
i
a
n
g
P
r
e
d
i
c
a
t
e
s
(
s
o
l
v
e
d
f
o
r
t
r
i
O
u
t
–
r
e
d
u
c
e
d
)
7
4
2
:
T
r
u
e
4
9
:
P
1
=
s
1
>
0
&
&
s
2
>
0
&
&
s
3
>
0
5
1
:
P
1
5
3
:
P
1
5
5
:
P
1
5
9
:
P
1
&
&
s
1
!
=
s
2
&
&
s
2
!
=
s
3
&
&
s
2
!
=
s
3
(
t
r
i
O
u
t
=
0
)
6
2
:
P
1
&
&
s
1
!
=
s
2
&
&
s
2
!
=
s
3
&
&
s
2
!
=
s
3
(
t
r
i
O
u
t
=
0
)
&
&
(
s
1
+
s
2
>
s
3
)
&
&
(
s
2
+
s
3
>
s
1
)
&
&
(
s
1
+
s
3
>
s
2
)
7
0
:
P
1
&
&
P
2
=
(
s
1
=
s
2
|
|
s
1
=
s
3
|
|
s
2
=
s
3
)
(
t
r
i
O
u
t
!
=
0
)
7
2
:
P
1
&
&
P
2
&
&
P
3
=
(
s
1
!
=
s
2
|
|
s
1
!
=
s
3
|
|
s
2
!
=
s
3
)
(
t
r
i
O
u
t
<
=
3
)
7
4
:
P
1
&
&
P
2
&
&
P
3
&
&
(
s
1
!
=
s
2
|
|
s
1
+
s
2
<
=
s
3
)
7
6
:
P
1
&
&
P
2
&
&
P
3
&
&
(
s
1
!
=
s
2
|
|
s
1
+
s
2
<
=
s
3
)
&
&
(
s
1
!
=
s
3
|
|
s
1
+
s
3
<
=
s
2
)
7
8
:
P
1
&
&
P
2
&
&
P
3
&
&
(
s
1
!
=
s
2
|
|
s
1
+
s
2
<
=
s
3
)
&
&
(
s
1
!
=
s
3
|
|
s
1
+
s
3
<
=
s
2
)
&
&
(
s
2
!
=
s
3
|
|
s
2
+
s
3
<
=
s
1
)
L
o
o
k
s
c
o
m
p
l
i
c
a
t
e
d
,
b
u
t
a
l
o
t
o
f
r
e
d
u
n
d
a
n
c
y
P
r
e
d
i
c
a
t
e
C
o
v
e
r
a
g
e
8
p
4
2
:
(
s
1
<
=
0
|
|
s
2
<
=
0
|
|
s
3
<
=
0
)
p
4
9
:
(
s
1
=
=
s
2
)
p
5
1
:
(
s
1
=
=
s
3
)
p
5
3
:
(
s
2
=
=
s
3
)
p
5
5
:
(
t
r
i
O
u
t
=
=
0
)
p
5
9
:
(
s
1
+
s
2
<
=
s
3
|
|
s
2
+
s
3
<
=
s
1
|
|
s
1
+
s
3
<
=
s
2
)
p
7
0
:
(
t
r
i
O
u
t
>
3
)
p
7
2
:
(
t
r
i
O
u
t
=
=
1
&
&
s
1
+
s
2
>
s
3
)
p
7
4
:
(
t
r
i
O
u
t
=
=
2
&
&
s
1
+
s
3
>
s
2
)
p
7
6
:
(
t
r
i
O
u
t
=
=
3
&
&
s
2
+
s
3
>
s
1
)
T
F
s
1
s
2
s
3
s
1
s
2
s
3
0
0
0
1
1
1
1
1
1
1
2
2
1
1
1
1
2
2
1
1
1
2
1
2
1
2
3
1
1
1
1
2
3
2
3
4
1
1
1
2
2
3
2
2
3
2
2
4
2
3
2
2
4
2
3
2
2
4
2
2
C
l
a
u
s
e
C
o
v
e
r
a
g
e
9
T
F
s
1
s
2
s
3
E
O
s
1
s
2
s
3
E
O
0
1
1
4
1
1
1
3
1
0
1
4
1
1
1
3
1
1
0
4
1
1
1
3
2
3
6
4
2
3
4
1
6
2
3
4
2
3
4
1
2
6
3
4
2
3
4
1
2
2
3
2
2
3
2
2
2
2
3
2
2
2
5
4
2
3
2
2
3
2
2
2
2
3
2
2
2
5
2
4
3
2
2
2
1
2
1
4
3
2
2
2
5
2
2
4
p
4
2
:
(
s
1
<
=
0
)
(
s
2
<
=
0
)
(
s
3
<
=
0
)
p
5
9
:
(
s
1
+
s
2
<
=
s
3
)
(
s
2
+
s
3
<
=
s
1
)
(
s
1
+
s
3
<
=
s
2
)
p
7
2
:
(
t
r
i
O
u
t
=
=
1
)
(
s
1
+
s
2
>
s
3
)
p
7
4
:
(
t
r
i
O
u
t
=
=
2
)
(
s
1
+
s
3
>
s
2
)
p
7
6
:
(
t
r
i
O
u
t
=
=
3
)
(
s
2
+
s
3
>
s
1
)
C
o
r
r
e
l
a
t
e
d
A
c
t
i
v
e
C
l
a
u
s
e
C
o
v
e
r
a
g
e
10
p
4
2
:
(
s
1
<
=
0
|
|
s
2
<
=
0
|
|
s
3
<
=
0
)
p
5
9
:
(
s
1
+
s
2
<
=
s
3
|
|
s
2
+
s
3
<
=
s
1
|
|
s
1
+
s
3
<
=
s
2
)
p
7
2
:
(
t
r
i
O
u
t
=
=
1
&
&
s
1
+
s
2
>
s
3
)
p
7
4
:
(
t
r
i
O
u
t
=
=
2
&
&
s
1
+
s
3
>
s
2
)
p
7
6
:
(
t
r
i
O
u
t
=
=
3
&
&
s
2
+
s
3
>
s
1
)
T
f
f
t
0
1
1
4
F
F
F
f
1
1
1
3
f
T
f
t
1
0
1
4
f
f
T
t
1
1
0
4
T
f
f
t
2
3
6
4
F
F
F
f
2
3
4
1
f
T
f
t
6
2
3
4
f
f
T
t
2
6
3
4
T
T
t
2
2
3
2
F
t
f
2
3
3
2
t
F
f
2
2
5
4
T
T
t
2
3
2
2
F
t
f
2
3
3
2
t
F
f
2
5
2
4
T
T
t
3
2
2
2
F
t
f
1
2
2
4
t
F
f
5
2
2
4
P
s
1
s
2
s
3
E
O
s
1
=
s
2
&
&
s
1
!
=
s
3
&
&
s
2
!
=
s
3
S
u
m
m
a
r
y
:
L
o
g
i
c
C
o
v
e
r
a
g
e
f
o
r
S
o
u
r
c
e
C
o
d
e
Predicates
appear in decision statements
if, while, for, etc.
Most predicates have less than
four clauses
But some applications have predicates with many clauses
The hard part of applying logic criteria to source is resolving the
internal
variables
Non-local variables
(class, global, etc.) are also input variables if they are
used
If an input variable is changed within a method, it is treated as an
internal
variable
thereafter
To maximize effect of logic coverage criteria:
Avoid transformations that hide predicate structure
11
Logic coverage from source code involves deriving predicates from decision statements in programs, where most predicates have less than four clauses. Wise programmers aim to keep predicates simple, as they affect coverage criteria such as COC, ACC, ICC, and CC, which collapse to predicate coverage (PC) when a predicate has only one clause. Applying logic criteria to program source is challenging due to reachability and controllability concerns, illustrated through examples like triangle verification routines.
Uploaded on Oct 03, 2024 | 0 Views
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. Download presentation by click this link. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
E N D
Presentation Transcript
Introduction to Software Testing Chapter 3.3 Logic Coverage from Source Code Paul Ammann & Jeff Offutt
Logic Expressions from Source Predicates are derived from decision statements in programs In programs, most predicates have less than four clauses Wise programmers actively strive to keep predicates simple When a predicate only has one clause, COC, ACC, ICC, and CC all collapse to predicate coverage (PC) Applying logic criteria to program source is hard because of reachability and controllability: Reachability : Before applying the criteria on a predicate at a particular statement, we have to get to that statement Controllability : We have to find input values that indirectly assign values to the variables in the predicates Variables in the predicates that are not inputs to the program are called internal variables These issues are illustrated through the triangle example in the following slides 2
30 private static int Triang (int s1, int s2, int s3) 31 { 32 int tri_out; 33 34 // tri_out is output from the routine: 35 // tri_out = 1 if triangle is scalene 36 // tri_out = 2 if triangle is isosceles 37 // tri_out = 3 if triangle is equilateral 38 // tri_out = 4 if not a triangle 39 40 // After a quick confirmation that it s a legal 41 // triangle, detect any sides of equal length 42 if (s1 <= 0 || s2 <= 0 || s3 <= 0) 43 { 44 tri_out = 4; 45 return (tri_out); 46 } 47 48 tri_out = 0; 49 if (s1 == s2) 50 tri_out = tri_out + 1; 51 if (s1 == s3) 52 tri_out = tri_out + 2; 53 if (s2 == s3) 54 tri_out = tri_out + 3; 55 if (tri_out == 0) 56 { // Confirm it s a legal triangle before declaring 57 // it to be scalene 59 if (s1+s2<=s3||s2+s3 <= s1 60 || s1+s3 <= s2) 61 tri_out = 4; 62 else 63 tri_out = 1; 64 return (tri_out); 65 } 67 /* Confirm it s a legal triangle before declaring 68 it to be isosceles or equilateral */ 69 70 if (tri_out > 3) 71 tri_out = 3; 72 else if (tri_out == 1 && s1+s2 > s3) 73 tri_out = 2; 74 else if (tri_out == 2 && s1+s3 > s2) 75 tri_out = 2; 76 else if (tri_out == 3 && s2+s3 > s1) 77 tri_out = 2; 78 else 79 tri_out = 4; 80 return (tri_out); 81 } // end Triang 3
Ten Triangle Predicates 42: (s1 <= 0 || s2 <= 0 || s3 <= 0) 49: (s1 == s2) 51: (s1 == s3) 53: (s2 == s3) 55: (triOut == 0) 59: (s1+s2 <= s3 || s2+s3 <= s1 || s1+s3 <= s2) 70: (triOut > 3) 72: (triOut == 1 && s1+s2 > s3) 74: (triOut == 2 && s1+s3 > s2) 76: (triOut == 3 && s2+s3 > s1) 4
Reachability for Triang Predicates 42: True 49: P1 = s1>0 && s2>0 && s3>0 51: P1 53: P1 55: P1 59: P1 && triOut = 0 62: P1 && triOut = 0 && (s1+s2 > s3) && (s2+s3 > s1) && (s1+s3 > s2) 70: P1 && triOut != 0 72: P1 && triOut != 0 && triOut <= 3 74: P1 && triOut != 0 && triOut <= 3 && (triOut !=1 || s1+s2<=s3) 76: P1 && triOut != 0 && triOut <= 3 && (triOut !=1 || s1+s2<=s3) && (triOut !=2 || s1+s3<=s2) 78: P1 && triOut != 0 && triOut <= 3 && (triOut !=1 || s1+s2<=s3) && (triOut !=2 || s1+s3 <= s2) && (triOut !=3 || s2+s3 <= s1) Need to solve for the internal variable triOut 5
Solving for Internal Variable triOut At line 55, triOut has a value in the range (0 .. 6) triOut = 0 s1!=s2 && s1!=s3 && s2!=s3 1 s1=s2 && s1!=s3 && s2!=s3 2 s1!=s2 && s1=s3 && s2!=s3 3 s1!=s2 && s1!=s3 && s2=s3 4 s1=s2 && s1!=s3 && s2=s3 5 s1!=s2 && s1=s3 && s2=s3 6 s1=s2 && s1=s3 && s2=s3 Contradiction Contradiction 6
Reachability for Triang Predicates (solved for triOut reduced) 42: True 49: P1 = s1>0 && s2>0 && s3>0 51: P1 53: P1 55: P1 59: P1 && s1 != s2 && s2 != s3 && s2 != s3 (triOut = 0) 62: P1 && s1 != s2 && s2 != s3 && s2 != s3 (triOut = 0) && (s1+s2 > s3) && (s2+s3 > s1) && (s1+s3 > s2) 70: P1 && P2 = (s1=s2 || s1=s3 || s2=s3) (triOut != 0) 72: P1 && P2 && P3 = (s1!=s2 || s1!=s3 || s2!=s3) (triOut <= 3) 74: P1 && P2 && P3 && (s1 != s2 || s1+s2<=s3) 76: P1 && P2 && P3 && (s1 != s2 || s1+s2<=s3) && (s1 != s3 || s1+s3<=s2) 78: P1 && P2 && P3 && (s1 != s2 || s1+s2<=s3) && (s1 != s3 || s1+s3<=s2) && (s2 != s3 || s2+s3<=s1) Looks complicated, but a lot of redundancy 7
Predicate Coverage These values are don t care , needed to complete the test. T F s1 s2 s3 s1 s2 s3 0 0 0 1 1 1 1 1 1 1 2 2 1 1 1 1 2 2 1 1 1 2 1 2 1 2 3 1 1 1 p42: (s1 <= 0 || s2 <= 0 || s3 <= 0) p49: (s1 == s2) p51: (s1 == s3) p53: (s2 == s3) p55: (triOut == 0) p59: (s1+s2 <= s3 || s2+s3 <= s1 || s1+s3 <= s2) p70: (triOut > 3) p72: (triOut == 1 && s1+s2 > s3) p74: (triOut == 2 && s1+s3 > s2) p76: (triOut == 3 && s2+s3 > s1) 1 2 3 2 3 4 1 1 1 2 2 3 2 2 3 2 2 4 2 3 2 2 4 2 3 2 2 4 2 2 8
Clause Coverage T F s1 s2 s3 EO s1 s2 s3 EO 0 1 1 4 1 1 1 3 1 0 1 4 1 1 1 3 1 1 0 4 1 1 1 3 2 3 6 4 2 3 4 1 6 2 3 4 2 3 4 1 2 6 3 4 2 3 4 1 2 2 3 2 2 3 2 2 2 2 3 2 2 2 5 4 2 3 2 2 3 2 2 2 2 3 2 2 2 5 2 4 3 2 2 2 1 2 1 4 3 2 2 2 5 2 2 4 p42: (s1 <= 0) (s2 <= 0 ) (s3 <= 0) p59: (s1+s2 <= s3 ) (s2+s3 <= s1) (s1+s3 <= s2) p72: (triOut == 1) (s1+s2 > s3) p74: (triOut == 2) (s1+s3 > s2) p76: (triOut == 3) (s2+s3 > s1) 9
Correlated Active Clause Coverage P s1 s2 s3 EO T f f t 0 1 1 4 F F F f 1 1 1 3 f T f t 1 0 1 4 f f T t 1 1 0 4 T f f t 2 3 6 4 F F F f 2 3 4 1 f T f t 6 2 3 4 f f T t 2 6 3 4 T T t 2 2 3 2 F t f 2 3 3 2 t F f 2 2 5 4 T T t 2 3 2 2 F t f 2 3 3 2 t F f 2 5 2 4 T T t 3 2 2 2 F t f 1 2 2 4 t F f 5 2 2 4 p42: (s1 <= 0 || s2 <= 0 || s3 <= 0) p59: (s1+s2 <= s3 || s2+s3 <= s1 || s1+s3 <= s2) p72: (triOut == 1 && s1+s2 > s3) s1=s2 && s1!=s3 && s2!=s3 p74: (triOut == 2 && s1+s3 > s2) s1!=s2 && s1=s3 && s2!=s3 p76: (triOut == 3 && s2+s3 > s1) s1!=s2 && s1!=s3 && s2=s3 10
Summary : Logic Coverage for Source Code Predicates appear in decision statements if, while, for, etc. Most predicates have less than four clauses But some applications have predicates with many clauses The hard part of applying logic criteria to source is resolving the internal variables Non-local variables (class, global, etc.) are also input variables if they are used If an input variable is changed within a method, it is treated as an internal variable thereafter To maximize effect of logic coverage criteria: Avoid transformations that hide predicate structure 11
