Introduction to Software Testing Chapter 2, Sections: 2.1 & 2.2 Overview Graph Coverage Criteria

Transcription

1 Introduction to Software Testing Chapter 2, Sections: 2.1 & 2.2 Overview Graph Coverage Criteria Paul Ammann & Jeff Offutt retest/

2 Ch. 2 : Graph Coverage Four Structures for Modeling Software Graphs Logic Input Space Syntax Applied to Applied to Source FSMs Applied to Specs DNF Source Specs Source Models Design Use cases Integ Input Introduction to Software Testing (Ch 2) Ammann & Offutt 2

3 Covering Graphs (2.1) Graphs are the most commonly used structure for testing Graphs can come from many sources Control flow graphs Design structure FSMs and statecharts Use cases Tests usually are intended to cover the graph in some way Introduction to Software Testing (Ch 2) Ammann & Offutt 3

4 Definition of a Graph Introduction to Software Testing (Ch 2) Ammann & Offutt 4

5 Three Example Graphs Not a valid graph N 0 = { 0 } N 0 = { 0, 1, 2 } N 0 = { } N f = { 3 } N f = { 7, 8, 9 } N f = { 3 } E = {(0,1),(0,2),(1,3), (2,3)} Introduction to Software Testing (Ch 2) Ammann & Offutt 5

6 Paths in Graphs Path : A sequence of nodes [n 1, n 2,, n M ] Each pair of nodes is an edge Length : The number of edges A single node is a path of length 0 Subpath : A subsequence of nodes in p is a subpath of p Reach (n) : Subgraph that can be reached from n Paths [ 0, 3, 7 ] [ 1, 4, 8, 5, 1 ] [ 2, 6, 9 ] Reach ( 0 ) = { 0, 3, 4, 7, 8, 5, 1, 9 } Reach ( {0, 2} ) = G Reach ( [2,6] ) = { 2, 6, 9 } Introduction to Software Testing (Ch 2) Ammann & Offutt 6

7 Test Paths and SESEs Test Path : A path that starts at an initial node and ends at a final node Test paths represent execution of test cases Some test paths can be executed by many tests Some test paths cannot be executed by any tests SESE graphs : All test paths start at a single node and end at another node Single-entry, single-exit N 0 and N f have exactly one node Double-diamond graph Four test paths [ 0, 1, 3, 4, 6 ] [ 0, 1, 3, 5, 6 ] [ 0, 2, 3, 4, 6 ] [ 0, 2, 3, 5, 6 ] 2 5 Introduction to Software Testing (Ch 2) Ammann & Offutt 7

8 Visiting and Touring Visit : A test path p visits node n if n is in p A test path p visits edge e if e is in p Tour : A test path p tours subpath q if q is a subpath of p Path: [ 0, 1, 3, 4, 6 ] Visits nodes: { 0, 1, 3, 4, 6 } Visits edges: { (0, 1), (1, 3), (3, 4), (4, 6) } Tours subpaths { [0, 1, 3], [1, 3, 4], [3, 4, 6], [0, 1, 3, 4], [1, 3, 4, 6] } Introduction to Software Testing (Ch 2) Ammann & Offutt 8

9 Tests and Test Paths path(t): The test path executed by test t, note: t is a test case path(t): The set of test paths executed by the set of tests T note: T is a Test Set; set of test cases Each test executes one and only one test path (Deterministic) A location in a graph (node or edge) can be reached from another location if there is a sequence of edges from the first location to the second Syntactic reach : A subpath exists in the graph Semantic reach : A test exists that can execute that subpath can you Remember our talk about Reachability? Introduction to Software Testing (Ch 2) Ammann & Offutt 9

10 Tests and Test Paths test 1 many-to-one test 2 test 3 Test Path Deterministic software a test always executes the same test path test 1 test 2 test 3 many-to-many Test Path 1 Test Path 2 Test Path 3 Non-deterministic software a test can execute different test paths Introduction to Software Testing (Ch 2) Ammann & Offutt 10

11 Testing and Covering Graphs: Sec# 2.2 We use graphs in testing as follows : Developing a model of the software as a graph Requiring tests to visit or tour specific sets of nodes, edges, or subpaths Test Requirements (TR) : Properties that describe test paths Test Criterion (C) : Rules that define test requirements (TR) Satisfaction : Given a set TR of test requirements for a criterion C, a set of tests T satisfies C on a graph iff for every test requirement in TR, there is a test path in path(t) that meets the test requirement tr Graph Coverage Structural Coverage Criteria : Defined on a graph just in terms of nodes and edges (Control Flow Coverage Criteria) Data Flow Coverage Criteria : Requires a graph to be annotated with references to variables Introduction to Software Testing (Ch 2) Ammann & Offutt 11

