Foundations of Software Testing, 2nd Edition

2

Preliminaries: Mathematical

CONTENTS

2.1 Predicates and Boolean expressions

2.2 Control flow graph

2.3 Execution history

2.4 Dominators and post-dominators

2.5 Program dependence graph

2.6 Strings, languages, and regular expressions

2.7 Tools

The purpose of this introductory chapter is to familiarize the reader with the basic mathematical concepts related to software testing. These concepts will likely be useful in understanding the material in subsequent chapters.

2.1  Predicates and Boolean Expressions

Let relop denote a relational operator in the set {<, >, ≤, ≥, =, ≠}. Let bop denote a Boolean operator in the set {∧, ∨, , ¬} where ∧, ∨, and are binary Boolean operators and ¬ is a unary Boolean operator. A Boolean variable takes on values ...