Skip to Main Content
Foundations of Software Testing: Fundamental Algorithms and Techniques
book

Foundations of Software Testing: Fundamental Algorithms and Techniques

by Aditya P. Mathur
March 2007
Intermediate to advanced content levelIntermediate to advanced
709 pages
20h 23m
English
Pearson India
Content preview from Foundations of Software Testing: Fundamental Algorithms and Techniques
Preliminaries
by using an identifier associated with the next program statement. In the
case of programs in assembly language, the location of control can be
specified more precisely by giving the value of the program counter.
Each variable in the program corresponds to one element of this vec-
tor. Obviously, for a large program, such as the Unix OS, the state vec-
tor might have thousands of elements. Execution of program statements
causes the program to move from one state to the next. A sequence of
program states is termed as program behavior.
Example 1.13: Consider a program that inputs two integers into
variables X and Y, compares these values,
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

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

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

Aditya P. Mathur
Fundamentals of Computer Programming and IT by Pearson

Fundamentals of Computer Programming and IT by Pearson

Ashok Namdev Kamthane, Rohit Khurana

Publisher Resources

ISBN: 9788131707951