TAILIEUCHUNG - Directed Random Testing

Directed Random Testing bool var35 = (var20, var23, var28); var36 = (1L, 10L); int var37 = (var4, var23); assert var37 == 3; (var1, var3, var37, -1); BitSet var38 = new BitSet(var37); Comparator var39 = (); PriorityQueue var40 = new PriorityQueue(var37, var39); TreeSet var41 = new TreeSet(var39); bool var42 = (); TreeSet var43 = (TreeSet)(); assert () == (); char[] var44 = new char[] { }; Set var76 = ((Set)var41); assert (var76);. | Directed Random Testing var36 1L 10L int var37 var4 var23 assert var37 3 var3j var37j -1 BitSet var3 Bitset var37 Comparator 1 lections. reverseOrder Priority J ị Ậie e var37 var39 TreeSet bool var4 KEmp TreeSet vn-eeSet assert V char var44 new char r76 Carlos Pacheco MIT CSAIL 2 17 2009 Software testing expensive difficult goal automation 30-90 of development effort complex software many behaviors to test large input spaces selecting subset is hard automate test case creation a principal testing activity a significant portion of cost Cost of inadequate testing on US economy billions developers users TOTAL source NIST 2002 done mostly by hand at Microsoft of engineers Approach random testing simple effective reveals errors unix utilities OS services GUIs functional code OO code flash file systems Miller 1990 Kropp 1998 Forrester 2000 Claessen 2000 Oriat 2004 Csallner 2005 Groce 2007 directed random testing harness random testing but make it better reveal more errors produce better test cases achieve higher coverage suffers from deficiencies many useless inputs low .

• Kỹ thuật lập trình
• Randoop demo
• DRT roadmap
• Equivalence
• Errors revealed
• JCrasherm
• Randoop