Lectures Software Engineering - Chapter 20: Defect testing

Nội dung text: Lectures Software Engineering - Chapter 20: Defect testing

1. Defect testing l Testing programs to establish the presence of system defects âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 1
2. Objectives l To understand testing techniques that are geared to discover program faults l To introduce guidelines for interface testing l To understand specific approaches to object- oriented testing l To understand the principles of CASE tool support for testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 2
3. Topics covered l Defect testing l Integration testing l Object-oriented testing l Testing workbenches âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 3
4. The testing process l Component testing • Testing of individual program components • Usually the responsibility of the component developer (except sometimes for critical systems) • Tests are derived from the developer’s experience l Integration testing • Testing of groups of components integrated to create a system or sub-system • The responsibility of an independent testing team • Tests are based on a system specification âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 4
5. Testing phases âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 5
6. Defect testing l The goal of defect testing is to discover defects in programs l A successful defect test is a test which causes a program to behave in an anomalous way l Tests show the presence not the absence of defects âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 6
7. Testing priorities l Only exhaustive testing can show a program is free from defects. However, exhaustive testing is impossible l Tests should exercise a system's capabilities rather than its components l Testing old capabilities is more important than testing new capabilities l Testing typical situations is more important than boundary value cases âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 7
8. Test data and test cases l Test data Inputs which have been devised to test the system l Test cases Inputs to test the system and the predicted outputs from these inputs if the system operates according to its specification âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 8
9. The defect testing process âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 9
10. Black-box testing l An approach to testing where the program is considered as a ‘black-box’ l The program test cases are based on the system specification l Test planning can begin early in the software process âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 10
11. Black-box testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 11
12. Equivalence partitioning l Input data and output results often fall into different classes where all members of a class are related l Each of these classes is an equivalence partition where the program behaves in an equivalent way for each class member l Test cases should be chosen from each partition âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 12
13. Equivalence partitioning âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 13
14. Equivalence partitioning l Partition system inputs and outputs into ‘equivalence sets’ • If input is a 5-digit integer between 10,000 and 99,999, equivalence partitions are 10, 000 l Choose test cases at the boundary of these sets • 00000, 09999, 10000, 99999, 10001 âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 14
15. Equivalence partitions âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 15
16. Search routine specification procedure Search (Key : ELEM ; T: ELEM_ARRAY; Found : in out BOOLEAN; L: in out ELEM_INDEX) ; Pre-condition the array has at least one element T’FIRST = i <= T’LAST, T (i) = Key )) âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 16
17. Search routine - input partitions l Inputs which conform to the pre-conditions l Inputs where a pre-condition does not hold l Inputs where the key element is a member of the array l Inputs where the key element is not a member of the array âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 17
18. Testing guidelines (sequences) l Test software with sequences which have only a single value l Use sequences of different sizes in different tests l Derive tests so that the first, middle and last elements of the sequence are accessed l Test with sequences of zero length âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 18
19. Search routine - input partitions âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 19
20. Structural testing l Sometime called white-box testing l Derivation of test cases according to program structure. Knowledge of the program is used to identify additional test cases l Objective is to exercise all program statements (not all path combinations) âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 20
21. White-box testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 21
22. Binary search (Java)
23. Binary search - equiv. partitions l Pre-conditions satisfied, key element in array l Pre-conditions satisfied, key element not in array l Pre-conditions unsatisfied, key element in array l Pre-conditions unsatisfied, key element not in array l Input array has a single value l Input array has an even number of values l Input array has an odd number of values âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 23
24. Binary search equiv. partitions âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 24
25. Binary search - test cases âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 25
26. Path testing l The objective of path testing is to ensure that the set of test cases is such that each path through the program is executed at least once l The starting point for path testing is a program flow graph that shows nodes representing program decisions and arcs representing the flow of control l Statements with conditions are therefore nodes in the flow graph âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 26
27. Program flow graphs l Describes the program control flow. Each branch is shown as a separate path and loops are shown by arrows looping back to the loop condition node l Used as a basis for computing the cyclomatic complexity l Cyclomatic complexity = Number of edges - Number of nodes +2 âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 27
28. Cyclomatic complexity l The number of tests to test all control statements equals the cyclomatic complexity l Cyclomatic complexity equals number of conditions in a program l Useful if used with care. Does not imply adequacy of testing. l Although all paths are executed, all combinations of paths are not executed âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 28
29. Binary search flow graph
30. Independent paths l 1, 2, 3, 8, 9 l 1, 2, 3, 4, 6, 7, 2 l 1, 2, 3, 4, 5, 7, 2 l 1, 2, 3, 4, 6, 7, 2, 8, 9 l Test cases should be derived so that all of these paths are executed l A dynamic program analyser may be used to check that paths have been executed âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 30
31. Integration testing l Tests complete systems or subsystems composed of integrated components l Integration testing should be black-box testing with tests derived from the specification l Main difficulty is localising errors l Incremental integration testing reduces this problem âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 31
32. Incremental integration testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 32
33. Approaches to integration testing l Top-down testing • Start with high-level system and integrate from the top-down replacing individual components by stubs where appropriate l Bottom-up testing • Integrate individual components in levels until the complete system is created l In practice, most integration involves a combination of these strategies âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 33
34. Top-down testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 34
35. Bottom-up testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 35
36. Tetsing approaches l Architectural validation • Top-down integration testing is better at discovering errors in the system architecture l System demonstration • Top-down integration testing allows a limited demonstration at an early stage in the development l Test implementation • Often easier with bottom-up integration testing l Test observation • Problems with both approaches. Extra code may be required to observe tests âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 36
37. Interface testing l Takes place when modules or sub-systems are integrated to create larger systems l Objectives are to detect faults due to interface errors or invalid assumptions about interfaces l Particularly important for object-oriented development as objects are defined by their interfaces âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 37
38. Interface testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 38
39. Interfaces types l Parameter interfaces • Data passed from one procedure to another l Shared memory interfaces • Block of memory is shared between procedures l Procedural interfaces • Sub-system encapsulates a set of procedures to be called by other sub-systems l Message passing interfaces • Sub-systems request services from other sub-systems âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 39
40. Interface errors l Interface misuse • A calling component calls another component and makes an error in its use of its interface e.g. parameters in the wrong order l Interface misunderstanding • A calling component embeds assumptions about the behaviour of the called component which are incorrect l Timing errors • The called and the calling component operate at different speeds and out-of-date information is accessed âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 40
41. Interface testing guidelines l Design tests so that parameters to a called procedure are at the extreme ends of their ranges l Always test pointer parameters with null pointers l Design tests which cause the component to fail l Use stress testing in message passing systems l In shared memory systems, vary the order in which components are activated âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 41
42. Stress testing l Exercises the system beyond its maximum design load. Stressing the system often causes defects to come to light l Stressing the system test failure behaviour Systems should not fail catastrophically. Stress testing checks for unacceptable loss of service or data l Particularly relevant to distributed systems which can exhibit severe degradation as a network becomes overloaded âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 42
43. Object-oriented testing l The components to be tested are object classes that are instantiated as objects l Larger grain than individual functions so approaches to white-box testing have to be extended l No obvious ‘top’ to the system for top-down integration and testing âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 43
44. Testing levels l Testing operations associated with objects l Testing object classes l Testing clusters of cooperating objects l Testing the complete OO system âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 44
45. Object class testing l Complete test coverage of a class involves • Testing all operations associated with an object • Setting and interrogating all object attributes • Exercising the object in all possible states l Inheritance makes it more difficult to design object class tests as the information to be tested is not localised âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 45
46. Weather station object interface l Test cases are needed for all operations l Use a state model to identify state transitions for testing l Examples of testing sequences • Shutdown đ Waiting đ Shutdown • Waiting đ Calibrating đ Testing đ Transmitting đ Waiting • Waiting đ Collecting đ Waiting đ Summarising đ Transmitting đ Waiting âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 46
47. Object integration l Levels of integration are less distinct in object- oriented systems l Cluster testing is concerned with integrating and testing clusters of cooperating objects l Identify clusters using knowledge of the operation of objects and the system features that are implemented by these clusters âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 47
48. Approaches to cluster testing l Use-case or scenario testing • Testing is based on a user interactions with the system • Has the advantage that it tests system features as experienced by users l Thread testing • Tests the systems response to events as processing threads through the system l Object interaction testing • Tests sequences of object interactions that stop when an object operation does not call on services from another object âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 48
49. Scenario-based testing l Identify scenarios from use-cases and supplement these with interaction diagrams that show the objects involved in the scenario l Consider the scenario in the weather station system where a report is generated âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 49
50. Collect weather data âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 50
51. Weather station testing l Thread of methods executed • CommsController:request đ WeatherStation:report đ WeatherData:summarise l Inputs and outputs • Input of report request with associated acknowledge and a final output of a report • Can be tested by creating raw data and ensuring that it is summarised properly • Use the same raw data to test the WeatherData object âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 51
52. Testing workbenches l Testing is an expensive process phase. Testing workbenches provide a range of tools to reduce the time required and total testing costs l Most testing workbenches are open systems because testing needs are organisation-specific l Difficult to integrate with closed design and analysis workbenches âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 52
53. A testing workbench âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 53
54. Tetsing workbench adaptation l Scripts may be developed for user interface simulators and patterns for test data generators l Test outputs may have to be prepared manually for comparison l Special-purpose file comparators may be developed âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 54
55. Key points l Test parts of a system which are commonly used rather than those which are rarely executed l Equivalence partitions are sets of test cases where the program should behave in an equivalent way l Black-box testing is based on the system specification l Structural testing identifies test cases which cause all paths through the program to be executed âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 55
56. Key points l Test coverage measures ensure that all statements have been executed at least once. l Interface defects arise because of specification misreading, misunderstanding, errors or invalid timing assumptions l To test object classes, test all operations, attributes and states l Integrate object-oriented systems around clusters of objects âIan Sommerville 2000 Software Engineering, 6th edition. Chapter 20 Slide 56