Effectiveness of Pair-wise Testing on Logical Expressions Presented by William Ballance.

Slides:

Advertisements

Similar presentations

1 Applications of Optimization to Logic Testing Gary Kaminski and Paul Ammann ICST 2010 CSTVA Workshop.

Advertisements

RANJAN BHAMBROO Experimental Investigation of Effectiveness of Logical Expressions Using t-way Testing.

Introduction to Radians (Definition, Converting Between Radians and Degrees, & When to use Degrees or Radians)

Section Section Summary Introduction to Boolean Algebra Boolean Expressions and Boolean Functions Identities of Boolean Algebra Duality The Abstract.

RATIONAL EXPONENTS Assignments Assignments Basic terminology

Algebraic Expressions. Objectives I will model algebraic expressions with popsicle stick and cubes. I will replace a variable with a given value and then.

Use mental math to evaluate.

Computer Science 101 The Boolean System. George Boole British mathematician ( ) Boolean algebra –Logic –Set theory –Circuits –Conditions in if.

DeMorgan Theorem, Computer Simulation Exercises

© SERG Dependable Software Systems (Mutation) Dependable Software Systems Topics in Mutation Testing and Program Perturbation Material drawn from [Offutt.

Software Logic Mutation Testing Presented by Gary Kaminski.

 The Distributive Property states that multiplying a sum by a number gives the same result as multiplying each addend by the number and then adding the.

Objective 1.To write very large or very small numbers in standard form, in scientific notation, and vice versa. To compare and order numbers in scientific.

Lesson 1.7 Dividing Integers Standards: NS 1.2 and AF 2.1 Objectives: Dividing Integers Evaluate variable expressions.

ALGEBRA LESSON 2 EVALUATING EXPRESSIONS AND CHECKING.

R Programming Risk & Relative Risk 1. Session 2 Overview 1.Risk 2.Relative Risk 3.Percent Increase/Decrease Risk 2.

Evaluating a Variable Expression To evaluate a variable expression:

Operators Precedence - Operators with the highest precedence will be executed first. Page 54 of the book and Appendix B list C's operator precedence. Parenthesis.

Evaluate Expressions (XEI301,401) Name Dec 5, Evaluating Expressions Example 1: Evaluate the expression for t = 12 t + 20 I DO (12) + 20 = 32 Example.

Whiteboardmaths.com © 2008 All rights reserved

Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.

Holt McDougal Algebra 2 Logarithmic Functions Holt Algebra 2Holt McDougal Algebra 2 How do we write equivalent forms for exponential and logarithmic functions?

Chapter 51 Logical Operators Used with Boolean expressions Not – makes a False expression True and vice versa And – will yield a True if and only if both.

Introduction to Exponents Definition: Let b represent a real number and n a positive integer. Then … b is called the base and n is called the exponent.

Introduction We have looked at a variety of methods to solve quadratic equations. The solutions to quadratic equations are points. Quadratic inequalities.

Algebra: a language of symbols including variables Variable: a symbol, usually a letter, used to represent a number.

Condition Testing. Condition testing is a test case design method that exercises the logical conditions contained in a program module. A simple condition.

1 Using a Fault Hierarchy to Improve the Efficiency of DNF Logic Mutation Testing Gary Kaminski and Paul Ammann ICST 2009.

Table of Contents Factoring – Greatest Common Factor When factoring out the greatest common factor (GCF), determine the common factor by looking at the.

Factoring – Greatest Common Factor When factoring out the greatest common factor (GCF), determine the common factor by looking at the following: 1.Numerical.

Mutation Testing Breaking the application to test it.

Zero and Negative Exponents. Raising a Number to the Zero Power  Anything raised to the zero power is 1, except 0 to the zero power.  0 to the zero.

 To find the numerical value of the expression, simply substitute the variables in the expression with the given number. Evaluate: 2x + 7, if x = 4 Substitute.

Objective: To Write and interpret numerical expressions.

Notes Over 1.2 Express the power in words. Then write the meaning. Word Meaning.

Volumize3d Volumize3d Training. Volumize3d Sections Introduction Assembly Transforms Boolean Logic Use Planner Volumize Expressions Scene Slicing and.

EXPONENTS Basic terminology Substitution and evaluating Laws of Exponents Multiplication Properties Product of powers Power to a power Power of a product.

 Students will be able to use the order of operations to evaluate expressions Focus Question How is evaluating an algebraic expression different form.

ECE 103 Engineering Programming Chapter 4 Operators Herbert G. Mayer, PSU Status 6/10/2016 Initial content copied verbatim from ECE 103 material developed.

Relational Operator and Operations

Unit 2 Boolean Algebra.

Introduction Polynomials are often added, subtracted, and even multiplied. Doing so results in certain sums, differences, or products of polynomials.

Introduction to Software Testing Chapter 9.2 Program-based Grammars

Condition Testing.

Handouts Software Testing and Quality Assurance Theory and Practice Chapter 6 Domain Testing

Introduction You can change a function’s position or shape by adding or multiplying a constant to that function. This is called a transformation. When.

Boolean Expressions Lecture No. 10.

TN 221: DIGITAL ELECTRONICS 1

Using Distributive Property

JavaScript: Control Statements.

Chapter 4 – Decisions 4.1 Relational and Logical Operators

Type boolean boolean: A logical type whose values are true and false.

Introduction to Software Testing Chapter 9.2 Program-based Grammars

State Encoding مرتضي صاحب الزماني.

Three Address Code Generations for Boolean Functions

Conditions and Ifs BIS1523 – Lecture 8.

Computers & Programming Languages

Variable acceleration

Chapter 8 JavaScript: Control Statements, Part 2

Sergiy Vilkomir January 20, 2012

Introduction to Software Testing Chapter 5.2 Program-based Grammars

Pages:51-59 Section: Control1 : decisions

Chapter 8: More on the Repetition Structure

Notes Over 1.2.

CS2011 Introduction to Programming I Selections (I)

Order of Operations PowerPoint

Pages:51-59 Section: Control1 : decisions

COMS W1004 Introduction to Computer Science

Evaluating an expression with two variable

Evaluating an expression with one variable

Presentation transcript:

Effectiveness of Pair-wise Testing on Logical Expressions Presented by William Ballance

Overview Introduction Fault Types Fault Evaluator Experiment Results

Introduction Effectiveness of pair-wise testing to reveal fault in logical expressions Only one previous paper that investigate this Non-specification-based approaches to logic testing for software Non-specification-based approaches to logic testing for software

Fault Types VNF (Variable Negation Fault) ORF (Operator Reference Fault) VRF (Variable Reference Fault) ENF (Expression Negation Fault) ASF (Associative Shift Fault)

VNF Fault type where Boolean variable x is replaced by !x. Original expression: a ∧ (!b ∨ !c) ∧ d ∨ e Expression with VNF: !a ∧ (!b ∨ !c) ∧ d ∨ e

ORF Fault type where Boolean AND operator is incorrectly used instead of Boolean OR operator or vice versa. Original expression: a ∧ (!b ∨ !c) ∧ d ∨ e Expression with ORF: a ∨ (!b ∨ !c) ∧ d ∨ e

VRF Fault type where Boolean variable x is replaced by another variable y. Original expression: a ∧ (!b ∨ !c) ∧ d ∨ e Expression with VRF: b ∧ (!b ∨ !c) ∧ d ∨ e

ENF Fault type where Boolean expression p is replaced by !p. Original expression: a ∧ (!b ∨ !c) ∧ d ∨ e Expression with ENF: a ∧ !(!b ∨ !c) ∧ d ∨ e

ASF Fault type where parentheses in Boolean expression is misused. Original expression: a ∧ (!b ∨ !c) ∧ d ∨ e Expression with ENF: a ∧ !(b ∨ !c) ∧ d ∨ e

Fault Evaluator A software tool that can generate faulty Boolean expressions and evaluate those faulty expressions with test sets that are loaded in the software.

Fault Evaluator Steps 1.Load in the correct Boolean expressions 2.Load in the test cases 3.Generate faults (specify which faults or all faults) 4.Evaluate – Fault Evaluator applies the test sets to the original expressions and the faulty expressions. – If the result from applying the test case to the faulty expression was different from the result obtained from the original expression, then the fault was revealed.

Comparison of Our Results and Kobayashi’s Results

Number of Faults for each Expression Set

Effectiveness of Pair-wise testing on 5 different sets of expressions Percentages of pair-wise testing to reveal faults for each expression set.

Comparison of Pair-wise testing and random testing Percentages of Pair-wise and random testing

Pair-wise testing depending on size of expression Effectiveness of Pair-wise testing for each expression set

Pair-wise testing depending on size of expression Effectiveness of Pair-wise testing for each fault type