Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 2 Objectives (Chapter 22) l To introduce software verification and validation and to discuss the distinction between them l To describe the program inspection process and its role in V & V l To explain static analysis as a verification technique l To describe the Cleanroom software development process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 3 Objectives (Chapter 23) l To discuss the distinctions between validation testing and defect testing l To describe the principles of system and component testing l To describe strategies for generating system test cases l To understand the essential characteristics of tool used for test automation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 4 Topics covered l Verification and validation planning l Software inspections l Automated static analysis l Testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 5 l Verification: "Are we building the product right?” l The software should conform to its specification. l Validation: "Are we building the right product?” l The software should do what the user really requires. Verification vs validation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 6 l Is a whole life-cycle process - V & V must be applied at each stage in the software process. l Has two principal objectives The discovery of defects in a system; The assessment of whether or not the system is useful and useable in an operational situation. The V & V process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 7 V & V goals l Verification and validation should establish confidence that the software is fit for purpose. l This does not mean completely free of defects. l Rather, it must be good enough for its intended use and the type of use will determine the degree of confidence that is needed.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 8 V & V confidence l Depends on system’s purpose, user expectations and marketing environment Software function The level of confidence depends on how critical the software is to an organisation. User expectations Users may have low expectations of certain kinds of software. Marketing environment Getting a product to market early may be more important than finding defects in the program.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 9 l Software testing. Concerned with exercising and observing product behaviour (dynamic verification) The system is executed with test data and its operational behaviour is observed l Software inspections. Concerned with analysis of the static system representation to discover problems (static verification) May be supplement by tool-based document and code analysis Static and dynamic verification

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 10 Static and dynamic V&V Formal specification High-level design Requirements specification Detailed design Program Prototype Program testing Software inspections

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 11 l Can reveal the presence of errors NOT their absence. l Should be used in conjunction with static verification to provide full V&V coverage. Program testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 12 l Defect testing Tests designed to discover system defects. A successful defect test is one which reveals the presence of defects in a system. l Validation testing Intended to show that the software meets its requirements. A successful test is one that shows that a requirements has been properly implemented. Types of testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 13 l Defect testing and debugging are distinct processes. l Verification and validation is concerned with establishing the existence of defects in a program. l Debugging is concerned with locating and repairing these errors. l Debugging involves formulating a hypothesis about program behaviour then testing these hypotheses to find the system error. Testing and debugging

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 14 The debugging process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 15 l Careful planning is required to get the most out of testing and inspection processes. l Planning should start early in the development process. l The plan should identify the balance between static verification and testing. l Test planning is about defining standards for the testing process rather than describing product tests. V & V planning

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 16 The V-model of development

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 17 The structure of a software test plan l The testing process. l Requirements traceability. l Tested items. l Testing schedule. l Test recording procedures. l Hardware and software requirements. l Constraints.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 18 The software test plan

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 20 Software inspections l These involve people examining the source representation with the aim of discovering anomalies and defects. l Inspections do not require execution of a system so may be used before implementation. l They may be applied to any representation of the system (requirements, design, configuration data, test data, etc.). l They have been shown to be an effective technique for discovering program errors.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 21 Inspection success l Many different defects may be discovered in a single inspection. In testing, one defect, may mask another so several executions are required. l Reuse domain and programming knowledge so reviewers are likely to have seen the types of error that commonly arise.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 22 Inspections and testing l Inspections and testing are complementary and not opposing verification techniques. l Both should be used during the V & V process. l Inspections can check conformance with a specification but not conformance with the customer’s real requirements. l Inspections cannot check non-functional characteristics such as performance, usability, etc.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 23 Program inspections l Formalised approach to document reviews l Intended explicitly for defect detection (not correction). l Defects may be logical errors, anomalies in the code that might indicate an erroneous condition (e.g. an uninitialised variable) or non-compliance with standards.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 24 Ingredients of effective inspections l Team preparation A precise specification must be available. Team members must be familiar with the organisation standards. Syntactically correct code or other system representations must be available. An error checklist should be prepared. l Management support Management must accept that inspection will increase costs early in the software process. Management should not use inspections for staff appraisal ie finding out who makes mistakes.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 25 The inspection process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 26 Inspection procedure l System overview presented to inspection team. l Inspection team prepares in advance. l Inspection meeting takes place and discovered errors are noted. l Modifications are made to repair discovered errors. l Re-inspection may or may not be required.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 27 Inspection roles

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 28 Inspection checklists l Checklist of common errors should be used to drive the inspection. l Error checklists are programming language dependent and reflect the characteristic errors that are likely to arise in the language. l In general, the 'weaker' the type checking, the larger the checklist. l Examples: Initialisation, Constant naming, loop termination, array bounds, etc.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 29 Inspection checks 1

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 30 Inspection checks 2

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 31 Recommended inspection rate l 500 statements/hour during overview. l 125 source statement/hour during individual preparation. l 90-125 statements/hour can be inspected. l Inspection is therefore an expensive process. l Inspecting 500 lines costs about 40 staff/hours effort. l This cost is offset by lower testing costs.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 33 Automated static analysis l Static analysers are software tools for source text processing. l They parse the program text and try to discover potentially erroneous conditions and bring these to the attention of the V & V team. l They are very effective as an aid to inspections - they are a supplement to but not a replacement for inspections.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 34 Static analysis checks

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 35 Stages of static analysis l Control flow analysis. Checks for loops with multiple exit or entry points, finds unreachable code, etc. l Data use analysis. Detects uninitialised variables, variables written twice without an intervening assignment, variables which are declared but never used, etc. l Interface analysis. Checks the consistency of routine and procedure declarations and their use. Checks for type consistency among variables in expressions, especially useful with heavy usage of implicit and explicit typecasting.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 36 Stages of static analysis l Information flow analysis. Also called program slicing. Identifies the dependencies of output variables. Does not detect anomalies itself but highlights information for code inspection or review. l Path analysis. Identifies paths through the program and sets out the statements executed in that path. Again, potentially useful in the review process as well as test case identification. l Both these stages generate vast amounts of information. They must be used with care.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 37 Examples l Lint – performs static analysis of C code. Uninitialized variables. Doubly initialized variables. Potentially inconsistent type casting. Unused variables. Unreachable code. “Unsafe” statements. Etc. l LCLint – detects higher level errors Checks variable use against specified constraints (embedded as annotations in code comments.)

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 38 LINT static analysis

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 39 Use of static analysis l Particularly valuable when a language such as C is used which has weak typing and hence many errors are undetected by the compiler, l Less cost-effective for languages like Java that have strong type checking and can therefore detect many errors during compilation.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 40 Verification and formal methods l Formal methods can be used when a mathematical specification of the system is produced. l They are the ultimate static verification technique. l They involve detailed mathematical analysis of the specification and may develop formal arguments that a program conforms to its mathematical specification. l They employ techniques derived from automated theorem proving.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 41 Arguments for formal methods l Producing a mathematical specification requires a detailed analysis of the requirements and this is likely to uncover errors. l They can detect implementation errors before testing when the program is analysed alongside the specification.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 42 Arguments against formal methods l Require specialised notations that cannot be understood by domain experts. l Very expensive to develop a specification and even more expensive to show that a program meets that specification. l It may be possible to reach the same level of confidence in a program more cheaply using other V & V techniques.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 43 l The name is derived from the 'Cleanroom' process in semiconductor fabrication. l In cleanroom semiconductor fabrication, the level of contaminants is highly controlled, assuring that the manufactured product is free of defects injected by its environment. l The philosophy of cleanroom software development is defect avoidance rather than defect removal. l This software development process is based on: Incremental development; Formal specification; Static verification (inspection) using correctness arguments; Statistical testing to determine program reliability. Cleanroom software development

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 44 The Cleanroom process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 45 Cleanroom process characteristics l Formal specification using a state transition model. l Incremental development where the customer prioritises increments. l Structured programming - limited control and abstraction constructs are used in the program. l Static verification using rigorous inspections. l Statistical testing of the system (covered in Ch. 24).

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 46 Formal specification and inspections l The state based model is produced as a system specification and the inspection process checks the program against this model. l The programming approach is defined so that the correspondence between the model and the system is clear. l Mathematical arguments (not proofs) are used to increase confidence in the inspection process.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 47 l Specification team. Responsible for developing and maintaining the system specification. l Development team. Responsible for developing and verifying the software. The software is NOT executed or even compiled during this process. l Certification team. Responsible for developing a set of statistical tests to exercise the software after development. Reliability growth models used to determine when reliability is acceptable. Cleanroom process teams

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 48 l The results of using the Cleanroom process have been very impressive with few discovered faults in delivered systems. l Independent assessment shows that the process is no more expensive than other approaches. l There were fewer errors than in a 'traditional' development process. l However, the process is not widely used. It is not clear how this approach can be transferred to an environment with less skilled or less motivated software engineers. Cleanroom process evaluation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 50 Testing l System testing l Component testing l Test case design l Test automation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 51 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 System 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 52 Testing phases

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 53 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

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 54 Testing process goals l Validation testing To demonstrate to the developer and the system customer that the software meets its requirements; A successful test shows that the system operates as intended. l Defect testing To discover faults or defects in the software where its behaviour is incorrect or not in conformance with its specification; A successful test is a test that makes the system perform incorrectly and so exposes a defect in the system.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 55 The software testing process

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 56 l Only exhaustive testing can show a program is free from defects. However, exhaustive testing is impossible, l Testing policies define the approach to be used in selecting system tests: All functions accessed through menus should be tested; Combinations of functions accessed through the same menu should be tested; Where user input is required, all functions must be tested with correct and incorrect input. l Policies should be recorded in the test plan (tested items). Testing policies

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 58 System testing l Involves integrating components to create a system or sub-system. l May involve testing an increment to be delivered to the customer. l Two phases: Integration testing - the test team have access to the system source code. The system is tested as components are integrated. Release testing - the test team test the complete system to be delivered as a black-box.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 59 Integration strategies l Integration involves building a system from its components and testing it for problems that arise from component interactions. l Top-down integration Develop the skeleton of the system and populate it with components. l Bottom-up integration Integrate infrastructure components then add functional components. l To simplify error localisation, systems should be incrementally integrated.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 60 Incremental integration testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 61 Testing 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 62 Release testing l The process of testing a release of a system that will be distributed to customers. l Primary goal is to increase the supplier’s confidence that the system meets its requirements. l Release testing is usually black-box or functional testing Based on the system specification only; Testers do not have knowledge of the system implementation.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 63 Black-box testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 64 Testing guidelines l Testing guidelines are hints for the testing team to help them choose tests that will reveal defects in the system l Some guidelines Choose inputs that force the system to generate all error messages; Design inputs that cause buffers to overflow; Repeat the same input or input series several times; Force invalid outputs to be generated; Force computation results to be too large or too small.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 65 Where to look for faults l Four fundamental capabilities of all software systems: Accepts input from its environment Produces output and transmits it to environment Stores data internally in data structures Performs computations using input and stored data l If software does any of these wrong, it fails.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 66 Testing scenario

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 67 System tests

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 68 Use cases l Use cases can be a basis for deriving the tests for a system. They help identify operations to be tested and help design the required test cases. l From an associated sequence diagram, the inputs and outputs to be created for the tests can be identified.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 69 Collect weather data

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 70 Performance testing l Part of release testing may involve testing the emergent properties of a system, such as performance and reliability. l Performance tests usually involve planning a series of tests where the load is steadily increased until the system performance becomes unacceptable.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 71 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 Stress testing is particularly relevant to distributed systems that can exhibit severe degradation as a network becomes overloaded.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 72 Testing l System testing l Component testing l Test automation

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 73 Component testing l Component or unit testing is the process of testing individual components in isolation. l It is a defect testing process. l Components may be: Individual functions or methods within an object; Object classes with several attributes and methods; Composite components with defined interfaces used to access their functionality.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 74 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 75 Weather station object interface

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 76 Weather station state diagram

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 77 Weather station testing l Need to define test cases for reportWeather, calibrate, test, startup and shutdown. l Using a state model, identify sequences of state transitions to be tested and the event sequences to cause these transitions l For example: Waiting -> Calibrating -> Testing -> Transmitting -> Waiting

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 78 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. Interface testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 79 Interface testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 80 Interface types l Parameter interfaces Data passed from one procedure to another. l Shared memory interfaces Block of memory is shared between procedures or functions. 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-system.s

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 81 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 82 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 84 Test case design l Involves designing the test cases (inputs and outputs) used to test the system. l The goal of test case design is to create a set of tests that are effective in validation and defect testing. l Design approaches: Requirements-based testing; Partition testing; Structural testing.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 85 Requirements based testing l A general principle of requirements engineering is that requirements should be testable. l Consider each requirement and derive a set of tests for that requirement.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 86 LIBSYS requirements

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 87 LIBSYS tests

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 88 Partition testing 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 or domain where the program behaves in an equivalent way for each class member. l Test cases should be chosen from each partition. l Input equivalence partition – sets of data where all of the set members should be processed in a similar way. l Output equivalence partition – sets of program outputs that have common characteristics.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 89 Equivalence partitioning

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 90 Deriving test cases from equivalence partitions l Sources of information: software requirements specification or user documentation, also, tester’s experience. l From the given information, predict equivalence classes of inputs that are likely to detect defects in the implementation. l Once partitions have been identified, chose test cases from these partitions. Choose cases on the boundary of partition plus cases close to the midpoint.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 91 Example equivalence partitions Between 10000 and 99999 Less than 10000 More than 99999 9999 100005 100000 99999 Input values Between 4 and 10Less than 4More than 10 3 47 11 10 Number of input values “Program accepts 4 to 10 inputs that are 5-digit integers greater than or equal to 10000.”

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 92 Example: zip code l “Program accepts zip code input (a string of 5 integers) and displays a map centered on the zip code.” l Some equivalence partitions to test zip code inputs: Null string Incomplete string – “6818” String with nonnumeric characters – “68a@d” Very long string – “12345678901234567890…” 5-digit string but not in database – “99999” Valid: 5-digit string and in database – “68182”

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 93 Search routine specification procedure Search (Key : ELEM ; T: SEQ of ELEM; Found : in out BOOLEAN; L: in out ELEM_INDEX) ; Pre-condition -- the sequence has at least one element T’FIRST <= T’LAST Post-condition -- the element is found and is referenced by L ( Found and T (L) = Key) or -- the element is not in the array ( not Found and not (exists i, T’FIRST >= i <= T’LAST, T (i) = Key ))

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 94 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. Search routine - input partitions

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 95 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 96 Search routine - input partitions

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 97 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. Structural testing

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 98 Structural testing Component code Test outputs Test data Derives Tests

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 99 Binary search routine int bottom = 0; int top = elemArray.length – 1; int mid; r.found = false; r.Index = -1; while (bottom <= top) { mid = (top + bottom) / 2; if (elemArray[mid] == key) { r.index = mid; r.found = true; return; } else { if (elemArray[mid] < key) bottom = mid + 1; else top = mid – 1; } 1 2 3 4 5 6 7 8 9 10 11 12 13 14

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 100 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. Binary search - equiv. partitions

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 101 Binary search equiv. partitions

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 102 Binary search - test cases

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 103 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 – path coverage. 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 104 Steps l Draw the flow graph of the code. l Determine the cyclomatic complexity of the flow graph. Cyclomatic complexity (V(G)) – a measure of the complexity of a particular piece of code or algorithm. V(G) = P + 1, where P is number of binary decision points in the flow graph. V(G) = E – N + 2, where E is number of edges N is number of nodes V(G) gives the upper bound on the number of independent execution paths through the program. l Trace the flow graph to determine the set of independent paths. l Prepare test cases to force the execution of each path in the set. l Sometimes, a path cannot be tested in independent fashion because it is impossible to provide a combination of input data for it. Such paths should be tested as part of another path test.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 105 Binary search flow graph

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 106 l 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 14 l 1, 2, 3, 4, 5, 14 l 1, 2, 3, 4, 5, 6, 7, 11, 12, 5, … l 1, 2, 3, 4, 6, 7, 2, 11, 13, 5, … 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 Independent paths

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 107 Exercise void insertionSort(int numbers[], int array_size) { int i, j, index; 0: i = 1; 1: while (i < array_size) { 2: index = numbers[i]; 3: j = i; 4: while ((j > 0) && 5: (numbers[j-1] > index)) { 6: numbers[j] = numbers[j-1]; 7: j = j - 1; } 8: numbers[j] = index; 9: i++; } 1.Identify the independent paths. 2.Give values for “numbers” and “array_size” for each path, if possible.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 109 Test automation l Testing is an expensive process phase. Testing workbenches provide a range of tools to reduce the time required and total testing costs. l Systems such as JUnit support the automatic execution of tests. l Most testing workbenches are open systems because testing needs are organisation-specific. l They are sometimes difficult to integrate with closed design and analysis workbenches.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 110 Automated Test Infrastructure Example: JUnit Test TestCaseTestSuite TestResult run(TestResult) setUp() tearDown() testName run(TestResult) runTest() run(TestResult) addTest() ConcreteTestCase setUp() tearDown() runTest()

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 111 Using JUnit l Write new test case by subclassing from TestCase l Implement setUp() and tearDown() methods to initialize and clean up l Implement runTest() method to run the test harness and compare actual with expected values l Test results are recorded in TestResult l A collection of tests can be stored in TestSuite.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 112 A testing workbench

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 113 Testing 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.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 114 Key points l Verification and validation are not the same thing. Verification shows conformance with specification; validation shows that the program meets the customer’s needs. l Test plans should be drawn up as soon as requirements are stable in order to guide the testing process. l Static verification techniques (inspections, static analysis) involve examination and analysis of the program source code for error detection.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 115 Key points l Dynamic verification techniques (testing) can show the presence of faults in a system; it cannot prove there are no remaining faults. l System testing includes integration testing, release testing, performance and stress testing. l Component testing includes object class testing, interface testing. l Use experience and guidelines to design test cases from requirements and source code.

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation.

Similar presentations

Presentation on theme: "Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation."— Presentation transcript:

Similar presentations

About project

Feedback

Log in

Auth with social network:

Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation.

Similar presentations

Presentation on theme: "Modified from Sommerville’s originalsSoftware Engineering, 7th edition. Chapter 22 & 23 Slide 1 Verification and Validation."— Presentation transcript:

Similar presentations

About project

Feedback