Evaluating Testing Methods by Delivered Reliability

Slides:



Advertisements
Similar presentations
Random Testing Tor Stålhane Jonas G. Brustad. What is random testing The principle of random testing is simple and can be described as follows: 1.For.
Advertisements

Extension of E(Θ) metric for Evaluation of Reliability.
1 Testing Effectiveness and Reliability Modeling for Diverse Software Systems CAI Xia Ph.D Term 4 April 28, 2005.
Exam 1 Review u Scores Min 30 Max 96 Ave 63.9 Std Dev 14.5.
An Experimental Evaluation on Reliability Features of N-Version Programming Xia Cai, Michael R. Lyu and Mladen A. Vouk ISSRE’2005.
ED 4 I: Error Detection by Diverse Data and Duplicated Instructions Greg Bronevetsky.
Reliability Modeling for Design Diversity: A Review and Some Empirical Studies Teresa Cai Group Meeting April 11, 2006.
Graph 8 a. Graph b. Domain _________ c. Range __________
Software Reliability Model Deterministic Models Probabilistic Models Halstead’s software metric McCabe’s cyclomatic complexity metrix Error seeding Failure.
1 841f06parnas13 Evaluation of Safety Critical Software David L. Parnas, C ACM, June 1990.
1 740f02frankl25 Evaluating Testing Methods by Delivered Reliability Frankl, Hamlet, Littlewood, Strigini IEEE TOSE Aug98.
1 Software Reliability Assurance for Real-time Systems Joel Henry, Ph.D. University of Montana NASA Software Assurance Symposium September 4, 2002.
1841f06detprob3 MM Stroustrup Ch26 u Comments? u Agree or disagree with his testing approach?
The Birthday Problem Section The Birthday Problem What is the probability that in a group of 37 students at least two of them share a birthday?
841f07frankl12oct21 Evaluating Testing Methods by Delivered Reliability Frankl, Hamlet, Littlewood, Strigini IEEE TOSE Aug98.
7-6 Function Operations Objective 2.01
Software Reliabilty1 Software Reliability Advanced Software Engineering COM360 University of Sunderland © 1998.
Math – What is a Function? 1. 2 input output function.
Exam 1 Review u Scores Min 30 Max 96 Ave 63.9 Std Dev 14.5.
1 Software Reliability Analysis Tools Joel Henry, Ph.D. University of Montana.
Simulating Experiments on the TI Section Starter Use the random integer generator in your calculator to choose an SRS of 5 students from.
Number your paper from 1 through 25.. Multiplication Facts Ready Set Begin.
1 Pre-exam2 Discussion Exam 2 Thurs, Nov 15 th 150 pts, 2 crib sheets allowed 841f07exam2preview23nov13 1.
Chapter 7: Sampling and Sampling distributions Statistical Inference is to make decisions that are based on data. We will study hypothesis testing, which.
Software Reliability Estimates/ Projections, Cumulative & Instantaneous Presented by Dave Dwyer With help from: Ann Marie Neufelder, John D. Musa, Martin.
8/23/00ISSTA Comparison of Delivered Reliability of Branch, Data Flow, and Operational Testing: A Case Study Phyllis G. Frankl Yuetang Deng Polytechnic.
Main Title Slide Software Reliability Estimates/ Projections, Cumulative & Instantaneous - Dave Dwyer With help from: Ann Marie Neufelder, John D. Musa,
1841f06detprob3 Testing Basics Detection probability.
Evaluating Testing Methods by Delivered Reliability Frankl, Hamlet, Littlewood, Strigini IEEE TOSE Aug98 Section 3.4.
1841f06detprob4 Testing Basics Detection probability.
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review Prof. Katherine Gibson.
Software Testing CS II: Data Structures & Abstraction
Fault Trees.
Chapter 6 Inferences Based on a Single Sample: Estimation with Confidence Intervals Slides for Optional Sections Section 7.5 Finite Population Correction.
Nov 13, handwritten crib sheet allowed 150 pts
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
CMSC202 Computer Science II for Majors Lecture 08 – Overloaded Constructors Dr. Katherine Gibson Based on slides by Chris Marron at UMBC.
Verification and Validation Overview
IT6004 – SOFTWARE TESTING.
CMSC201 Computer Science I for Majors Lecture 13 – Midterm Review
CMSC201 Computer Science I for Majors Lecture 27 – Final Exam Review
Structured Cyclic Schedule
Programming, Data & Testing
Software Reliability: 2 Alternate Definitions
Detection probability
Notes Over 2.1 Function {- 3, - 1, 1, 2 } { 0, 2, 5 }
Last Week of Quarter 3!.
Solving Multi-Step Equations pages 352 – 356
Multiplying & Dividing Integers
PROGRAMMING Program Development.
Failure Size Proportional Models
Mid Term II Review.
Probability: The Study of Randomness
Application: Efficiency of Algorithms I
Text for section 1 1 Text for section 2 2 Text for section 3 3
Text for section 1 1 Text for section 2 2 Text for section 3 3
АВЛИГАТАЙ ТЭМЦЭХ ҮНДЭСНИЙ ХӨТӨЛБӨР /танилцуулга/
Text for section 1 1 Text for section 2 2 Text for section 3 3
Evaluating Testing Methods by Delivered Reliability
Text for section 1 1 Text for section 2 2 Text for section 3 3
CSE 1020:Software Development
Text for section 1 1 Text for section 2 2 Text for section 3 3
Text for section 1 1 Text for section 2 2 Text for section 3 3
Text for section 1 1 Text for section 2 2 Text for section 3 3
Warm-Up Study the patterns below to determine the next five numbers in each sequence. You may use the calculator to check your answers. 2, 4, 6, 8, 10...
Objective: To graph square root functions
Text for section 1 1 Text for section 2 2 Text for section 3 3
Text for section 1 1 Text for section 2 2 Text for section 3 3
Text for section 1 1 Text for section 2 2 Text for section 3 3
CMSC201 Computer Science I for Majors Lecture 12 – Midterm Review
Presentation transcript:

