State Transition Testing Technique Training Kateryna Dribas

Скачать презентацию State Transition Testing Technique Training Kateryna Dribas Скачать презентацию State Transition Testing Technique Training Kateryna Dribas

3e_learning_state_transition_testing_technique.ppt

  • Размер: 4.6 Mегабайта
  • Количество слайдов: 36

Описание презентации State Transition Testing Technique Training Kateryna Dribas по слайдам

State Transition Testing Technique Training Kateryna Dribas State Transition Testing Technique Training Kateryna Dribas

Agenda 1. Practice  Third lesson: 1. 1. Example;   1. 2. Notifications; 1. 3.Agenda 1. Practice Third lesson: 1. 1. Example; 1. 2. Notifications; 1. 3. Test cases. 3. Summary. 5. The end. 4. Home Task.

Practice Practice

Customer selects a mark of the chocolate (e. g. ‘Kit. Kat’). Chocolate vending machine (CVM) ExampleCustomer selects a mark of the chocolate (e. g. ‘Kit. Kat’). Chocolate vending machine (CVM) Example Enters money.

If amount of money is ok, then CVM will start selection of chocolate. If ‘Kit. Kat’If amount of money is ok, then CVM will start selection of chocolate. If ‘Kit. Kat’ chocolate is available, then customer will get ‘Kit. Kat’ in a minute. Example If not enough money is entered, then CVM will ask to enter more. Not enough! Please select In a 10 seconds menu returns to main menu.

If there is no selected mark of the chocolate, then customer will get proper message. If there is no selected mark of the chocolate, then customer will get proper message. In a 10 seconds menu returns to main menu. Example The CVM doesn’t give the change. No chocolate!His money back.

Example Type of choco-la te Valida-ti on sum Check selected chocola-te. Start Give choco-l ate EnterExample Type of choco-la te Valida-ti on sum Check selected chocola-te. Start Give choco-l ate Enter money Select type of chocolate Enough money, with or w/o change Chocolate exists. In 10 seconds. Customer selects ‘Kit. Kat’, and enters money. If entered money is enough, the CVM will start selection of chocolate. If ‘Kit. Kat’ is available, then customer will get it in a minute. In a 10 seconds menu returns to main menu.

Example Type of choco- late Valida-ti on sum Check selected chocola-te. Start Give choco- late EnterExample Type of choco- late Valida-ti on sum Check selected chocola-te. Start Give choco- late Enter money Select type of chocolate Enough money, with or w/o change Chocolate exists. In 10 seconds Wait for enough money Enter money Not enough money. If entered money is not enough, the CVM will ask to enter more. If there is no ‘Kit. Kat’ then customer will get proper message and his money back. In a 10 seconds menu returns to main menu. The CVM doesn’t give the change. Money back Chocolate doesn’t exist. In 10 seconds

Example : Notification 1 In examples we should discover how much times user has to enterExample : Notification 1 In examples we should discover how much times user has to enter money to get enough pay. Type of choco- late Valida-ti on sum Check selected chocola-te. Start Give choco- late Enter money Select type of chocolate Enough money, with or w/o change Chocolate exists. In 10 seconds Wait for enough money Enter money Not enough money Money back Chocolate doesn’t exist. In 10 seconds Valida-ti on sum Wait for enough money Enter money Not enough money

Let’s take that ‘Kit. Kat’ costs 10. 00 UAH.  Example : Notification 1 Verify behaviorLet’s take that ‘Kit. Kat’ costs 10. 00 UAH. Example : Notification 1 Verify behavior of system, when entered sum is equal the chocolate cost. What is the minimum number of cases we should make for sum validation? 1 st TEST CASE Enter 10 UAH

Example : Notification 1 Enter 20 UAH. 2 nd TEST CASE Verify behavior of system, whenExample : Notification 1 Enter 20 UAH. 2 nd TEST CASE Verify behavior of system, when entered sum is more the chocolate cost.

Example : Notification 1 Enter whole sum by 1 cop. 3 rd TEST CASE Verify behaviorExample : Notification 1 Enter whole sum by 1 cop. 3 rd TEST CASE Verify behavior of system, when entered sum by 1 cop is equal the chocolate cost. …

Example : Notification 1 Every bank notes and coins. 4 th TEST CASE Verify behavior ofExample : Notification 1 Every bank notes and coins. 4 th TEST CASE Verify behavior of system, when every bank note and coin were entered until get the chocolate cost ,

There are many way to verify validation of entered sum.  Example: Notification 1 This issueThere are many way to verify validation of entered sum. Example: Notification 1 This issue should be clarified with BA. We should find the cases when it has sense.

Example : Notification 2 In examples is not clear how many times user can repeat theExample : Notification 2 In examples is not clear how many times user can repeat the ope- ration of selecting chocolate until he selects existing chocolate. Type of choco- late Valida-ti on sum Check selected chocola-te. Start Give choco- late Enter money Select type of chocolate Enough money, with or w/o change Chocolate exists. In 10 seconds Wait for enough money Enter money Not enough money Money back Chocolate doesn’t exist. In 10 seconds Previous steps Check selected chocola-te. Start Money back Chocolate doesn’t exist. In 10 seconds Previous steps

Example: Notification 2 If the number of types chocolate is 10?  Or 30? Or more?Example: Notification 2 If the number of types chocolate is 10? Or 30? Or more? ?

There are many way to verify validation of entered sum.  Example 2: Notification 2 ThisThere are many way to verify validation of entered sum. Example 2: Notification 2 This issue should be clarified with BA. We should find the cases when it has sense.