12 Node Coverage The first (and simplest) two criteria require that each node and edge in a graph to be executed Node Coverage (NC) : Test set T satisfies node coverage on graph G iff for every syntactically reachable node n in N, there is some path p in path(t) such that p visits n. This statement is a bit cumbersome, so we abbreviate it in terms of the set of test requirements Node Coverage (NC) : TR contains each reachable node in G. Introduction to Software Testing (Ch 2) Ammann & Offutt 12

13 Edge Coverage Edge coverage is slightly stronger than node coverage Edge Coverage (EC) : TR contains each reachable path of length up to 1, inclusive, in G. The length up to 1 allows for graphs with one node and no edges NC and EC are only different when there is an edge and another subpath between a pair of nodes (as in an if-else statement) 0 Node Coverage : TR = { 0, 1, 2 } Test Path = { [ 0, 1, 2 ] } 1 2 Edge Coverage : TR = { (0,1), (0, 2), (1, 2) } Test Paths = { [ 0, 1, 2 ], [ 0, 2 ] } Introduction to Software Testing (Ch 2) Ammann & Offutt 13

14 Paths of Length 1 and 0 A graph with only one node will not have any edges 0 Formally, Edge Coverage needs to require Node Coverage on this graph Otherwise, Edge Coverage will not subsume (include) Node Coverage So we define length up to 1 instead of simply length 1 We have the same issue with graphs that only have one edge for Edge Pair Coverage 0 1 Introduction to Software Testing (Ch 2) Ammann & Offutt 14

15 Covering Multiple Edges Edge-pair coverage requires pairs of edges, or subpaths of length 2 Edge-Pair Coverage (EPC) : TR contains each reachable path of length up to 2, inclusive, in G. The length up to 2 is used to include graphs that have less than 2 edges EPC is valuable because it is useful to start the software in some state (that is, a node) and then follow transitions (that are, edges) so that the last state of one test is the same as the start state of another test. This type of testing is used to verify that the system is not changed by certain inputs. Introduction to Software Testing (Ch 2) Ammann & Offutt 15

16 Covering Multiple Edges Continue The logical extension is to require all paths Complete Path Coverage (CPC) : TR contains all paths in G. Unfortunately, this is impossible if the graph has a loop, So, a weak compromise is to make the tester decide which paths: Specified Path Coverage (SPC) : TR contains a set S of test paths, where S is supplied as a parameter. Introduction to Software Testing (Ch 2) Ammann & Offutt 16

17 1 0 Structural Coverage Example Node Coverage TR = { 0, 1, 2, 3, 4, 5, 6 } Test Paths: { [ 0, 1, 2, 3, 6 ], [ 0, 1, 2, 4, 5, 4, 6 ] } Edge Coverage TR = { (0,1), (0,2), (1,2), (2,3), (2,4), (3,6), (4,5), (4,6), (5,4) } Test Paths: { [ 0, 1, 2, 3, 6 ], [ 0, 2, 4, 5, 4, 6 ] } Edge-Pair Coverage TR = { [0,1,2], [0,2,3], [0,2,4], [1,2,3], [1,2,4], [2,3,6], [2,4,5], [2,4,6], [4,5,4], [5,4,5], [5,4,6] } Test Paths: { [ 0, 1, 2, 3, 6 ], [ 0, 1, 2, 4, 6 ], [ 0, 2, 3, 6 ], [ 0, 2, 4, 5, 4, 5, 4, 6 ] } Complete Path Coverage Test Paths:{ [ 0, 1, 2, 3, 6 ], [ 0, 1, 2, 4, 6 ], [ 0, 1, 2, 4, 5, 4, 6 ], [ 0, 1, 2, 4, 5, 4, 5, 4, 6 ], [ 0, 1, 2, 4, 5, 4, 5, 4, 5, 4, 6 ], } Introduction to Software Testing (Ch 2) Ammann & Offutt 17

