Chapter 9 Boundary Testing.ppt

Chapter 9: Boundary Testing Input Domain Partitioning Simple Domain Analysis and Testing Important Boundary Testing Strategies Extensions and Perspectives Non-Uniform Partition Testing Extensions to basic partition testing ideas include Non-uniform or Selective or partitioned testing strategies Testing is based on related problems: some sub-domains will be tested more Usage-related problems = Use Musa’s Ops and UBST Sub-domains with complex boundary problems = Use input domain boundary testing (BT). Boundary Testing: Overview What is it? Test I/O relations. Classifying/partitioning of input space Cover input space and related boundary conditions. Also called (input) domain testing. Characteristics and applications? Functional/black-box view (I/O mapping for multiple sub-domains) Well-defined input data: numerical processing and decisions. Implementation information may be used = then more white box Focus: boundaries and related problems. Output used only in result checking. I/O Variables and Values Input: Input variables: x1, x2,. . . , xn. Input space: n-dimensional. Input vector: X = [x1, x2, . . . , xn]. Test point: X with specific xi values. Domains and sub-domains: specific types of processing are defined. Focus on input domain partitions. Output (assumed, not the focus) Output variables/vectors/space/range similarly defined. Mapped from input by a function. Output only used as oracle. Domain Partitioning and Sub-domains Input domain partitioning Divide into sets of sub-domains. “domain, “sub-domain, and “region“ often used interchangeably A sub-domain is typically defined by a set of conditions in the form of: f(x1, x2, ..., xn) K where “ can also be substituted by “, “=, “≠, “, or “. Domain Partitioning and Sub-domains Domain (sub-domain) boundaries: Distinguishes/defines different sub-domains. Each defined by it boundary condition, e.g., f(x1, x2, ., xn) = K Adjacent do