1 / 47

Syntax-Based Testing

Syntax-Based Testing. Mingzhe Du Hongying Du Dharani Chintapatla. Syntax-Based Testing. Syntax-Based Testing Introduction Program-Based Grammers Integration and Object Oriented testing. Using the Syntax to Generate Tests. Lots of software artifacts follow strict syntax rules

bono
Download Presentation

Syntax-Based Testing

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Syntax-Based Testing Mingzhe Du Hongying Du Dharani Chintapatla

  2. Syntax-Based Testing • Syntax-Based Testing Introduction • Program-Based Grammers • Integration and Object Oriented testing

  3. Using the Syntax to Generate Tests • Lots of software artifacts follow strict syntax rules • The syntax is often expressed as some sort of grammar such as BNF • Syntactic descriptions can come from many sources • Programs • Integration elements • Design documents • Input descriptions • Tests are created with two general goals • Cover the syntax in some way • Violate the syntax (invalid tests)

  4. ‘*’ is closure operator, zero or more occurrences ‘|’ is choice, either one can be used Grammar Coverage Criteria • Software engineering makes practical use of automata theory in several ways • Programming languages defined in BNF • Program behavior described as finite state machines • Allowable inputs defined by grammars • A simple regular expression: (G s n | B t n)* • Any sequence of “G s n” and “B t n” • ‘G’ and ‘B’ could be commands, methods, or events • ‘s’, ‘t’, and ‘n’ could represent arguments, parameters, or values • ‘s’, ‘t’, and ‘n’ could be literals or a set of values

  5. Start symbol Non-terminals Production rule Terminals BNF Grammars Stream ::= action* action ::= actG | actB actG ::= “G” s n actB ::= “B” t n s ::= digit1-3 t ::= digit1-3 n ::= digit2 “.” digit2 “.” digit2 digit ::= “0” | “1” | “2” | “3” | “4” | “5” | “6” | “7” | “8” | “9”

  6. Using Grammars Stream ::= action action * ::= actG action* ::= G s n action* ::= G digit1-3 digit2 . digit2 . digit2 action* ::= G digitdigitdigitdigit.digitdigit.digitdigitaction* ::= G 18 08.01.90 action* … G 18 08.01.90 B 14 06.27.94 G 13 11.21.94 B 05 01.09.03

  7. Mutation Testing • Grammars describe both valid and invalid strings • Both types can be produced as mutants • A mutant is a variation of a valid string • Mutants may be valid or invalid strings • Mutation is based on “mutation operators” and “ground strings”

  8. Mutation Testing • Ground string: A string in the grammar • The term “ground” is used as a reference to algebraic ground terms • Mutation Operator : A rule that specifies syntactic variations of strings generated from a grammar • Mutant : The result of one application of a mutation operator • A mutant is a string

  9. Mutants and Ground Strings • The key to mutation testing is the design of the mutation operators • Well designed operators lead to powerful testing • Sometimes mutant strings are based on ground strings • Sometimes they are derived directly from the grammar • Ground strings are used for valid tests • Invalid tests do not need ground strings Valid Mutants Ground StringsMutants G 18 08.01.90 B 18 08.01.90 B 14 06.27.94 B 45 06.27.94 Invalid Mutants 7 18 08.01.90 B 134 06.27.1

  10. Program-Based Grammers Hongying Du

  11. Applying Syntax-based Testing to Programs • Syntax-based testing criteria originated with programs and have been used most with programs • BNF coverage criteria are most commonly used to test compilers • Testing compilers is very complicated • Millions of correct programs ! • Compilers must recognize and reject incorrect programs • BNF criteria can be used to generate programs to test all language features that compilers must process • This is a very specialized application and not discussed in detail • Mutation testing criteria are most commonly used for unit testing of methods and integration testing of classes

  12. Mutation testing • The original and most widely known application of syntax-based testing is to modify programs • Operators modify a ground string (program under test) to create mutant (programs) • Mutant programs must compile correctly (valid strings) • Once mutants are defined, tests must be found to cause mutants to fail when executed, this is called “killing mutants”

  13. Program-based Grammars 6 mutants Each represents a separate program Original Method int Min (int A, int B) { int minVal; minVal = A; if (B < A) { minVal = B; } return (minVal); } // end Min With Embedded Mutants int Min (int A, int B) { int minVal; minVal = A; ∆ 1 minVal = B; if (B < A) ∆ 2 if (B > A) ∆ 3 if (B < minVal) { minVal = B; ∆ 4 Bomb (); ∆ 5 minVal = A; ∆ 6 minVal = failOnZero (B); } return (minVal); } // end Min Test: (A = 5, B = 3)

  14. Killing Mutants • If mutation operators are designed well, the resulting tests will be very powerful • Different operators must be defined for different programming languages and goals • Testers can keep adding tests until all mutants have been killed • Dead mutant : A test case has killed it • Stillborn mutant : Syntactically illegal • Trivial mutant : Almost every test can kill it • Equivalent mutant : No test can kill it (equivalent to original program) Given a mutant m M for a ground string program P and a test t, t is said to killm if and only if the output of t on P is different from the output of t on m.

  15. Syntax-Based Coverage Criteria Mutation Coverage (MC) : For each mM, TR contains exactly one requirement, to kill m. • The RIP model: • Reachability : The test causes the faulty statement to be reached (in mutation – the mutated statement) • Infection : The test causes the faulty statement to result in an incorrect state • Propagation : The incorrect state propagates to incorrect output • The RIP model leads to two variants of mutation coverage …

  16. Syntax-Based Coverage Criteria • 1) Strongly Killing Mutants: • Given a mutant m  M for a program P and a test t, t is said to strongly killm if and only if the output of t on P is different from the output of t on m • 2) Weakly Killing Mutants: • Given a mutant m  M that modifies a location l in a program P, and a test t, t is said to weakly killm if and only if the state of the execution of P on t is different from the state of the execution of m immediately on t after l • Weakly killing satisfies reachability and infection, but not propagation

  17. 1 boolean isEven (int X) 2 { 3 if (X < 0) 4 X = 0 - X; ∆4 X = 0; 5 if (float) (X/2) == ((float) X) / 2.0 6 return (true); 7 else 8 return (false); 9 } Strong Versus Weak Mutation Reachability : X < 0 Infection : X != 0 Propagation : ((float) ((0-X)/2) == ((float) 0-X) / 2.0) != ((float) (0/2) == ((float) 0) / 2.0) That is, X is not even … Thus (X = -6) does not kill the mutant under strong mutation (X = -6) will kill mutant 4 under weak mutation

  18. Testing Programs with Mutation Create mutants Run equivalence detector Generate test cases Run T on P • Run mutants: • schema-based • weak • selective Define threshold Automated steps no Eliminate ineffective TCs Threshold reached ? P (T) correct ? Fix P no yes Prog Input test method

  19. 1. ABS –– Absolute Value Insertion: Each arithmetic expression (and subexpression) is modified by the functions abs(), negAbs(), and failOnZero(). 2. AOR ––Arithmetic Operator Replacement: Each occurrence of one of the arithmetic operators +,-,*,/, and % is replaced by each of the other operators. In addition, each is replaced by the special mutation operators leftOp, and rightOp. Mutation Operators for Java E.g. x = 3 * a; can be mutated to x = 3 * abs (a); x = 3 * -abs (a); x = 3 * failOnZero (a); E.g.x = a + b; can be mutated to x = a - b; x = a * b; x = a / b; x = a; x = b; x = a % b;

  20. 4. COR –– Conditional Operator Replacement: Each occurrence of one of the logical operators (and - &&, or - || , and with no conditional and - &, or with no conditional or - |, exclusive or - ^) is replaced by each of the other operators; in addition, each is replaced by falseOp, trueOp, leftOp, and rightOp. 3. ROR––Relational Operator Replacement: Each occurrence of one of the relational operators (<, ≤, >, ≥, ==, ≠) is replaced by each of the other operators and by falseOp and trueOp. Mutation Operators for Java E.g. if (m > n) can be mutated to if (m >= n) if (m < n)if (m <= n)if (m = = n)if (m != n)if (false)if (true) E.g. if (a && b)can be mutated to If (a || b) if (a & b)if (a | b)if ( a ^ b)if (false)if (true) if (a) if (b)

  21. 6. LOR––Logical Operator Replacement: Each occurrence of one of the logical operators (bitwise and - &, bitwise inclusive or - |, bitwise exclusive or - ^) is replaced by each of the other operators; in addition, each is replaced by leftOp and rightOp. 5. SOR –– Shift Operator Replacement: Each occurrence of one of the shift operators <<, >>, and >>> is replaced by each of the other operators. In addition, each is replaced by the special mutation operator leftOp. Mutation Operators for Java E.g.x = m << a; can be mutated to x = m >> a; x = m >>> a; x = m; E.g.x = m & n; can be mutated to x = m | n; x = m ^ n; x = m; x = n;

  22. 7. ASR –– Assignment Operator Replacement: Each occurrence of one of the assignment operators (+=, -=, *=, /=, %=, &=, |=, ^=, <<=, >>=, >>>=) is replaced by each of the other operators. 8. UOI ––Unary Operator Insertion: Each unary operator (arithmetic +, arithmetic -, conditional !, logical ~) is inserted in front of each expression of the correct type. Mutation Operators for Java E.g.x += 3; can be mutated to X -= 3; x *= 3; x /= 3; x %= 3; x &= 3; x |= 3; x ^= 3; x <<= 3; x >>= 3; x >>>= 3; E.g.x = 3 * a; can be mutated to x = 3 * +a; x = 3 * -a; x = +3 * a; x = -3 * a;

  23. 9. UOD ––Unary Operator Deletion: Each unary operator (arithmetic +, arithmetic -, conditional !, logical~) is deleted. 10. SVR –– Scalar Variable Replacement: Each variable reference is replaced by every other variable of the appropriate type that is declared in the current scope. Mutation Operators for Java E.g.if !(a < -b) can be mutated to if !(a > -b) if !(a > b) E.g.x = a * b; can be mutated to x = a * a; a = a * b;x = x * b;x = a * x;x = b * b;b = a * b;

  24. 11. BSR –– Bomb Statement Replacement: Each statement is replaced by a special Bomb() function. Mutation Operators for Java E.g.x = a * b; can be mutated to Bomb();

  25. Integration and Object Oriented testing Dharani Chintapatla

  26. Integration and Object-Oriented Testing • In Java, testing the way classes, packages and components are connected • “Component” is used as a generic term • This tests features that are unique to object-oriented programming languages • inheritance, polymorphism and dynamic binding • Integration testing is often based on couplings – the explicit and implicit relationships among software components Integration Testing Testing connections among separate program units

  27. Integration Mutation • Faults related to component integration often depend on a mismatch of assumptions • Callee thought a list was sorted, caller did not • Callee thought all fields were initialized, caller only initialized some of the fields • Caller sent values in kilometers, callee thought they were miles • Integration mutation focuses on mutating the connections between components • Sometimes called “interface mutation” • Both caller and callee methods are considered

  28. Four Types of Mutation Operators • Change a calling method by modifying values that are sent to a called method • Change a calling method by modifying the call • Change a called method by modifying values that enter and leave a method • Includes parameters as well as variables from higher scopes (class level, package, public, etc.) • Change a called method by modifying return statements from the method

  29. Integration Mutation Operators—Example 1. IPVR – Integration Parameter Variable Replacement 2. IUOI – Integration Unary Operator Insertion MyObject a, b; . . . callMethod (a);  callMethod (b); callMethod (a);  callMethod (a++);

  30. Integration Mutation Operators—Example 3. IPEX – Integration Parameter Exchange 4. IMCD – Integration Method Call Deletion Max (a, b);  Max (b, a); X = Max (a, b);  X = new Integer (3); 5. IREM – Integration Return Expression Modification • int myMethod () • { • return a; • return ++a; • }

  31. point private int x; 1 public int x; 2 protected int x; 3 int x; OO Mutation Operators—Example 1. AMC – Access Modifier Change

  32. OO Mutation Operators—Example 3. HVI – Hiding Variable Insertion 2. HVD – Hiding Variable Deletion point int x; int y; point int x; int y; colorpoint 1 int x; 2 int y; colorpoint int x; 1 // int x; int y; 2 // int y;

  33. point void set (int x, int y) • colorpoint • void set (int x, int y) • { super.set (x, y); width = 10;} • { width=10; super.set (x, y); } • colorpoint • void set (int x, int y) • // void set (int x, int y) OO Mutation Operators—Example 4. OMD – Overriding Method Deletion 5. OMM – Overriding Method Moving point void set (int x, int y) { width = 5;…}

  34. point • … • void set (int x, int y) • void setP (int x, int y) … void setDimension (int d) { … set (x, y); • setP (x, y); … } point int getX() • colorpoint • int getX () • { • return super.x; • return x; • } colorpoint … void set (int x, int y) OO Mutation Operators—Example 6. OMR – Overriding Method Rename 7. SKD – Super Keyword Deletion point p; p = new colorpoint (); … p.Set (1, 2); p.setDimension (3);

  35. point point (int x, int y) … • colorpoint • colorpoint (int x, int y, int color) • { • super (x, y); • // super (x, y); … • } OO Mutation Operators—Example 8. PCD – Parent Constructor Deletion

  36. point point colorpoint colorpoint point p;  colorpoint p; p = new colorpoint (); point p; p = new point ();  p = new colorpoint (); OO Mutation Operators—Example 9. ATC – Actual Type Change 10. DTC – Declared Type Change

  37. point point colorpoint point3D colorpoint point p; colorpoint cp = new colorpoint (0, 0); point3D p3d = new point3D (0, 0, 0); p = cp;  p = p3d; • boolean equals (point p) • { . . . } • boolean equals (colorpoint p) { . . .} OO Mutation Operators—Example 12. RTC – Reference Type Change 11. PTC – Parameter Type Change

  38. point point point3D void set (int x, int y) { …}  // void set (int x, int y) { …} void set (int x, int y, int z) { … } point3D void set (int x, int y) { S1 } void set (int x, int y, int z) { S2 }  void set (int x, int y, int z) { S1 } OO Mutation Operators—Example 14. OMD – Overloading Method Deletion 13. OMR – Overloading Method Change

  39. point point point3D void set (int x, int y, char c); void set (char a, int x, int y); point3D void set (int x, int y, int z); void set (int x, int y); void set (int z); point3D p; p.set (1, 2, 3);  p.set (2, 3);  p.set (3); point3D p; p.set (1, 2, ‘t’);  p.set (‘t’, 1, 2); OO Mutation Operators—Example 15. AOC – Argument Order Change 16. ANC – Argument Number Change

  40. point … void set (int x, int y) { this.x = x; 1 x = x; this.y = y; 2 y = y; } … • point • public static int x = 0; • 1 public int x = 0; • public int Y = 0; • 2 public static int y = 0; … OO Mutation Operators—Example 17. JTD – This Keyword Deletion 18. JSD – Static Modifier Change

  41. point int x = 0;  int x; … point point() { … }  // point() { … } … OO Mutation Operators—Example 19. VID –Variable Initialization Deletion 20. DCD – Default Constructor Delete

  42. References • Introduction to software testing, P. Ammann J. Offutt • slides http://cs.gmu.edu/~offutt/softwaretest/

  43. java mujava.gui.RunTestMain

  44. Thanks

More Related