18 Loops in Graphs If a graph contains a loop, it has an infinite number of paths Thus, CPC is not feasible (infeasible) SPC is not satisfactory because the results are subjective and vary with the tester Attempts to deal with loops: 1970s : Execute cycles once (i.e. [4, 5, 4] in previous example, informal) 1980s : Execute each loop, exactly once (formalized) 1990s : Execute loops 0 times, once, more than once (informal description) 2000s : Prime paths Introduction to Software Testing (Ch 2) Ammann & Offutt 18

19 Simple Paths and Prime Paths Simple Path : A path from node n i to n j is simple if no node appears more than once, except possibly the first and last nodes are the same No internal loops A loop is a simple path Includes all other subpaths Prime Path : A 1) simple path that 2) does not appear as a proper subpath of any other simple path. Introduction to Software Testing (Ch 2) Ammann & Offutt 19

20 Simple Paths and Prime Paths So, Prime Paths are: maximal length simple paths But not all Prime Paths Simple Paths: Length 0 [0], [1], [2], [3] Simple Paths: Length 1 [ 0, 1 ], [ 0, 2 ], [ 1, 3 ], [ 2, 3 ], [ 3, 0 ], Simple Paths: Length 2 [ 0, 1, 3 ], [ 0, 2, 3 ], [ 1, 3, 0 ], [ 2, 3, 0 ], [ 3, 0, 1 ], [ 3, 0, 2 ], Simple Paths: Length 3 [ 0, 1, 3, 0 ], [ 0, 2, 3, 0 ], [ 1, 3, 0, 1 ], [ 2, 3, 0, 2 ], [ 3, 0, 1, 3 ], [ 3, 0, 2, 3 ], [ 1, 3, 0, 2 ], [ 2, 3, 0, 1 ] Prime Paths: [ 0, 1, 3, 0 ], [ 0, 2, 3, 0 ], [ 1, 3, 0, 1 ], [ 2, 3, 0, 2 ], [ 3, 0, 1, 3 ], [ 3, 0, 2, 3 ], [ 1, 3, 0, 2 ], [ 2, 3, 0, 1 ] Introduction to Software Testing (Ch 2) Ammann & Offutt 20

21 Prime Path Coverage A simple, elegant, and finite criterion that requires loops to be executed as well as skipped Prime Path Coverage (PPC) : TR contains each prime path in G. Will tour all paths of length 0, 1, It subsumes node and edge coverage Note: The book has a mistake, PPC does not subsume EPC If a node n has an edge to itself, EPC will require: [n, n, m], But [n, n, m] is not prime Introduction to Software Testing (Ch 2) Ammann & Offutt 21

22 1 Simple & Prime Path Example Simple Paths Len 0 [0] [1] [2] [3] [4] [5] [6]! Len 1 [0, 1] [0, 2] [1, 2] [2, 3] [2, 4] [3, 6]! [4, 6]! [4, 5] [5, 4] Len 2 [0, 1, 2] [0, 2, 3] [0, 2, 4] [1, 2, 3] [1, 2, 4] [2, 3, 6]! [2, 4, 6]! [2, 4, 5]! [4, 5, 4] * [5, 4, 6]! [5, 4, 5] * Len 3 [0, 1, 2, 3] [0, 1, 2, 4] [0, 2, 3, 6]! [0, 2, 4, 6]! [0, 2, 4, 5]! [1, 2, 3, 6]! [1, 2, 4, 5]! [1, 2, 4, 6]!! : path terminates cannot be extended * : path cycles 6 5 Len 4 [0, 1, 2, 3, 6]! [0, 1, 2, 4, 6]! [0, 1, 2, 4, 5]! Prime Paths??? Introduction to Software Testing (Ch 2) Ammann & Offutt 22

23 Prime Path Example The previous example has 38 simple paths Only nine prime paths Prime Paths [ 0, 1, 2, 3, 6 ] [ 0, 1, 2, 4, 5 ] [ 0, 1, 2, 4, 6 ] [ 0, 2, 3, 6 ] [ 0, 2, 4, 5] [ 0, 2, 4, 6 ] [ 5, 4, 6 ] [ 4, 5, 4 ] [ 5, 4, 5 ] Execute loop 0 times Execute loop once Execute loop more than once Introduction to Software Testing (Ch 2) Ammann & Offutt 23

24 Touring, Sidetrips and Detours Prime paths do not have internal loops test paths might Tour : A test path p tours subpath q iff q is a subpath of p Tour With Sidetrips : A test path p tours subpath q with sidetrips iff every edge in q is also in p in the same order The tour can include a sidetrip, as long as it comes back to the same node Tour With Detours : A test path p tours subpath q with detours iff every node in q is also in p in the same order The tour can include a detour from node n i, as long as it comes back to the prime path at a successor of n i ( only one edge of p can be skipped ) Introduction to Software Testing (Ch 2) Ammann & Offutt 24