Evaluating Testing Methods by Delivered Reliability Frankl, Hamlet, Littlewood, Strigini IEEE TOSE Aug98

From last Thursday How could you estimate detection probability for C0?

About Frankl’s article What parts are unclear? Any questions?

3.3 single failure region, with sub Debug with n subdomains E(Q) = qP(1-di)T/n Operational E(Q) = q(1-q)T

Assumptions: multiple failure model

Multiple Failure,debug w/o sub E(Q) = Sqi(1-di)T E(Q) = Sqi(1-qi)T

Example 2 – assume 100 tests in domain Fault 1 Fault 2 Fault 3 Fault 4 Fault 5 Tests in failure 1,2 3,4,5,6 7,8,9 10-19 20 What is E(Q) for debugging testing? What is E(Q) for operational testing if tests 1-20 are twice as likely as tests 21-100?

Empirical Tool Abstract domain to integers 1-100 Abstract failure sets into number ranges Run N (upto 5K) test tests Each test set may have subdomains or n random tests Determine frequency of each detect/notdetect combination Input q of each detect/notdetect combination Calculate E(Q)

Example Code for(i=1;i<MAX;i++){ answer = 0; int j; for (j=1;j<6;j++){ test = 1+ rand()%80; if (test <= 10) answer = answer + 1; if (test > 20 && test <= 25 ) { answer = answer + 2; error[2] = 1; } if ( test > 30 && test <=35 && error[2] == 0) answer = answer + 2; if (test > 35 && test <= 36){answer = answer + 4; error[4] = 1; } if (test > 36 && test <= 37) answer = answer + 8; if (test> 30 && test <= 32 && error[4] == 0) answer = answer + 4; if (test > 60 && test <= 62 && error[4] == 0) answer = answer + 4; if (test > 62 && test <= 63) answer = answer + 16; found[answer]++;

For Tuesday, Sep 12 Study Frankl through section 3.5 Finish empirical tool and try subdomain testing for the example in slides

1 min paper What is the muddiest point about Frankl’s paper?