lecture-08-combinatorial-2

lecture-08-combinatorial-2 - Lecture 8 - combinatorial...

Info iconThis preview shows pages 1–6. Sign up to view the full content.

View Full Document Right Arrow Icon
Lecture 8 - combinatorial Spring 2010 CSci 5802 1 CSci 5802 Software Engineering II Combinatorial Testing Chapter 11 1 Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Aims for Today Understand rationale and basic approach for systematic combinatorial testing http://www Learn how to apply some representative combinatorial approaches Category-partition testing Pairwise combination testing Understand key differences and similarities among .umsec.umn.edu Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & M ihlY 2 the approaches and application domains for which they are suited
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 8 - combinatorial Spring 2010 CSci 5802 2 Black-Box Testing Approach to testing where the program is considered as a “black-box” considered as a black box The program test cases are based on the system specification Test planning can begin early in the software process Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 3 Input causing anomalous behavior Black-Box Testing Input test data Software Ie Output which reveal the presence of defects Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 4 Output results Oe
Background image of page 2
Lecture 8 - combinatorial Spring 2010 CSci 5802 3 Independently Testable Feature A well defined function that can be tested in (somewhat) isolation • Identified to “divide and conquer” the complexity of functionality Described by all the inputs that form their execution environment Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 5 Equivalence Partitioning Ie Ie Software Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 6 Oe
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 8 - combinatorial Spring 2010 CSci 5802 4 Combinatorial testing: Basic idea • Identify distinct attributes that can be varied – In the data, environment, or configuration – Example: browser could be “IE” or “Firefox”, operating system could be “Vista”, “XP”, or “OSX” • Systematically generate combinations to be tested – Example: IE on Vista, IE on XP, Firefox on Vista, CSci 5802(c) 2007 Mauro Pezzè & Michal Young Ch 11, slide 7 Firefox on OSX, . .. • Rationale: Test cases should be varied and include possible “corner cases” Key ideas in combinatorial approaches • Category-partition testing – separate (manual) identification of values that characterize the input space from (automatic) generation of combinations for test cases • Pairwise testing – systematically test interactions among attributes of the program input space with a relatively small number of test cases • Catalog-based testing CSci 5802(c) 2007 Mauro Pezzè & Michal Young Ch 11, slide 8 • Catalog based testing – aggregate and synthesize the experience of test designers in a particular organization or application domain, to aid in identifying attribute values
Background image of page 4
Lecture 8 - combinatorial Spring 2010 CSci 5802 5 Category partition (manual steps) 1. Decompose the specification into independently testable features for each feature identify parameters environment elements for each parameter and environment element identify elementary characteristics (categories) 2. Identify relevant values
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 6
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 18

lecture-08-combinatorial-2 - Lecture 8 - combinatorial...

This preview shows document pages 1 - 6. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online