25 Sidetrips and Detours Example Touring without sidetrips or detours 3 Touring with a sidetrip Touring with a detour Introduction to Software Testing (Ch 2) Ammann & Offutt 25

26 Round Trips Round-Trip Path : A prime path that starts and ends at the same node Simple Round Trip Coverage (SRTC) : TR contains at least one round-trip path for each reachable node in G that begins and ends a round-trip path. Complete Round Trip Coverage (CRTC) : TR contains all round-trip paths for each reachable node in G. These criteria omit nodes and edges that are not in round trips That is, they do not subsume edge-pair, edge, or node coverage Introduction to Software Testing (Ch 2) Ammann & Offutt 26

27 Infeasible Test Requirements An infeasible test requirement cannot be satisfied Unreachable statement (dead code) A subpath that can only be executed if a contradiction occurs (i.e. X > 0 and X < 0) Most test criteria have some infeasible test requirements It is usually undecidable whether all test requirements are feasible When sidetrips are not allowed, many structural criteria have more infeasible test requirements Always, allowing sidetrips weakens the test criteria Practical recommendation Best Effort Touring Satisfy as many test requirements as possible without sidetrips Allow sidetrips to try to satisfy unsatisfied test requirements Introduction to Software Testing (Ch 2) Ammann & Offutt 27

28 Data Flow Criteria Goal: Try to ensure that values are computed and used correctly Definition (def) : A location where a value for a variable is stored into memory Use : A location where a variable s value is accessed def (n) or def (e) : The set of variables that are defined by node n or edge e use (n) or use (e) : The set of variables that are used by node n or edge e X = Z = X*2 4 5 Z = X-8 6 Defs: def (0) = { X } def (4) = { Z } def (5) = { Z } Uses: use (4) = { X } use (5) = { X } Introduction to Software Testing (Ch 2) Ammann & Offutt 28

29 DU Pairs and DU Paths du-pair : A pair of locations (l i, l j ) such that a variable v is defined at l i and used at l j def-clear : A path from l i to l j is def-clear with respect to variable v if v is not given another value on any of the nodes or edges in the path reach : If there is a def-clear path from l i to l j with respect to v, the def of v at l i reaches the use at l j du-path : A simple subpath that is def-clear with respect to v from a def of v to a use of v du (n i, n j, v) the set of du-paths from n i to n j du (n i, v) the set of du-paths that start at n i Introduction to Software Testing (Ch 2) Ammann & Offutt 29

30 Touring DU-Paths A test path p du-tours subpath d with respect to v if p tours d and the subpath taken is def-clear with respect to v Sidetrips can be used, just as with previous touring Three criteria Use every def Get to every use Follow all du-paths Introduction to Software Testing (Ch 2) Ammann & Offutt 30

31 Data Flow Test Criteria First, we make sure every def reaches a use All-Defs Coverage (ADC) : For each set of du-paths S = du (n, v), TR contains at least one path d in S. Then we make sure that every def reaches all possible uses All-Uses Coverage (AUC) : For each set of du-paths to uses S = du (n i, n j, v), TR contains at least one path d in S. Finally, we cover all the paths between defs and uses All-du-paths Coverage (ADUPC) : For each set S = du (n i, n j, v), TR contains every path d in S. Introduction to Software Testing (Ch 2) Ammann & Offutt 31

32 Data Flow Testing Example Z = X*2 X = Z = X-8 All-defs for X All-uses for X All-du-paths for X [ 0, 1, 3, 4 ] [ 0, 1, 3, 4 ] [ 0, 1, 3, 5 ] [ 0, 1, 3, 4 ] [ 0, 2, 3, 4 ] [ 0, 1, 3, 5 ] [ 0, 2, 3, 5 ] Introduction to Software Testing (Ch 2) Ammann & Offutt 32

33 Graph Coverage Criteria Subsumption Complete Path Coverage CPC All-DU-Paths Coverage ADUP Edge-Pair Coverage EPC Prime Path Coverage PPC All-uses Coverage AUC Edge Coverage EC Complete Round Trip Coverage CRTC All-defs Coverage ADC Node Coverage NC Simple Round Trip Coverage SRTC Introduction to Software Testing (Ch 2) Ammann & Offutt 33