1. 1 COSC 4406 Software Engineering COSC 4406 Software Engineering Haibin Zhu, Ph.D. Dept. of Computer Science and mathematics, Nipissing University, 100 College Dr., North Bay, ON P1B 8L7, Canada, haibinz@nipissingu.ca, http://www.nipissingu.ca/faculty/haibinz haibinz@nipissingu.ca

2. 2 Lecture 11 Software Testing Techniques

3. 3 Testability Operability—it operates cleanly Operability—it operates cleanly Observability—the results of each test case are readily observed Observability—the results of each test case are readily observed Controllability—the degree to which testing can be automated and optimized Controllability—the degree to which testing can be automated and optimized Decomposability—testing can be targeted Decomposability—testing can be targeted Simplicity—reduce complex architecture and logic to simplify tests Simplicity—reduce complex architecture and logic to simplify tests Stability—few changes are requested during testing Stability—few changes are requested during testing Understandability—of the design Understandability—of the design Testability is simply how easily a program can be tested.

4. 4 What is a “Good” Test? A good test has a high probability of finding an error. A good test has a high probability of finding an error. A good test is not redundant. A good test is not redundant. A good test should be “best of breed” A good test should be “best of breed” The best in a group of similar tests. The best in a group of similar tests. A good test should be neither too simple nor too complex A good test should be neither too simple nor too complex

5. 5 Test Case Design "Bugs lurk in corners and congregate at boundaries..." Boris Beizer OBJECTIVE CRITERIA CONSTRAINT to uncover errors in a complete manner with a minimum of effort and time

6. 6 Exhaustive Testing Loops: 1 - 20 There are 10 possible paths! If we execute one test per millisecond, it would take 3,170 years to test this program!! 14 5^20 ~= 10^14 tests 10^14 /10^3seconds =10^11 seconds =10^11/(3600*24*365) years ~=3000 years!

7. 7 Selective Testing Selected path Loops: 1 - 20

8. 8 Software Testing Methods Strategies white-box methods black-box methods

9. 9 White-Box Testing... our goal is to ensure that all statements and conditions have been executed at least once...  Guarantee that all independent paths within a module have been exercised at least once;  Exercise all logical decisions on their true and false sides;  Execute all loops at their boundaries and within their operational bounds  Exercise internal data structures to ensure their validity.

10. 10 Why Cover? logic errors and incorrect assumptions are inversely proportional to a path's execution probability we often believe believe that a path is not that a path is not likely to be executed; in fact, reality is often counter intuitive typographical errors are random; it's likely that untested paths will contain some

11. 11 Basis Path Testing First, we compute the cyclomatic complexity: number of simple decisions + 1 or number of enclosed areas + 1 In this case, V(G) = 4

12. 12 Cyclomatic Complexity A number of industry studies have indicated that the higher V(G), the higher the probability or errors. V(G) modules modules in this range are more error prone

13. 13 Basis Path Testing Next, we derive the independent paths: Since V(G) = 4, there are four paths Path 1: 1,2,3,6,7,8 Path 2: 1,2,3,5,7,8 Path 3: 1,2,4,7,8 Path 4: 1,2,4,7,2,4,7,8 Finally, we derive test cases to exercise these paths. 1 2 3 4 56 7 8 An independent path is any path through the program that introduces at least one new set of processing statements or a new condition.

14. 14 Basis Path Testing Notes you don't need a flow chart, but the picture will help when you trace program paths count each simple logical test, compound tests count as 2 or more basis path testing should be applied to critical modules

15. 15 Graph Matrices A graph matrix is a square matrix whose size (i.e., number of rows and columns) is equal to the number of nodes on a flow graph A graph matrix is a square matrix whose size (i.e., number of rows and columns) is equal to the number of nodes on a flow graph Each row and column corresponds to an identified node, and matrix entries correspond to connections (an edge) between nodes. Each row and column corresponds to an identified node, and matrix entries correspond to connections (an edge) between nodes. By adding a link weight to each matrix entry, the graph matrix can become a powerful tool for evaluating program control structure during testing By adding a link weight to each matrix entry, the graph matrix can become a powerful tool for evaluating program control structure during testing

16. Graph Matrix node12345 1a 2 3db 4cf 5ge 16 1342 5

17. 17 Control Structure Testing Condition testing — a test case design method that exercises the logical conditions contained in a program module Condition testing — a test case design method that exercises the logical conditions contained in a program module Data flow testing — selects test paths of a program according to the locations of definitions and uses of variables in the program Data flow testing — selects test paths of a program according to the locations of definitions and uses of variables in the program

18. 18 Loop Testing NestedLoops Concatenated Loops Loops Unstructured Loops Simpleloop

19. 19 Loop Testing: Simple Loops Minimum conditions—Simple Loops 1. skip the loop entirely 2. only one pass through the loop 3. two passes through the loop 4. m passes through the loop m < n 5. (n-1), n, and (n+1) passes through the loop where n is the maximum number of allowable passes

