Paper: SCOTCH: Improving Test-to-Code Traceability using Slicing and Conceptual Coupling Authors: Abdallah Qusef, Gabriele Bavota, Rocco Oliveto, Andrea De Lucia, David Binkley Session: Research Track Session 3: Dynamic Analysis

1. SCOTCH
Improving Test-to-Code Traceability
using Slicing and Conceptual Coupling
Abdallah Qusef*, Gabriele Bavota*, Rocco Oliveto!
Andrea De Lucia*, David Binkley"
* Software Engineering Lab, University of Salerno, Italy
! STAT Department, University of Molise, Italy
" Loyola University Maryland, USA

2. Context
Test-to-code traceability recovery
SCOTCH
Slicing and COupling based Test to Code trace Hunter
Empirical Evaluation
SCOTCH vs Naming Convention vs LCBA vs DFA

3. context
Test-to-code traceability recovery

4. TestSuiteClass
go al
Class_1
TES
TED
CLA Class_2
SS
TES
TED
CLA
SS

5. Test-to-code traceability
Software Comprehension
Regression Testing
Impact Analysis
Refactoring

6. retrieve links between classes
challenges

7. test-to-code traceability
Class_1
ll s Class_2
ca
TestSuite
calls
calls
Class_3
ca
lls
Class_4
challenges

8. test-to-code traceability
Class_1
hel
per
cla
ss
ll s Class_2
ca
TES
TestSuite TED
CLA
calls SS
calls
Class_3
ca
lls moc
Class_4 obj k
ect
hel
per
cla
ss
challenges

9. state of the art

10. state of the art
Van Rompaey et al. Qusef et al.
CSMR 2009 ICSM 2010

11. state of the art
Last Call Before Assert
Naming Convention
Van Rompaey et al. Qusef et al.
CSMR 2009 ICSM 2010

12. state of the art
Data Flow Analysis
Van Rompaey et al. Qusef et al.
CSMR 2009 ICSM 2010

13. SCOTCH
Slicing and
COupling based
Test to
Code trace
Hunter

14. TestSuite
assertTrue(--)
Identifying the last assert
statement for each method slicing critirion
Dynamic Slicing
Class in STS
Extracting the classes slice
Class in CTS
Conceptual Coupling

15. example
public class RemoveElementsTest extends TestCase {
public void testRemoveElement () {
! ! ConnectedGraphFactory factory = ConnectedGraphFactory.newFactory();
! ! ConnectedGraph graph = factory.newGraph();
! ! NodeElement node1 = graph.getStartNode();
! ! NodeElement node2 = graph.newNode();
! ! ... ... ...
!
! ! EdgeElement edge1, edge2, edge3, edge4, edge5;
! ! edge1 = graph.newEdge(node1, node2);
! ! edge2 = graph.newEdge(node2, node3);
! ! ... ... ...
! ! try {
! ! ! removedElement = graph.removeElement(edge2);
! ! ! fail("DisconnectedGraphException expected");
! ! } catch (DisconnectedGraphException e) {
! ! ! assertTrue(true);
! ! }
}
!
}

16. example
public class RemoveElementsTest extends TestCase {
public void testRemoveElement () {
! ! ConnectedGraphFactory factory = ConnectedGraphFactory.newFactory();
! ! ConnectedGraph graph = factory.newGraph();
! ! NodeElement node1 = graph.getStartNode();
! ! NodeElement node2 = graph.newNode();
! ! ... ... ...
!
! ! EdgeElement edge1, edge2, edge3, edge4, edge5;
! ! edge1 = graph.newEdge(node1, node2);
! ! edge2 = graph.newEdge(node2, node3);
! ! ... ... ...
! ! try {
! ! ! removedElement = graph.removeElement(edge2);
! ! ! fail("DisconnectedGraphException expected");
! ! } catch (DisconnectedGraphException e) {
assertTrue(true);
! ! }
}
!
}

17. example
STS - Dynamic Slicing Output
Disconnected ConnectedGraph
EdgeElement NodeElement ConnectedGraph
GraphException Factory
ConnectedGraph 0.60
ConnectedGraphFactory 0.56 t = * max(CCBC)
EdgeElement 0.49
NodeElement 0.48 = 0.95
DisconnectedGraphException 0.10

18. example
STS - Dynamic Slicing Output
Disconnected ConnectedGraph
EdgeElement NodeElement ConnectedGraph
GraphException Factory
ConnectedGraph 0.60 t = 0.95 * 0.60 = 0.57
ConnectedGraphFactory 0.56
EdgeElement 0.49
NodeElement 0.48
DisconnectedGraphException 0.10

19. example
STS - Dynamic Slicing Output
Disconnected ConnectedGraph
EdgeElement NodeElement ConnectedGraph
GraphException Factory
ConnectedGraph 0.60 CTS - Filtered by CCBC
ConnectedGraphFactory 0.56
ConnectedGraph
EdgeElement 0.49
NodeElement 0.48
DisconnectedGraphException 0.10

20. empirical evaluation

21. results
NC
85
72
59
F-Measure
46
33
20
AgilePlanner ArgoUML eXVantage

22. NC applicability
#CUTs=1 #CUTs=1 and NC applied
100
75
50
25
0
AgilePlanner ArgoUML eXVantage

23. results
NC LCBA
85
72
59
F-Measure
46
33
20
AgilePlanner ArgoUML eXVantage

24. results
NC LCBA DFA
85
72
59
F-Measure
46
33
20
AgilePlanner ArgoUML eXVantage

25. results
NC LCBA DFA SCOTCH
85
72
59
F-Measure
46
33
20
AgilePlanner ArgoUML eXVantage

26. future work
conclusion

27. ...conclusion...
SCOTCH: how to overcome the limitations
of the state of the art techniques

28. ...conclusion...
SCOTCH outperforms the state of the art techniques

29. ...future work...
replicate the experiment on different datasets
investigate about other heuristics

30. Thank you!
Questions and/or
comments
Gabriele Bavota
PHD student
se@sa Lab, Univeristy of Salerno
gbavota@unisa.it