coverage driven test code generation
play

Coverage-Driven Test Code Generation for Concurrent Classes Valerio - PowerPoint PPT Presentation

Apr 01, 2024 •297 likes •1.41k views

Coverage-Driven Test Code Generation for Concurrent Classes Valerio Terragni Shing-Chi Cheung Department of Computer Science and Engineering The Hong Kong University of Science and Technology {vterragni, scc}@cse.ust.hk 20 May 2016 1

  1. ConSuite Context and synchronization insensitivity misses the [Steenbuck et al., generation of this failure inducing test code ICST 2013] public class CUT{ final CUT sout = new CUT(); int x= 0, z =0; T1 T2 sout .m1(0); sout .m2() z = 1 sout .m3(10); public void m3(int v1){ if(z ==0){ synchronized (this){ m4(v1); private void m4(int v1){ } $temp = x; } else x = $temp + v1; m4(v1); } } 9

  2. ConSuite Context and synchronization insensitivity misses the [Steenbuck et al., generation of this failure inducing test code ICST 2013] public class CUT{ final CUT sout = new CUT(); int x= 0, z =0; T1 T2 sout .m1(0); sout .m2() z = 1 sout .m3(10); public void m3(int v1){ if(z ==0){ synchronized (this){ m4(v1); private void m4(int v1){ } $temp = x; } else x = $temp + v1; m4(v1); } } 9

  3. ConSuite Context and synchronization insensitivity misses the [Steenbuck et al., generation of this failure inducing test code ICST 2013] public class CUT{ final CUT sout = new CUT(); int x= 0, z =0; T1 T2 sout .m1(0); sout .m2() z = 1 sout .m3(10); public void m3(int v1){ if(z ==0){ synchronized (this){ m4(v1); private void m4(int v1){ } $temp = x; } else x = $temp + v1; m4(v1); } } 9

  4. ConSuite Context and synchronization insensitivity misses the [Steenbuck et al., generation of this failure inducing test code ICST 2013] public class CUT{ final CUT sout = new CUT(); int x= 0, z =0; T1 T2 sout .m1(0); sout .m2() z = 1 sout .m3(10); FEASIBLE interleaving public void m3(int v1){ $temp = x; if(z ==0){ x= n synchronized (this){ m4(v1); x; = $temp + v1; private void m4(int v1){ } $temp = x; } else x = $temp + v1; m4(v1); } } 9

  5. ConSuite Context and synchronization insensitivity misses the [Steenbuck et al., generation of this failure inducing test code ICST 2013] public class CUT{ final CUT sout = new CUT(); int x= 0, z =0; T1 T2 sout .m1(0); sout .m2() z = 1 sout .m3(10); FEASIBLE interleaving public void m3(int v1){ $temp = x; if(z ==0){ x= n synchronized (this){ m4(v1); x; = $temp + v1; private void m4(int v1){ } $temp = x; } else x = $temp + v1; Without context and synchronization m4(v1); sensitivity this test is unlikely generated } } 9

  6. Our Intuition Step 1 Collect context-insensitive coverage requirements (statically) Step 2 Coverage-driven test code generation 10

  7. Our Intuition Step 1 Collect context-insensitive coverage requirements (statically) Step 2 Coverage-driven test code generation  Context-sensitive and synchronization-sensitive information can be collected precisely and efficiently during sequential test code generation 10

  8. Our Intuition Step 1 Collect context-insensitive coverage requirements (statically) Step 2 Coverage-driven test code generation  Context-sensitive and synchronization-sensitive information can be collected precisely and efficiently during sequential test code generation  Coverage metric (Sequential coverage)  Granularity at outer-most method call  Ordered sequence of object’s fields accesses  Context and synchronization sensitive  lock acquires and releases  calling context 10

  9. AutoConTest 11

  10. AutoConTest class Call Sequence CUT Generator increase sequential coverage 11

  11. AutoConTest class Call Sequence Concurrent Test final CUT sout = new CUT(); CUT Generator Assembler T1 T2 increase sequential coverage pairwise combinations 11

  12. AutoConTest class Call Sequence Concurrent Test final CUT sout = new CUT(); CUT Generator Assembler T1 T2 increase sequential coverage pairwise combinations Interleaving Explorer compute the interleaving based coverage requirements $temp = x; x= n x; = $temp + v1; 11

  13. Call Sequence Generator class Call Sequence CUT Generator 12

  14. Call Sequence Generator class Call Sequence CUT Generator CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  15. Call Sequence Generator public void m3(int v1){ class Call Sequence if(z ==0){ CUT synchronized (this){ Generator m4(v1); } } else m4(v1); } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  16. Call Sequence Generator public void m3(int v1){ class Call Sequence if(z ==0){ CUT synchronized (this){ Generator m4(v1); } } else m4(v1); } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  17. Call Sequence Generator public void m3(int v1){ class Call Sequence if(z ==0){ CUT synchronized (this){ Generator m4(v1); } } else m4(v1); } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  18. Call Sequence Generator public void m3(int v1){ class Call Sequence if(z ==0){ CUT synchronized (this){ Generator m4(v1); } } else m4(v1); } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  19. Call Sequence Generator private void m4(int v1){ class Call Sequence $temp = x; CUT x = $temp + 1; Generator } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  20. Call Sequence Generator private void m4(int v1){ class Call Sequence $temp = x; CUT x = $temp + 1; Generator } CUT sout = new CUT(); sout .m3(10); sout .m2(); 12

  21. Call Sequence Generator private void m4(int v1){ class Call Sequence $temp = x; CUT x = $temp + 1; Generator } CUT sout = new CUT(); new m3’s behaviour sout .m3(10); sout .m2(); 12

  22. Call Sequence Generator class Call Sequence CUT Generator public void m2(){ z = 1; } CUT sout = new CUT(); new m3’s behaviour sout .m3(10); sout .m2(); 12

  23. Call Sequence Generator class Call Sequence CUT Generator public void m2(){ z = 1; } CUT sout = new CUT(); new m3’s behaviour sout .m3(10); new m2’s behaviour sout .m2(); 12

  24. Call Sequence Generator class Call Sequence CUT Generator increase sequential public void m2(){ coverage z = 1; } CUT sout = new CUT(); new m3’s behaviour sout .m3(10); new m2’s behaviour sout .m2(); 12

  25. Call Sequence Generator class Call Sequence CUT Generator public void m2(){ z = 1; } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  26. Call Sequence Generator class Call Sequence CUT Generator public void m2(){ z = 1; } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  27. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  28. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  29. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  30. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  31. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  32. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator m4(v1); } } public void m2(){ } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); 12

  33. Call Sequence Generator public void m3(int v1){ private void m4(int v1){ class Call Sequence if(z ==0){ $temp = x; CUT synchronized (this){ x = $temp + 1; Generator increase m4(v1); } sequential } public void m2(){ coverage } else z = 1; m4(v1); } } CUT sout = new CUT(); sout .m2(); sout .m3(10); new m3’s behaviour 12

  34. Call Sequence Generator CUT sout = new CUT(); Search Space   CUT methods  fixed pool of parameters values (at each iteration) 13

  35. Call Sequence Generator CUT sout = new CUT(); Search Space   CUT methods sout .m1(1);  fixed pool of parameters values (at each iteration) 13

  36. Call Sequence Generator CUT sout = new CUT(); Search Space   CUT methods sout .m1(1); sout .m3(10);  fixed pool of parameters sout .m2(); sout .m1(0); values (at each iteration) ……. ……. 13

  37. Call Sequence Generator CUT sout = new CUT(); Search Space   CUT methods sout .m1(1); sout .m3(10);  fixed pool of parameters sout .m2(); sout .m1(0); values (at each iteration) ……. ……. sout .m1(1); sout .m3(10); sout .m1(0); sout .m2(); sout .m2(); ……. ……. 13

  38. Call Sequence Generator CUT sout = new CUT(); Search Space   CUT methods sout .m1(1); sout .m3(10);  fixed pool of parameters sout .m2(); sout .m1(0); values (at each iteration) ……. ……. sout .m1(1); sout .m3(10); sout .m1(0); sout .m2(); sout .m2(); ……. ……. CUT sout = new CUT(); sout .m3(10); sout .m2(); 13

  39. Call Sequence Generator CUT sout = new CUT();   sout .m3(10);  ……. ……. sout .m2(); ……. ……. CUT sout = new CUT(); sout .m3(10); sout .m2(); 13

  40. Call Sequence Generator Systematic exploration  CUT sout = new CUT();  DFS (search order) sout .m1(1); sout .m3(10); sout .m2(); sout .m1(0); ……. ……. sout .m1(1); sout .m3(10); sout .m1(0); sout .m2(); sout .m2(); ……. ……. Saturation-based stopping criterion  Stop extending a node if the latest K extensions have not increased the  sequential coverage 14

  41. Call Sequence Generator Systematic exploration  CUT sout = new CUT();  DFS (search order) sout .m1(1); sout .m3(10); sout .m2(); sout .m1(0); ……. ……. sout .m1(1); sout .m3(10); sout .m1(0); sout .m2(); sout .m2(); ……. ……. 15

  42. Call Sequence Generator Systematic exploration   DFS (search order) 15

  43. Call Sequence Generator   To minimize the number of tests and maximize the coverage  At each iteration identify an optimal sequence  with the highest coverage improvement # method calls that increase sequential coverage 15

  44. Call Sequence Generator   To minimize the number of tests and maximize the coverage  At each iteration identify an optimal sequence  with the highest coverage improvement # method calls that increase sequential coverage search space is too huge! 15

  45. Search Space Pruning Strategies Depth pruning 16

  46. Search Space Pruning Strategies Depth pruning 16

  47. Search Space Pruning Strategies Breadth pruning Depth pruning 16

  48. Search Space Pruning Strategies Breadth pruning Depth pruning 16

  49. Search Space Pruning Strategies Breadth pruning Depth pruning 16

  50. Search Space Pruning Strategies Assumption: The sequential execution of call sequences is deterministic Breadth pruning Depth pruning 16

  51. Search Space Pruning Strategies Assumption: The sequential execution of call sequences is deterministic Redundancy  Based on program states and sequential  coverage Breadth pruning Depth pruning 16

  52. Search Space Pruning Strategies Assumption: The sequential execution of call sequences is deterministic Redundancy  Based on program states and sequential  coverage Breadth pruning Depth pruning Theorem 1 The unexplored descendants of a node representing a redundant call sequence do not need to be explored in order to reach the optimal solution 16

  53. Search Space Pruning Strategies   Breadth pruning Depth pruning Theorem 1 The unexplored descendants of a node representing a redundant call sequence do not need to be explored in order to reach the optimal solution 16

  54. Concurrent Test Assembler class Call Sequence CUT Generator 17

  55. Concurrent Test Assembler class Call Sequence CUT Generator 17

  56. Concurrent Test Assembler class Call Sequence Concurrent Test CUT Generator Assembler 17

  57. Concurrent Test Assembler final CUT sout = new CUT(); class Call Sequence Concurrent Test T1 T2 CUT Generator Assembler final CUT sout = new CUT(); T1 T2 final CUT sout = new CUT(); The returned call sequences returned call  T1 T2 sequences are concurrently pair-wise tested Necessary condition for increasing  interleaving coverage (Theorem 2) 17

  58. Interleaving Explorer final CUT sout = new CUT(); class Call Sequence Concurrent Test T1 T2 CUT Generator Assembler sout .m1(0); sout .m2() sout .m3(10); Interleaving Explorer 18

  59. Interleaving Explorer final CUT sout = new CUT(); class Call Sequence Concurrent Test T1 T2 CUT Generator Assembler sout .m1(0); sout .m2() sout .m3(10); Interleaving Explorer Predictive Trace Analysis To compute the interleaving coverage (PTA) [Lai et al. ICSE 2016] requirements of the test code 18

  60. Interleaving Explorer final CUT sout = new CUT(); class Call Sequence Concurrent Test T1 T2 CUT Generator Assembler sout .m1(0); sout .m2() sout .m3(10); Interleaving Explorer To check if the requirements are Thread Scheduler feasible or infeasible 18

  61. Interleaving Explorer final CUT sout = new CUT(); class Call Sequence Concurrent Test T1 T2 CUT Generator Assembler sout .m1(0); sout .m2() sout .m3(10); Interleaving Explorer Challenge: non-deterministic interferences 18

  62. Subjects BUG Code Base Class Under Test CUT SLOC ID 1 Apache Commons 2.4 [..].lang.math.IntRange 278 2 Google Commons 1.0 [...]AbstractMultiMap$AsMap 1125 3 Java JDK 1.1.7 java.util.Vector 216 4 JFreeChart 0.9 [...]chart.axis.NumberAxis 1298 5 Java JDK 1.1.7 java.util.logging.Logger 992 6 Java JDK 1.4.2 java.util.Vector 326 6 real, known concurrency bugs atomic-set serializability violations 19

  63. RQ1:Cost-Effectiveness BUG ID Code Base CUT Time first SLOC fault 1 Apache Commons 2.4 278 22 sec 2 Google Commons 1.0 1125 29 sec 3 Java JDK 1.1.7 216 65 sec 4 JFreeChart 0.9 1298 35 sec 5 Java JDK 1.1.7 992 45 sec 6 Java JDK 1.4.2 326 30 sec 20

  64. RQ1:Cost-Effectiveness BUG ID Code Base CUT Time first SLOC fault 1 Apache Commons 2.4 278 22 sec 2 Google Commons 1.0 1125 29 sec 3 Java JDK 1.1.7 216 65 sec 4 JFreeChart 0.9 1298 35 sec 5 Java JDK 1.1.7 992 45 sec 6 Java JDK 1.4.2 326 30 sec 20

  65. RQ1:Cost-Effectiveness generate the first failing test code BUG ID Code Base CUT Time first and SLOC fault trigger the first faulty interleaving 1 Apache Commons 2.4 278 22 sec 2 Google Commons 1.0 1125 29 sec 3 Java JDK 1.1.7 216 65 sec 4 JFreeChart 0.9 1298 35 sec 5 Java JDK 1.1.7 992 45 sec 6 Java JDK 1.4.2 326 30 sec 20

  66. RQ1:Cost-Effectiveness generate the first failing test code BUG ID Code Base CUT Time first and SLOC fault trigger the first faulty interleaving 1 Apache Commons 2.4 278 22 sec 2 Google Commons 1.0 1125 29 sec 3 Java JDK 1.1.7 216 65 sec For all subjects the first generated 4 JFreeChart 0.9 1298 35 sec test manifested the bug 5 Java JDK 1.1.7 992 45 sec 6 Java JDK 1.4.2 326 30 sec 20

Recommend

CODE COVERAGE ISNT COVERAGE Wayne Roseberry Microsoft Author of Writing Test Plans Made

CODE COVERAGE ISNT COVERAGE Wayne Roseberry Microsoft Author of Writing Test Plans Made

CODE COVERAGE ISNT COVERAGE Wayne Roseberry Microsoft Author of Writing Test Plans Made Easy The Rules People respond to rewards and punishments Dont Chase The Numbers High Code Coverage <> Good But low coverage

388 views • 12 slides
TDD IN AN IoT WORLD Charles Korn 1 IoT? 2 What is TDD? 3 Test-driven development 4

TDD IN AN IoT WORLD Charles Korn 1 IoT? 2 What is TDD? 3 Test-driven development 4

TDD IN AN IoT WORLD Charles Korn 1 IoT? 2 What is TDD? 3 Test-driven development 4 Test-driven development Test-driven design 5 Its not just about testing your code 6 Its also about designing your code to be testable 7 CODE

995 views • 42 slides
Presentation Objectives Test coverage concepts Advantages of automated test coverage

Presentation Objectives Test coverage concepts Advantages of automated test coverage

Automated Test Coverage: Take Your Test Suites To the Next Level Presented By Jay Berkenbilt Apex CoVantage Solving the Software Quality Puzzle Page 1 www.psqtconference.com D Presentation Objectives Test coverage

412 views • 29 slides
Evolution of Test Automation State Driven Testing Jan De Coster November, 2011 Why test

Evolution of Test Automation State Driven Testing Jan De Coster November, 2011 Why test

Evolution of Test Automation State Driven Testing Jan De Coster November, 2011 Why test automation? Use computers to replace expensive manual testing Cant do it all manually Coverage of functionality Coverage of platforms

613 views • 20 slides
Test driven Non-Functionals?! --- Combine Two Big Ideas and What do You Get? --- Wilco Koorn

Test driven Non-Functionals?! --- Combine Two Big Ideas and What do You Get? --- Wilco Koorn

Test driven Non-Functionals?! --- Combine Two Big Ideas and What do You Get? --- Wilco Koorn Senior consultant Xebia IT Architects Sunday, April 14, 2013 Test driven development is Common Practice in Java world Test a little, code a

256 views • 12 slides
Logic-based test coverage Basic approach Clauses and predicates Basic coverage criteria: CC, PC,

Logic-based test coverage Basic approach Clauses and predicates Basic coverage criteria: CC, PC,

Logic-based test coverage Basic approach Clauses and predicates Basic coverage criteria: CC, PC, CoC Structural logic coverage of source code Logic coverage of specifications Active clause coverage criteria (GACC, CACC, RACC) Verificao e

829 views • 34 slides
MODEL-BASED, MUTATION-DRIVEN TEST CASE GENERATION VIA HEURISTIC-GUIDED BRANCHING SEARCH Andreas

MODEL-BASED, MUTATION-DRIVEN TEST CASE GENERATION VIA HEURISTIC-GUIDED BRANCHING SEARCH Andreas

MODEL-BASED, MUTATION-DRIVEN TEST CASE GENERATION VIA HEURISTIC-GUIDED BRANCHING SEARCH Andreas Fellner FMCAD Student Forum Wien, October 4th 2017 TEST CASE GENERATION WITH 1 Andreas Fellner TEST CASE GENERATION WITH Abstract Model UML /

358 views • 34 slides
Test Driven Developm ent Brian Nielsen Arne Skou bnielsen@cs.aau.dk ask@cs.aau.dk TDD D fi ifi

Test Driven Developm ent Brian Nielsen Arne Skou bnielsen@cs.aau.dk ask@cs.aau.dk TDD D fi ifi

Test Driven Developm ent Brian Nielsen Arne Skou bnielsen@cs.aau.dk ask@cs.aau.dk TDD D fi ifi TDD Definifion Test-driven Development is a programming practice that instructs developers to write new code only if an automated test has

510 views • 31 slides
Test Code Coverage White box testing Statement Coverage example 1 n Make sure every statement

Test Code Coverage White box testing Statement Coverage example 1 n Make sure every statement

Test Code Coverage White box testing Statement Coverage example 1 n Make sure every statement in the program is executed at least once T F n Example 1 2 n if a < b then c = a+b ; d = a*b /* 1 */ else c = a*b ; d = a+b /* 2 */

2.09k views • 26 slides
Beyond Code Coverage an Approach for Test Suite Assessment and Improvement Dvid Tengeri* ,

Beyond Code Coverage an Approach for Test Suite Assessment and Improvement Dvid Tengeri* ,

UNIVERSITAS SCIENTIARUM SZEGEDIENSIS UNIVERSITY OF SZEGED D epartment of Software Engineering Beyond Code Coverage an Approach for Test Suite Assessment and Improvement Dvid Tengeri* , rpd Beszdes*, Tams Gergely*, Lszl Vidcs

458 views • 17 slides
Code Generation Chapter 9 1 Compiler Construction Code Generation Issues in Code Generation

Code Generation Chapter 9 1 Compiler Construction Code Generation Issues in Code Generation

Code Generation Chapter 9 1 Compiler Construction Code Generation Issues in Code Generation Target language Relocatable machine code Commercial compilers produce this Absolute machine code OS code must start at a particular memory

503 views • 19 slides
Datatracker Testing Making the users happy by catching bugs Contents How test coverage

Datatracker Testing Making the users happy by catching bugs Contents How test coverage

Datatracker Testing Making the users happy by catching bugs Contents How test coverage has changed Catching data corruption Finding user points of pain Dead code removal Chasing the holy grail of full test coverage What

549 views • 27 slides
Graph-based Test Coverage (A&O Ch. 1, 2.1 2.3) (2 nd Ed: 2,3,5,7.1 7.3) Course

Graph-based Test Coverage (A&O Ch. 1, 2.1 2.3) (2 nd Ed: 2,3,5,7.1 7.3) Course

Graph-based Test Coverage (A&O Ch. 1, 2.1 2.3) (2 nd Ed: 2,3,5,7.1 7.3) Course Software Testing & Verification 2019/20 Wishnu Prasetya & Gabriele Keller Plan The concept of test coverage Graph-based coverage

480 views • 36 slides
Code Coverage Outlines Code Coverage. EMMA Installing EMMA Running EMMA View

Code Coverage Outlines Code Coverage. EMMA Installing EMMA Running EMMA View

Code Coverage Outlines Code Coverage. EMMA Installing EMMA Running EMMA View Result Code Coverage Is a measure used in software testing. It describes the degree to which the source code of a program has been tested.

678 views • 21 slides
Array Code Generation 1. Array code generation 2. Surprises in memory access 3. Lessons learned

Array Code Generation 1. Array code generation 2. Surprises in memory access 3. Lessons learned

Array Code Generation 1. Array code generation 2. Surprises in memory access 3. Lessons learned Array Code Gen Model-Driven VAR i, k, x : INTEGER; A : ARRAY 17 OF INTEGER; ... BEGIN Arrays dont know offset at compile time

372 views • 11 slides
Test Driven Development in Python Siddharta Govindaraj siddharta@silverstripesoftware.com What

Test Driven Development in Python Siddharta Govindaraj siddharta@silverstripesoftware.com What

Test Driven Development in Python Siddharta Govindaraj siddharta@silverstripesoftware.com What is Test Driven Development (TDD)? http://www.flickr.com/photos/johnsyweb/3051647719/ Red, Green, Refactor First write a test Write code to

543 views • 42 slides
Automated Test Data Generation for Coverage: Lakhotia et al. Outline Havent We Solved This

Automated Test Data Generation for Coverage: Lakhotia et al. Outline Havent We Solved This

Havent We Solved This Problem Yet? Automated Test Data Generation for Coverage: Lakhotia et al. Outline Havent We Solved This Problem Yet? Motivation Background Search Based Kiran Lakhotia 1 Phil McMinn 2 Mark Harman 1 Testing

811 views • 46 slides
Test Driven Development TDD A process focusing on reliability, progress, and confidence

Test Driven Development TDD A process focusing on reliability, progress, and confidence

Test Driven Development TDD A process focusing on reliability, progress, and confidence Henrik Brbak Christensen 1 Test-Driven Development Clean code that works To ensure that our software is reliable all the time Clean

1.62k views • 98 slides
Code Generation Machine code generation cs4713 1 Machine code generation machine Intermediate

Code Generation Machine code generation cs4713 1 Machine code generation machine Intermediate

Code Generation Machine code generation cs4713 1 Machine code generation machine Intermediate Code optimizer Code generator Code generator Input: intermediate code + symbol tables In our case, three-address code All variables

717 views • 38 slides
410(b) Coverage Testing Chad Blech Robin Snyder 410(b) Coverage Tests What is the 410(b)

410(b) Coverage Testing Chad Blech Robin Snyder 410(b) Coverage Tests What is the 410(b)

410(b) Coverage Testing 3/26/2009 410(b) Coverage Testing Chad Blech Robin Snyder 410(b) Coverage Tests What is the 410(b) Coverage Test? Ratio Test Average Benefits Test Who is included the tests? How do you perform the

129 views • 12 slides
TTCN-3 Code Generation

TTCN-3 Code Generation

TTCN-3 Code Generation - Venkata Ramana Gollamudi Huawei Technologies India Pvt Ltd. www.huawei.com Agenda Motivation Modular Test

279 views • 17 slides
Scripting for Multimedia PRE-LAB 2: WRITING, TESTING, AND DEBUGGING JAVASCRIPT Writing

Scripting for Multimedia PRE-LAB 2: WRITING, TESTING, AND DEBUGGING JAVASCRIPT Writing

Scripting for Multimedia PRE-LAB 2: WRITING, TESTING, AND DEBUGGING JAVASCRIPT Writing test-driven code Test-driven development (TDD) is a great way to write code and learn about code You can write your test without having to write a

418 views • 27 slides
APACHE SLING & FRIENDS TECH MEETUP BERLIN, 26-28 SEPTEMBER 2016 Test Driven Development with

APACHE SLING & FRIENDS TECH MEETUP BERLIN, 26-28 SEPTEMBER 2016 Test Driven Development with

APACHE SLING & FRIENDS TECH MEETUP BERLIN, 26-28 SEPTEMBER 2016 Test Driven Development with AEM Jan Wloka, Quatico Solutions Inc. From the talk Get the Flow Test coverage is the natural enemy of fast coding. [...] It is a

330 views • 20 slides
Code Coverage SWEN-261 Introduction to Software Engineering Department of Software Engineering

Code Coverage SWEN-261 Introduction to Software Engineering Department of Software Engineering

Code Coverage SWEN-261 Introduction to Software Engineering Department of Software Engineering Rochester Institute of Technology Code coverage analysis is measuring how well your unit tests exercise the production code. Code coverage

290 views • 10 slides

More recommend