20. 20 Loop Testing: Nested Loops Start at the innermost loop. Set all outer loops to their minimum iteration parameter values. Test the min+1, typical, max-1 and max for the innermost loop, while holding the outer loops at their minimum values. Move out one loop and set it up as in step 2, holding all other loops at typical values. Continue this step until the outermost loop has been tested. If the loops are independent of one another then treat each as a simple loop then treat each as a simple loop else* treat as nested loops else* treat as nested loops endif* for example, the final loop counter value of loop 1 is used to initialize loop 2. Nested Loops Concatenated Loops

21. 21 Black-Box Testing requirements events input output

22. 22 Black-Box Testing How is functional validity tested? How is functional validity tested? How is system behavior and performance tested? How is system behavior and performance tested? What classes of input will make good test cases? What classes of input will make good test cases? Is the system particularly sensitive to certain input values? Is the system particularly sensitive to certain input values? How are the boundaries of a data class isolated? How are the boundaries of a data class isolated? What data rates and data volume can the system tolerate? What data rates and data volume can the system tolerate? What effect will specific combinations of data have on system operation? What effect will specific combinations of data have on system operation?

23. 23 Graph-Based Methods To understand the objects that are modeled in software and the relationships that connect these objects In this context, we consider the term “objects” in the broadest possible context. It encompasses data objects, traditional components (modules), and object- oriented elements of computer software.

24. Graph-Based Methods (CNT’D) Transaction flow modeling: Steps + logical connections. Transaction flow modeling: Steps + logical connections. Finite state modeling: states + transitions. Finite state modeling: states + transitions. Data flow modeling: DFD? Data flow modeling: DFD? Time modeling: Program objects + links to show time required Time modeling: Program objects + links to show time required 24

25. 25 Equivalence Partitioning userqueries mousepicks outputformats prompts FKinput data An equivalence class represents a set of valid or invalid states for input conditions. Range, value: 1 valid and 2 invalid Equivalent Classes (ECs) are defined. A member of a set, boolean: 1 valid and 1 invalid ECs are defined.

26. 26 Sample Equivalence Classes user supplied commands responses to system prompts file names computational data physical parameters physical parameters bounding values bounding values initiation values initiation values output data formatting responses to error messages graphical data (e.g., mouse picks) data outside bounds of the program physically impossible data proper value supplied in wrong place Valid data Invalid data P497-498

27. 27 Boundary Value Analysis userqueries mousepicks outputformats prompts FKinput data outputdomain input domain P498

28. 28 Comparison Testing Used only in situations in which the reliability of software is absolutely critical (e.g., human-rated systems) Used only in situations in which the reliability of software is absolutely critical (e.g., human-rated systems) Separate software engineering teams develop independent versions of an application using the same specification Separate software engineering teams develop independent versions of an application using the same specification Each version can be tested with the same test data to ensure that all provide identical output Each version can be tested with the same test data to ensure that all provide identical output Then all versions are executed in parallel with real-time comparison of results to ensure consistency Then all versions are executed in parallel with real-time comparison of results to ensure consistency

29. 29 Orthogonal Array Testing Used when the number of input parameters is small and the values that each of the parameters may take are clearly bounded P1P2P3 1111 2122 3133 4212 5223 6231 7313 8321 9332 http://www.york.ac.uk/depts/maths/tables/orthogonal.htm 2-(3,3,1)

30. Orthogonal Array A t-(v,k,λ) orthogonal array (t ≤ k) is a λv t × k array whose entries are chosen from a set X with v points such that in every subset of t columns of the array, every t- tuple of points of X appears in exactly λ rows. In many applications these parameters are given the following names: v is the number of levels, k is the number of factors, λv is the number of experimental runs, t is the strength, and λ is the index. v is the number of levels, k is the number of factors, λv t is the number of experimental runs, t is the strength, and λ is the index. 30

31. 2-(3,4,1) OA P4 1 2 3 3 1 2 2 3 1 31 P1P2P3 1111 2122 3133 4212 5223 6231 7313 8321 9332

32. 32 OOT—Test Case Design Berard [BER93] proposes the following approach: 1.Each test case should be uniquely identified and should be explicitly associated with the class to be tested, 2.The purpose of the test should be stated, 3.A list of testing steps should be developed for each test and should contain [BER94]: a.a list of specified states for the object that is to be tested b.a list of messages and operations that will be exercised as a consequence of the test c.a list of exceptions that may occur as the object is tested d.a list of external conditions (i.e., changes in the environment external to the software that must exist in order to properly conduct the test) e.supplementary information that will aid in understanding or implementing the test.

