Skip to Main Content
Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
book

Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson

by Aditya P. Mathur
May 2024
Intermediate to advanced content levelIntermediate to advanced
765 pages
21h 57m
English
Pearson India
Content preview from Foundations of Software Testing (Fundamental Algorithms and Techniques) by Pearson
Test Adequacy Assessment
E( f, )(E(S, )) denotes the execution sequence of function f (state-
ment S)onthecurrent values of all the variables used by f (S). We shall
use this notation while defining execution sequences of C functions and
statements.
Let S, S
1
,andS
2
denote a C statement other than CSFBL
DPOUJOVF, goto, and TXJUDI unless specified otherwise. The follow-
ing rules can be used to determine execution sequences for any C func-
tion:
R1 E({ },t) is the null sequence.
R2 E({}, t) E(S, t) = E(S, t) = E(S, t) E({})
R3 E({}, t) |
c
E(S, t) =|
c
E(S, t) =
null sequence if c is false,
E(S, t) otherwise.
R4 If S is an assignment-expression, then E(S, t) = S.
R5 For any statement S, E(S,t) = RLS(S), if RLS(S) contains
no statements other than zero or ...
Become an O’Reilly member and get unlimited access to this title plus top books and audiobooks from O’Reilly and nearly 200 top publishers, thousands of courses curated by job role, 150+ live events each month,
and much more.
Start your free trial

You might also like

Effective Software Testing, Video Edition

Effective Software Testing, Video Edition

Mauricio Aniche

Publisher Resources

ISBN: 9781299486720