This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: Lecture 8 - combinatorial Spring 2010 CSci 5802 1 CSci 5802 Software Engineering II 1 Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Combinatorial Testing Chapter 11 ht Aims for Today • Understand rationale and basic approach for systematic combinatorial testing • Learn how to apply some representative combinatorial approaches tp://www.umsec.umn.edu Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & 2 Category-partition testing Pairwise combination testing • Understand key differences and similarities among the approaches and application domains for which they are suited Black-Box Testing Approach to testing where the program is considered as a “black-box” The program test cases are based on the system specification Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 3 Test planning can begin early in the software process Input test data Ie Input causing anomalous behavior Black-Box Testing Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 4 Output results Software Oe Output which reveal the presence of defects Independently Testable Feature A well defined function that can be tested in (somewhat) isolation • Identified to “divide and conquer” the complexity of functionality Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 5 complexity of functionality Described by all the inputs that form their execution environment Ie Ie Equivalence Partitioning Spring 2010 CSci 5802(c) 2007 Mauro Pezzè & Michal Young 6 Oe Software Lecture 8 - combinatorial Spring 2010 CSci 5802 2 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 CSci 5802(c) 2007 Mauro Pezzè & Michal Young Ch 11, slide 7 • Systematically generate combinations to be tested – Example: IE on Vista, IE on XP, Firefox on Vista, 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 CSci 5802(c) 2007 Mauro Pezzè & Michal Young Ch 11, slide 8 – systematically test interactions among attributes of the program input space with a relatively small number of test cases • Catalog-based testing – aggregate and synthesize the experience of test designers in a particular organization or application domain, to aid in identifying attribute values 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 CSci 5802(c) 2007 Mauro Pezzè & Michal Young Ch 11, slide 9...
View Full Document
This note was uploaded on 10/21/2011 for the course CSCI 5802 taught by Professor Heimdahl,m during the Spring '08 term at Minnesota.
- Spring '08
- Software engineering