33. 33 Testing Methods Fault-based testing Fault-based testing The tester looks for plausible faults (i.e., aspects of the implementation of the system that may result in defects). To determine whether these faults exist, test cases are designed to exercise the design or code. The tester looks for plausible faults (i.e., aspects of the implementation of the system that may result in defects). To determine whether these faults exist, test cases are designed to exercise the design or code. Class Testing and the Class Hierarchy Class Testing and the Class Hierarchy Inheritance does not obviate the need for thorough testing of all derived classes. In fact, it can actually complicate the testing process. Inheritance does not obviate the need for thorough testing of all derived classes. In fact, it can actually complicate the testing process. Scenario-Based Test Design Scenario-Based Test Design Scenario-based testing concentrates on what the user does, not what the product does. This means capturing the tasks (via use-cases) that the user has to perform, then applying them and their variants as tests. Scenario-based testing concentrates on what the user does, not what the product does. This means capturing the tasks (via use-cases) that the user has to perform, then applying them and their variants as tests.

34. Examples Use case: Fix the final draft Use case: Fix the final draft Print the entire document Print the entire document Move around in the document, changing certain pages. Move around in the document, changing certain pages. As each page is changed, it is printed. As each page is changed, it is printed. Sometimes a series of pages is printed. Sometimes a series of pages is printed. Use case: Print a new copy Use case: Print a new copy Open the document Open the document Print it (It might be expanded to several steps) Print it (It might be expanded to several steps) Close the document Close the document P521 P521 34

35. 35 OOT Methods: Random Testing Random testing Random testing identify operations applicable to a class identify operations applicable to a class define constraints on their use define constraints on their use identify a minimum test sequence identify a minimum test sequence an operation sequence that defines the minimum life history of the class (object) an operation sequence that defines the minimum life history of the class (object) generate a variety of random (but valid) test sequences generate a variety of random (but valid) test sequences exercise other (more complex) class instance life histories exercise other (more complex) class instance life histories P523 P523

36. 36 OOT Methods: Partition Testing Partition Testing Partition Testing reduces the number of test cases required to test a class in much the same way as equivalence partitioning for conventional software reduces the number of test cases required to test a class in much the same way as equivalence partitioning for conventional software state-based partitioning state-based partitioning categorize and test operations based on their ability to change the state of a class categorize and test operations based on their ability to change the state of a class attribute-based partitioning attribute-based partitioning categorize and test operations based on the attributes that they use categorize and test operations based on the attributes that they use category-based partitioning category-based partitioning categorize and test operations based on the generic function each performs categorize and test operations based on the generic function each performs

37. Example Class level: Class level: Open-setup-deposit-deposit-withdraw-withdraw-close. Open-setup-deposit-deposit-withdraw-withdraw-close. Open-setup-deposit-summarize-creditLimit-withdraw-withdraw- close. Open-setup-deposit-summarize-creditLimit-withdraw-withdraw- close. P524 P524 37

38. 38 OOT Methods: Inter-Class Testing Inter-class testing Inter-class testing For each client class, use the list of class operators to generate a series of random test sequences. The operators will send messages to other server classes. For each client class, use the list of class operators to generate a series of random test sequences. The operators will send messages to other server classes. For each message that is generated, determine the collaborator class and the corresponding operator in the server object. For each message that is generated, determine the collaborator class and the corresponding operator in the server object. For each operator in the server object (that has been invoked by messages sent from the client object), determine the messages that it transmits. For each operator in the server object (that has been invoked by messages sent from the client object), determine the messages that it transmits. For each of the messages, determine the next level of operators that are invoked and incorporate these into the test sequence For each of the messages, determine the next level of operators that are invoked and incorporate these into the test sequence

39. 39 OOT Methods: Behavior Testing The tests to be designed should achieve all state coverage [KIR94]. That is, the operation sequences should cause the Account class to make transition through all allowable states

40. 40 Testing Patterns Pattern name: pair testing Abstract: A process-oriented pattern, pair testing describes a technique that is analogous to pair programming in which two testers work together to design and execute a series of tests that can be applied to unit, integration or validation testing activities. Pattern name: separate test interface Abstract: There is a need to test every class in an object-oriented system, including “internal classes” (i.e., classes that do not expose any interface outside of the component that used them). The separate test interface pattern describes how to create “a test interface that can be used to describe specific tests on classes that are visible only internally to a component.” [LAN01] Pattern name: scenario testing Abstract: Once unit and integration tests have been conducted, there is a need to determine whether the software will perform in a manner that satisfies users. The scenario testing pattern describes a technique for exercising the software from the user’s point of view. A failure at this level indicates that the software has failed to meet a user visible requirement. [KAN01]

41. 41 Summary Testing fundamentals Testing fundamentals White box testing White box testing Basis path testing Basis path testing Control structure testing Control structure testing Black box testing Black box testing Graph-based testing Graph-based testing Orthogonal array testing Orthogonal array testing OO Testing OO Testing Random testing Random testing Partition testing Partition testing Interclass testing Interclass testing