The following set of paths fulfills the all-uses criterion for variable ‘accept’:  {2-3-6-9}

The following set of paths fulfills the all-uses criterion for variable ‘accept’:  {2-9, 2-8, 2-5}

The following set of paths fulfills the all-defs criterion for variable ‘accept’:  {2-3-6-9, 4-5, 7-8}

The following set of paths fulfills the all-uses criterion for variable ‘accept’:  {2-3-4-5, 2-3-6-7-8, 2-3-6-9}

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = a * b;
4. else
5.    c = 0;
6. print(c);

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = 5;
4. else
5.    c = 0;
6. print(c);

1. read(a,b);
2. if (a == 2 && b == 0)
3.    c = a + 2;
4. else
5.    c = 0;
6. print(c);

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = 2 + b;
4. else
5.    c = 0;
6. print(c);

A path from node n1 to node n2 with regards to a variable v is def-clear, only if v is not given a new value at any of the nodes in the path and the use in n2 is a c-use.

A du-path (or: DU path) is a def-clear path from a node n1 where a variable v is defined to a node n2 where v is used.

100% all-defs coverage with regards to variable v requires that for all definitions of v all corresponding uses have been covered.

A def-use pair (or: DU pair) is a pair of nodes (n1, n2) where a variable v is defined at n1 and used at n2 and all paths from n1 to n2 are def-clear.

The following set of paths fulfills the all-uses criterion for variable ‘accept’:  {4-5, 7-8}

The following set of paths fulfills the all-uses criterion for variable ‘accept’:  {2-3-6-9, 7-8}

The following set of paths fulfills the all-uses criterion for variable ‘accept’: {2-3-6-9, 2-3-4-5, 2-3-6-7-8-9}

The following set of paths fulfills the all-uses criterion for variable ‘accept’: {2-3-6-9, 4-5, 7-8}

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = a * b;
4. else
5.    c = 0;
6. print(c);

1. read(a, b);
2. if (a == 2)
3.    c = a + b;
4. else
5.    c = 0;
6. print(c);

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = a + 2;
4. else
5.    c = 0;
6. print(c);

1. read(a, b);
2. if (a == 2 && b == 2)
3.    c = 5;
4. else
5.    c = 0;
6. print(c);

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2-7], [2-9], [9-5], [9-6], [9-7]}

The set of all du-pairs for variable ‘d’ equals {[2-5], [2-6], [2,-7], [2-9], [9-5], [9-6], [9-7]}

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2,-7], [2-9], [9-5], [9-6], [9-7], [9-9]}

The set of all du-pairs for variable ‘d’ equals {[2-4], [2-5], [2-6], [2,-7], [2-9]}

An Equivalent Mutant is a new version of a program with a small deviation from the original version of the program where all tests in the test suite defined for the original program version pass.

Note: We assume that all tests in the test suite pass when applied to the original program version.

A Killed Mutant is a new version of a program where all tests in the test suite defined for the original program version pass.

Note: We assume that all tests in the test suite pass when applied to the original program version.

A Live Mutant is a new version of a program where (at least) one of the tests in the test suite defined for the original program version fails.

Note: We assume that all tests in the test suite pass when applied to the original program version.

An Equivalent Mutant is a new version of a program which has a different behavior than the original version of the program.

9

81

27

6

Non-repudiation is about taking responsibility (and transparency about the responsibilities taken) for establishing security

Integrity deals with processes that assure that data is accessible only to those with authorized access

Authentication deals with processes that help determine whether a data requester is actually allowed to receive a service or perform an operation

Integrity deals with processes helping the receiver of data to determine that the associated information it is providing is actually correct

A Field Study is a heuristic evaluation.

Nielsen’s list of evaluation heuristics is typically used in Field Studies.

Heuristic Evaluation is an Inspection Method

Cognitive Walkthrough and Heuristic Evaluation mean the same thing.