Delta-Oriented Testing for Finite State Machines

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

LEUCEMIA MIELOIDE AGUDA TIPO 0
You have been given a mission and a code. Use the code to complete the mission and you will save the world from obliteration…
Advanced Piloting Cruise Plot.
Chapter 1 The Study of Body Function Image PowerPoint
Copyright © 2011, Elsevier Inc. All rights reserved. Chapter 5 Author: Julia Richards and R. Scott Hawley.
1 Copyright © 2010, Elsevier Inc. All rights Reserved Fig 2.1 Chapter 2.
1 Chapter 40 - Physiology and Pathophysiology of Diuretic Action Copyright © 2013 Elsevier Inc. All rights reserved.
By D. Fisher Geometric Transformations. Reflection, Rotation, or Translation 1.
Source of slides: Introduction to Automata Theory, Languages and Computation.
Business Transaction Management Software for Application Coordination 1 Business Processes and Coordination.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Title Subtitle.
My Alphabet Book abcdefghijklm nopqrstuvwxyz.
Multiplying binomials You will have 20 seconds to answer each of the following multiplication problems. If you get hung up, go to the next problem when.
0 - 0.
ALGEBRAIC EXPRESSIONS
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
ADDING INTEGERS 1. POS. + POS. = POS. 2. NEG. + NEG. = NEG. 3. POS. + NEG. OR NEG. + POS. SUBTRACT TAKE SIGN OF BIGGER ABSOLUTE VALUE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
Year 6 mental test 5 second questions
ZMQS ZMQS
Evaluating Window Joins over Unbounded Streams Author: Jaewoo Kang, Jeffrey F. Naughton, Stratis D. Viglas University of Wisconsin-Madison CS Dept. Presenter:
Richmond House, Liverpool (1) 26 th January 2004.
BT Wholesale October Creating your own telephone network WHOLESALE CALLS LINE ASSOCIATED.
1 Petri Nets I Paul Fishwick author From
ABC Technology Project
6/12/ DFS ABU DHABI STAFF ACCOMODATION.
O X Click on Number next to person for a question.
© S Haughton more than 3?
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
25 July, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
5 August, 2014 Martijn v/d Horst, TU/e Computer Science, System Architecture and Networking 1 Martijn v/d Horst
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
© Charles van Marrewijk, An Introduction to Geographical Economics Brakman, Garretsen, and Van Marrewijk.
VOORBLAD.
Chapter #8: Finite State Machine Design 8
“Start-to-End” Simulations Imaging of Single Molecules at the European XFEL Igor Zagorodnov S2E Meeting DESY 10. February 2014.
Twenty Questions Subject: Twenty Questions
Linking Verb? Action Verb or. Question 1 Define the term: action verb.
Squares and Square Root WALK. Solve each problem REVIEW:
© 2012 National Heart Foundation of Australia. Slide 2.
Lets play bingo!!. Calculate: MEAN Calculate: MEDIAN
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
This, that, these, those Number your paper from 1-10.
1 Chapter 4 The while loop and boolean operators Samuel Marateck ©2010.
Chapter 5 Test Review Sections 5-1 through 5-4.
SIMOCODE-DP Software.
GG Consulting, LLC I-SUITE. Source: TEA SHARS Frequently asked questions 2.
CRT RSA Algorithm Protected Against Fault Attacks WISTP - 5/10/07 Arnaud BOSCHER Spansion EMEA Robert NACIRI Oberthur Card Systems Emmanuel PROUFF Oberthur.
1 First EMRAS II Technical Meeting IAEA Headquarters, Vienna, 19–23 January 2009.
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
11 = This is the fact family. You say: 8+3=11 and 3+8=11
Week 1.
We will resume in: 25 Minutes.
1 Unit 1 Kinematics Chapter 1 Day
O X Click on Number next to person for a question.
PSSA Preparation.
How Cells Obtain Energy from Food
Finite State Machines Finite state machines with output
Anaïs GUIGNARD LURPA, ENS Cachan Validation of logic controllers from event observation in a closed-loop system Réunion VACSIM - 14 Octobre 2014.
Presentation transcript:

Delta-Oriented Testing for Finite State Machines Mahsa Varshosaz, Harsh Beohar Centre for Research on Embedded Systems (CERES) Halmstad University AVOCS 2014

Testing a family of software Motivation Testing a family of software

Motivation (cont)

Outline Model Based Testing W-Method Delta-oriented W-Method

Model Based Testing … LTS FSM System Model Test Case Generation Implementation Test Execution

Finite State Machine Inputs I={a,b} Outputs O={0,1} s0 s1 s2 b/0 b/0

Model Assumptions Fully specified ∀i∈I Deterministic Minimal ≢ s s s

W-Method Basis: FSM test models Goal: Establish conformance between specification and implementation

Transition Cover Set (P) Goal: Checking existence of output faults P={ƹ ,a,b,a,aa,aaa,aab} s0 s2 s1 b/0 b/1 a/1 a/0 s0 b a s0 s1 a b s0 s2 b a s0 s2

Characterizing Set (W) Goal: Checking existence of transfer faults W={a,b} s0 s2 s1 b/0 b/1 a/1 a/0 Input /state s0 s1 s2 a 1 b

Test Cases The set of test cases to be executed R.P.W R : the reset sequence

Outline Model Based Testing W-Method Delta-oriented W-Method

Delta-Oriented Modeling Pi Deltai … … Core Model Deltan Delta1 P1 Pn

Delta Oriented Testing … Core Model (M) ∆(M)1 ∆(M)i ∆(M)n … Generating Test Cases Generating DeltaTest Cases Mi’ Executing Test

FSM Delta ∆(M)=(S∆,I∆,O∆, μ∆ ,λ∆ ) S ∆ non-empty set of states I ∆ , O ∆ set of inputs and outputs μ ∆ : (S ⋃ S ∆) x I ∆ ⟶ (S ⋃ S ∆) λ ∆ : (S ⋃ S ∆) x I ∆ ⟶ O ∆ ⋃ τ

FSM Delta (Example) s0 s3 t3 s1 s2 t1 t2 a,b/0 a/1 a,b/1 c/1 b/0 c/0 a,c/0 b,c/1 a/0 b/0 b,c/1 b/0

Delta Application Apply(M, ∆(M))= (s0, S’, I’, O’, μ’, λ’) S’= S ⋃ S∆ I’=I∆ O’=O∆ μ∆ (s, a) if (s, a) ∈ Dom(μ∆ ) μ’(s, a) = μ (s, a) if a ∈ I ∧ (s, a) ∉Dom(μ∆ ) s otherwise λ∆(s, a) if (s, a) ∈ Dom(λ∆) λ’(s, a) = λ (s, a) if a ∈ I ∧ (s, a) ∉Dom(λ∆ ) τ otherwise

Delta Application (Example) a,b/0 a/1 s0 a,b/1 b/1 s3 c/1 t3 b/0 c/0 c/1 c/0 a/1 a,b/1 s1 s2 t1 t2 a,c/0 b,c/1 a/0 b/0 b,c/1 b/0

Test Criteria Two criteria for solutions Correctness Efficiency Considering an SPL with n products ∆(M)i Core Model (M) M’i

Correctness

Efficiency

Work in Progress Developing algorithms for computing: Characterizing set Transition cover set Extending the delta definition Implementing the delta oriented method

Thank you mahsa.varshosaz@hh.se