Budget constraints. Defect location identification. Test coverage (higher or good enough for project)Example: Causes It dependsBudget constraints. Defect location identification. Test coverage (higher or good enough for project)Example: Causes It depends on: Time constraints Business need. Cost of mistake

Example: Causes - Test coverage (higher or good enough for project); - Cost of mistake. -Example: Causes — Test coverage (higher or good enough for project); — Cost of mistake. — Time constraints; — Budget constraints; — Defect location identification; — Business need;

Example: Test Cases. 1 st flow In first test case would be the normal situation: theExample: Test Cases. 1 st flow In first test case would be the normal situation: the enough sum of mo-ney is entered the first time; selected mark of chocolate exists in CVM. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist Enter money Select type of chocolate Enough money, with or w/o change Chocolate exists. In 10 seconds. Start Type of chocola- te Valida-ti on sum Check selected chocola-te Give chocola- te

Example : Coverage. 1 st flow Type of chocola- te Valida-ti on sum Check selected chocola-teExample : Coverage. 1 st flow Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te. Start Enter money Select type of chocolate Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds

Example 2: Test Cases. 2 nd  flow In second test case not enough sum isExample 2: Test Cases. 2 nd flow In second test case not enough sum is entered the first time, but the sum is getting enough the second time. And ‘Kit Kat’ doesn’t exist in CVM. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Money back Select type of chocolate Enter money Not enough money Enter money. Enough money, with or w/o change Chocolate doesn’t exist. In 10 seconds

Example : Coverage. 1 st , 2 nd  flows Type of chocola- te Valida-ti onExample : Coverage. 1 st , 2 nd flows Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te. Start Enter money Select type of chocolate Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Wait for enough money Enter money Not enough money Money back Chocolate doesn’t exist. In 10 seconds

But we may want to verify that all combi-nations of states and transitions still work correctly.But we may want to verify that all combi-nations of states and transitions still work correctly. Example: Notification 3 We have covered all states and transitions. These flows are used to create main test cases.

Example: Notification 3 Additional test cases may make you feel that you are on firm ground.Example: Notification 3 Additional test cases may make you feel that you are on firm ground. There’s probability that they discover defects previous cases don’t find. Let’s consider additional combinations of states.

Example: Test Cases. 3 rd flow A third test case. The enough sum of money isExample: Test Cases. 3 rd flow A third test case. The enough sum of money is entered the first time, and selected mark of chocolate doesn’t exist in CVM. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist Enter money Select type of chocolate Enough money, with or w/o change Chocolate doesn’t exist. In 10 seconds Start Type of chocola- te Valida-ti on sum Check selected chocola-te Money back

Example : Coverage. 3 rd flow Type of chocola- te Valida-ti on sum Check selected chocola-teExample : Coverage. 3 rd flow Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te. Start Enter money Select type of chocolate Enough money, with or w/o change In 10 seconds Money back Chocolate doesn’t exist. In 10 seconds

Example: Test Cases. 4 st flow A fourth test case. Sum of money is getting enoughExample: Test Cases. 4 st flow A fourth test case. Sum of money is getting enough the second time. And selected mark of chocolate exists in CVM. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Give chocola- te Select type of chocolate Enter money Not enough money Enter money. Enough money, with or w/o change Chocolate exists. In 10 seconds

Example : Coverage. 3 rd , 4 st flows Type of chocola- te Valida-ti on sumExample : Coverage. 3 rd , 4 st flows Type of chocola- te Valida-ti on sum Check selected chocola-te Wait for enough money. Start Enter money. Select type of chocolate Not enough money Money back Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Chocolate doesn’t exist. Type of chocola- te Valida-ti on sum Check selected chocola-te. Start Enter money Select type of chocolate Give chocola- te Enough money, with or w/o change Chocolate exists. In 10 seconds Wait for enough money Enter money Not enough money Money back Chocolate doesn’t exist. In 10 seconds

Example: Notification 3 We have considered additional combinations.  We have covered all states and transitions.Example: Notification 3 We have considered additional combinations. We have covered all states and transitions. &

Summary Capture requirements So State Transition testing technique is a tool to: and describe the designSummary Capture requirements So State Transition testing technique is a tool to: and describe the design of the application. And document them.

Summary Describe how the states of the appli- -cation may vary. State 3 State 4 StateSummary Describe how the states of the appli- -cation may vary. State 3 State 4 State 2 State 1 Action 1 Start 5 Action 4 Action 5 Action 2 Action 3 Determine all the events that occur during the application.

Let’s summarize the steps of the technique. Consider and prioritize according to require-ments all ways whichLet’s summarize the steps of the technique. Consider and prioritize according to require-ments all ways which cover whole functionality. Summary Determine all states. Identify all transitions. Create a test case for each way, that covers main functionality. Create additional test cases that cover remaining functionality (if it is needed).

For creating appointment provider selects the date and enters his Short Name (SN). Home Task IfFor creating appointment provider selects the date and enters his Short Name (SN). Home Task If provider is not busy on selected date he selects an operatory (Op) and a free time from list. After this appointment is created. If the SN was entered incorrectly the warning message appears and SN should be entered again. If provider is busy at selected date the appropriate message appears and provider has to enter the SN and select the date again.

Home Task Please, build state transition diagram. Show flows needed for covering all functional. 1 2Home Task Please, build state transition diagram. Show flows needed for covering all functional.

The end of the third lesson. THANK YOU! The end of the third lesson. THANK YOU!