Predicate Analysis Flashcards

1
Q

A program contains a domain error if on an input it follows an incorrect path due to incorrect condition or incorrect computation

A

Domain testing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Where are the requirements for domain testing extracted from?

A

Code

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Consists of a set of predicates that occur along the path in conditional or a loop statement

A

Path condition

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Consists of one or more border segments

A

Boundary

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

How many borders are there corresponding to each predicate in the path condition

A

1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

An error in any of the predicates in a path condition leads to a…

A

Border shift

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Operators ≤, ≥, and = are associated with:

A

Closed border

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

T/F Points that lie on the closed border are part of the path domain

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

T/F Points that lie on the open border are not part of the path domain

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

A domain error occurs because of an unintended shift in the border

A

Border shifts

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Must satisfy the path condition associated with the border

A

ON point

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

must be as close as possible to the ON point for that border

A

OFF point

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

T/F Only one ON and one OFF point are needed for inequalities

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

T/F One ON and two OFF points are needed for = and ≠ constraints

A

T

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Models dependency relationships among program input conditions (causes) and output conditions (effects)

A

Cause-Effect graphing

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

What is cause-effect graphing expressed as?

A

Boolean Expression

17
Q

One constraint on effects

A

Masking

18
Q

T/F With masking, both effects cannot occur for the same state of the program

A

T

19
Q

Avoid Combinatorial Explosion

A

OR/AND heuristics

20
Q

T/F Only one ON and two OFF point are needed for inequalities

A

F, one OFF point

21
Q

T/F Points that lie on the closed border are not part of the path domain

A

F, they are

22
Q

T/F With masking, both effects can occur for the same state of the program

A

F, they cannot

23
Q

T/F Points that lie on the open border are part of the path domain

A

F, are not

24
Q

Operators >, less than, and not equal to are associated with:

A

Open border

25
Q

T/F OFF points are on opposite sides of the border

A

T