Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach srs@vuse.vanderbilt.edu.

Slides:



Advertisements
Similar presentations
Testing Relational Database
Advertisements

Agenda Definitions Evolution of Programming Languages and Personal Computers The C Language.
Software Testing. Quality is Hard to Pin Down Concise, clear definition is elusive Not easily quantifiable Many things to many people You'll know it when.
SOFTWARE TESTING. INTRODUCTION  Software Testing is the process of executing a program or system with the intent of finding errors.  It involves any.
The Assembly Language Level
10 Software Engineering Foundations of Computer Science ã Cengage Learning.
Testing During Implementation 1 *Testing During Implementation (Schach, Chap 15)  Once Source Code Available, can test code's Execution  Worst way —
Case Tools Trisha Cummings. Our Definition of CASE  CASE is the use of computer-based support in the software development process.  A CASE tool is a.
Slide 10.1 CHAPTER 10 REQUIREMENTS PHASE. Slide 10.2 Overview l Requirements elicitation l Requirements analysis l Rapid prototyping l Human factors l.
Slide 14A.1 © The McGraw-Hill Companies, 2005 Object-Oriented and Classical Software Engineering Sixth Edition, WCB/McGraw-Hill, 2005 Stephen R. Schach.
Object-Oriented Analysis and Design Lecture 10 Implementation (from Schach, “O-O and Classical Software Engineering”)
IMSE Week 18 White Box or Structural Testing Reading:Sommerville (4th edition) ch 22 orPressman (4th edition) ch 16.
Slide 10.1 © The McGraw-Hill Companies, 2002 Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach.
Testing an individual module
1 Implementation Xiaojun Qi. 2 Choice of Programming Language The language is usually specified in the contract But what if the contract specifies that.
OHT 9.1 Galin, SQA from theory to implementation © Pearson Education Limited 2004 Chapter 9.3 Software Testing Strategies.
Software Testing Sudipto Ghosh CS 406 Fall 99 November 9, 1999.
Slide 14.1 CHAPTER 14 IMPLEMENTATION PHASE. Slide 14.2 Overview l Choice of programming language l Fourth generation languages l Good programming practice.
CMSC 345 Fall 2000 Unit Testing. The testing process.
Chapter 13: Implementation Phase 13.3 Good Programming Practice 13.6 Module Test Case Selection 13.7 Black-Box Module-Testing Techniques 13.8 Glass-Box.
Slide 14.1 © The McGraw-Hill Companies, 2002 Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach.
SE: CHAPTER 7 Writing The Program
©Ian Sommerville 2004Software Engineering, 7th edition. Chapter 22 Slide 1 Software Verification, Validation and Testing.
Historical Aspects Origin of software engineering –NATO study group coined the term in 1967 Software crisis –Low quality, schedule delay, and cost overrun.
Berrached::CS3320::Ch131 Implementation Phase Chapter 13 Classical & Object-Oriented Software Engineering by Stephen R. Schach.
 Test Plan  Testing strategies ◦ Unit testing ◦ Integration testing ◦ Product testing ◦ Acceptance testing  Test case selection  Testing Techniques.
1 CSCD 326 Data Structures I Software Design. 2 The Software Life Cycle 1. Specification 2. Design 3. Risk Analysis 4. Verification 5. Coding 6. Testing.
Slide 13.1 © The McGraw-Hill Companies, 2002 Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach.
Software Quality Assurance and Testing Fazal Rehman Shamil.
Object-Oriented and Classical Software Engineering Seventh Edition, WCB/McGraw-Hill, 2010 Stephen R. Schach
Chapter 1 The Phases of Software Development. Software Development Phases ● Specification of the task ● Design of a solution ● Implementation of solution.
CS223: Software Engineering Lecture 21: Unit Testing Metric.
Verification vs. Validation Verification: "Are we building the product right?" The software should conform to its specification.The software should conform.
Software Testing. SE, Testing, Hans van Vliet, © Nasty question  Suppose you are being asked to lead the team to test the software that controls.
1 Software Testing. 2 What is Software Testing ? Testing is a verification and validation activity that is performed by executing program code.
Paul Ammann & Jeff Offutt
Software Testing.
Group mambers: Maira Naseer (BCS ).
Regression Testing with its types
Integration Testing.
8.4 Management of Postdelivery Maintenance
Software Metrics 1.
Software Testing.
Software Engineering (CSI 321)
System Design and Modeling
Principles of Programming and Software Engineering
Object-Oriented and Classical Software Engineering Eighth Edition, WCB/McGraw-Hill, 2011 Stephen R. Schach 1.
Life Cycle Models PPT By :Dr. R. Mall.
Chapter 13 & 14 Software Testing Strategies and Techniques
Structural testing, Path Testing
Types of Testing Visit to more Learning Resources.
UNIT-4 BLACKBOX AND WHITEBOX TESTING
Computer Programming.
Designing and Debugging Batch and Interactive COBOL Programs
Tools of Software Development
Unit# 9: Computer Program Development
Software testing strategies 2
Software System Integration
Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach
Programming Logic and Design Fourth Edition, Comprehensive
Test Case Test case Describes an input Description and an expected output Description. Test case ID Section 1: Before execution Section 2: After execution.
CHAPTER 15 IMPLEMENTATION.
Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach
Software Testing “If you can’t test it, you can’t design it”
Applying Use Cases (Chapters 25,26)
Applying Use Cases (Chapters 25,26)
Configuration management
WALKTHROUGH and INSPECTION
UNIT-4 BLACKBOX AND WHITEBOX TESTING
Chapter 13 & 14 Software Testing Strategies and Techniques 1 Software Engineering: A Practitioner’s Approach, 6th edition by Roger S. Pressman.
Presentation transcript:

Object-Oriented and Classical Software Engineering Fifth Edition, WCB/McGraw-Hill, 2002 Stephen R. Schach srs@vuse.vanderbilt.edu

CHAPTER 14 IMPLEMENTATION PHASE

Overview Choice of programming language Fourth generation languages Good programming practice Coding standards Module reuse Module test case selection Black-box module-testing techniques Glass-box module-testing techniques

Overview (contd) Code walkthroughs and inspections Comparison of module-testing techniques Cleanroom Potential problems when testing objects Management aspects of module testing When to rewrite rather than debug a module CASE tools for the implementation phase Air Gourmet Case Study: Black-box test cases Challenges of the implementation phase

Implementation Phase Programming-in-the-many Choice of Programming Language Language is usually specified in contract But what if the contract specifies The product is to be implemented in the “most suitable” programming language What language should be chosen?

Choice of Programming Language (contd) Example QQQ Corporation has been writing COBOL programs for over 25 years Over 200 software staff, all with COBOL expertise What is “most suitable” programming language? Obviously COBOL

Choice of Programming Language (contd) What happens when new language (C++, say) is introduced New hires Retrain existing professionals Future products in C++ Maintain existing COBOL products Two classes of programmers COBOL maintainers (despised) C++ developers (paid more) Need expensive software, and hardware to run it 100s of person-years of expertise with COBOL wasted

Choice of Programming Language (contd) Only possible conclusion COBOL is the “most suitable” programming language And yet, the “most suitable” language for the latest project may be C++ COBOL is suitable for only DP applications How to choose a programming language Cost-benefit analysis Compute costs, benefits of all relevant languages

Choice of Programming Language (contd) Which is the most appropriate object-oriented language? C++ is (unfortunately) C-like Java enforces the object-oriented paradigm Training in the object-oriented paradigm is essential before adopting any object-oriented language What about choosing a fourth generation language (4GL)?

Fourth Generation Languages First generation languages Machine languages Second generation languages Assemblers Third generation languages High-level languages (COBOL, FORTRAN, C++) Fourth generation languages (4GLs) One 3GL statement is equivalent to 5–10 assembler statements Each 4GL statement intended to be equivalent to 30 or even 50 assembler statements

Fourth Generation Languages (contd) It was hoped that 4GLs would Speed up application-building Applications easy, quick to change Reducing maintenance costs Simplify debugging Make languages user friendly Leading to end-user programming Achievable if 4GL is a user friendly, very high-level language

Fourth Generation Languages (contd) Example (“Just in Case You Wanted to Know” box, page 438) The power of a nonprocedural language, and the price

Productivity Increases with a 4GL? The picture is not uniformly rosy Problems with Poor management techniques Poor design methods James Martin suggests use of Prototyping Iterative design Computerized data management Computer-aided structuring Is he right? Does he (or anyone else) know?

Actual Experiences with 4GLs Playtex used ADF, obtained an 80 to 1 productivity increase over COBOL However, Playtex then used COBOL for later applications 4GL productivity increases of 10 to 1 over COBOL have been reported However, there are plenty of reports of bad experiences

Actual Experiences with 4GLs (contd) Attitudes of 43 Organizations to 4GLs Use of 4GL reduced users’ frustrations Quicker response from DP department 4GLs slow and inefficient, on average Overall, 28 organizations using 4GL for over 3 years felt that the benefits outweighed the costs

Fourth Generation Languages (contd) Market share No one 4GL dominates the software market There are literally hundreds of 4GLs Dozens with sizable user groups Reason No one 4GL has all the necessary features Conclusion Care has to be taken in selecting the appropriate 4GL

Key Factors When Using a 4GL Large sums for training Management techniques for 4GL, not for COBOL Design methods must be appropriate, especially computer-aided design Interactive prototyping 4GLs and complex products

Key Factors When Using a 4GL (contd) Dangers of a 4GL Deceptive simplicity End-user programming

Good Programming Practice Use of “consistent” and “meaningful” variable names “Meaningful” to future maintenance programmer “Consistent” to aid maintenance pyrogrammer

Good Programming Practice Example Module contains variables freqAverage, frequencyMaximum, minFr, frqncyTotl Maintenance programmer has to know if freq, frequency, fr, frqncy all refer to the same thing If so, use identical word, preferably frequency, perhaps freq or frqncy, not fr If not, use different word (e.g., rate) for different quantity Can use frequencyAverage, frequencyMyaximum, frequencyMinimum, frequencyTotal Can also use averageFrequency, maximumFrequency, minimumFrequency, totalFrequency All four names must come from the same set

Good Programming Practice (contd) Issue of self-documenting code Exceedingly rare Key issue: Can module be understood easily and unambiguously by SQA team Maintenance programmers All others who have to read the code

Good Programming Practice (contd) Example Variable xCoordinateOfPositionOfRobotArm Abbreviated to xCoord Entire module deals with the movement of the robot arm But does the maintenance programmer know this?

Prologue Comments Mandatory at top of every single module Minimum information Module name Brief description of what the module does Programmer’s name Date module was coded Date module was approved, and by whom Module parameters Variable names, in alphabetical order, and uses Files accessed by this module Files updated by this module Module i/o Error handling capabilities Name of file of test data (for regression testing) List of modifications made, when, approved by whom Known faults, if any

Other Comments Suggestion Nonsense! Comments are essential whenever code is written in a non-obvious way, or makes use of some subtle aspect of the language Nonsense! Recode in a clearer way We must never promote/excuse poor programming However, comments can assist maintenance programmers Code layout for increased readability Use indentation Better, use a pretty-printer Use blank lines

Nested if Statements Example Map consists of two squares. Write code to determine whether a point on the Earth’s surface lies in map square 1 or map square 2, or is not on the map

Nested if Statements (contd) Solution 1. Badly formatted

Nested if Statements (contd) Solution 2. Well-formatted, badly constructed

Nested if Statements (contd) Solution 3. Acceptably nested

Nested if Statements (contd) Combination of if-if and if-else-if statements is usually difficult to read Simplify: The if-if combination if <condition1> if <condition2> is frequently equivalent to the single condition if <condition1> && <condition2> Rule of thumb if statements nested to a depth of greater than three should be avoided as poor programming practice

Programming Standards Can be both a blessing and a curse Modules of coincidental cohesion arise from rules like “Every module will consist of between 35 and 50 executable statements” Better “Programmers should consult their managers before constructing a module with fewer than 35 or more than 50 executable statements”

Remarks on Programming Standards No standard can ever be universally applicable Standards imposed from above will be ignored Standard must be checkable by machine

Remarks on Programming Standards (contd) Examples of good programming standards “Nesting of if statements should not exceed a depth of 3, except with prior approval from the team leader” “Modules should consist of between 35 and 50 statements, except with prior approval from the team leader” “Use of gotos should be avoided. However, with prior approval from the team leader, a forward goto may be used for error handling”

Remarks on Programming Standards (contd) Aim of standards is to make maintenance easier If it makes development difficult, then must be modified Overly restrictive standards are counterproductive Quality of software suffers

Software Quality Control After preliminary testing by the programmer, the module is handed over to the SQA group

Module Reuse The most common form of reuse

Module Test Case Selection Worst way—random testing Need systematic way to construct test cases

Module Test Case Selection (contd) Two extremes to testing 1. Test to specifications (also called black-box, data-driven, functional, or input/output driven testing) Ignore code. Use specifications to select test cases 2. Test to code (also called glass-box, logic-driven, structured, or path-oriented testing) Ignore specifications. Use code to select test cases

Feasibility of Testing to Specifications Example Specifications for data processing product include 5 types of commission and 7 types of discount 35 test cases Cannot say that commission and discount are computed in two entirely separate modules—the structure is irrelevant

Feasibility of Testing to Specifications Suppose specs include 20 factors, each taking on 4 values 420 or 1.1 ´ 1012 test cases If each takes 30 seconds to run, running all test cases takes > 1 million years Combinatorial explosion makes testing to specifications impossible

Feasibility of Testing to Code Each path through module must be executed at least once Combinatorial explosion

Feasibility of Testing to Code (contd) Flowchart has over 1012 different paths

Feasibility of Testing to Code (contd) Can exercise every path without detecting every fault

Feasibility of Testing to Code (contd) Path can be tested only if it is present Weaker Criteria Exercise both branches of all conditional statements Execute every statement

Feasibility of Testing to Code (contd) Can exercise every path without detecting every fault Path can be tested only if it is present Weaker Criteria Exercise both branches of all conditional statements Execute every statement

Coping with the Combinatorial Explosion Neither testing to specifications nor testing to code is feasible The art of testing: Select a small, manageable set of test cases to Maximize chances of detecting fault, while Minimizing chances of wasting test case Every test case must detect a previously undetected fault

Coping with the Combinatorial Explosion We need a method that will highlight as many faults as possible First black-box test cases (testing to specifications) Then glass-box methods (testing to code)

Black-Box Module Testing Methods Equivalence Testing Example Specifications for DBMS state that product must handle any number of records between 1 and 16,383 (214–1) If system can handle 34 records and 14,870 records, then probably will work fine for 8,252 records If system works for any one test case in range (1..16,383), then it will probably work for any other test case in range Range (1..16,383) constitutes an equivalence class Any one member is as good a test case as any other member of the class

Equivalence Testing (contd) Range (1..16,383) defines three different equivalence classes: Equivalence Class 1: Fewer than 1 record Equivalence Class 2: Between 1 and 16,383 records Equivalence Class 3: More than 16,383 records

Boundary Value Analysis Select test cases on or just to one side of the boundary of equivalence classes This greatly increases the probability of detecting fault

Database Example Test case 1: 0 records Member of equivalence class 1 (and adjacent to boundary value) Test case 2: 1 record Boundary value Test case 3: 2 records Adjacent to boundary value Test case 4: 723 records Member of equivalence class 2

Boundary Value Analysis of Output Specs Example: In 2001, the minimum Social Security (OASDI) deduction from any one paycheck was $0.00, and the maximum was $4,984.80 Test cases must include input data which should result in deductions of exactly $0.00 and exactly $4,984.80 Also, test data that might result in deductions of less than $0.00 or more than $4,984.80

Overall Strategy Equivalence classes together with boundary value analysis to test both input specifications and output specifications Small set of test data with potential of uncovering large number of faults

Glass-Box Module Testing Methods Structural testing Statement coverage Branch coverage Linear code sequences All-definition-use path coverage

Structural Testing: Statement Coverage Series of test cases to check every statement CASE tool needed to keep track Weakness Branch statements Both statements can be executed without the fault showing up

Structural Testing: Branch Coverage Series of tests to check all branches (solves above problem) Again, a CASE tool is needed Structural testing: path coverage

Linear Code Sequences In a product with a loop, the number of paths is very large, and can be infinite We want a weaker condition than all paths but that shows up more faults than branch coverage Linear code sequences Identify the set of points L from which control flow may jump, plus entry and exit points Restrict test cases to paths that begin and end with elements of L This uncovers many faults without testing every path

All-definition-use-path Coverage Each occurrence of variable, zz say, is labeled either as The definition of a variable zz = 1 or read (zz) or the use of variable y = zz + 3 or if (zz < 9) errorB () Identify all paths from the definition of a variable to the use of that definition This can be done by an automatic tool A test case is set up for each such path

All-definition-use-path Coverage (contd) Disadvantage: Upper bound on number of paths is 2d, where d is the number of branches In practice The actual number of paths is proportional to d in real cases This is therefore a practical test case selection technique

Infeasible Code It may not be possible to test a specific statement May have an infeasible path (“dead code”) in the module Frequently this is evidence of a fault

Measures of Complexity Quality assurance approach to glass-box testing Module m1 is more “complex” than module m2 Metric of software complexity Highlights modules mostly likely to have faults If complexity is unreasonably high, then redesign, reimplement Cheaper and faster

Lines of Code Simplest measure of complexity Underlying assumption: Constant probability p that a line of code contains a fault Example Tester believes line of code has 2% chance of containing a fault. If module under test is 100 lines long, then it is expected to contain 2 faults Number of faults is indeed related to the size of the product as a whole

Other Measures of Complexity Cyclomatic complexity M (McCabe) Essentially the number of decisions (branches) in the module Easy to compute A surprisingly good measure of faults (but see later) Modules with M > 10 have statistically more errors (Walsh)

Software Science Metrics [Halstead] Used for fault prediction Basic elements are the number of operators and operands in the module Widely challenged Example

Problem with These Metrics Both Software Science, cyclomatic complexity: Strong theoretical challenges Strong experimental challenges High correlation with LOC Thus we are measuring LOC, not complexity Apparent contradiction LOC is a poor metric for predicting productivity No contradiction — LOC is used here to predict fault rates, not productivity

Code Walkthroughs and Inspections Rapid and thorough fault detection Up to 95% reduction in maintenance costs [Crossman, 1982]

Comparison: Module Testing Techniques Experiments comparing Black-box testing Glass-box testing Reviews (Myers, 1978) 59 highly experienced programmers All three methods equally effective in finding faults Code inspections less cost-effective (Hwang, 1981) All three methods equally effective

Comparison: Module Testing Techniques (contd) Tests of 32 professional programmers, 42 advanced students in two groups (Basili and Selby, 1987) Professional programmers Code reading detected more faults Code reading had a faster fault detection rate Advanced students, group 1 No significant difference between the three methods Advanced students, group 2 Code reading and black-box testing were equally good Both outperformed glass-box testing

Comparison: Module Testing Techniques (contd) Conclusion Code inspection is at least as successful at detecting faults as glass-box and black-box testing

Cleanroom Different approach to software development Incorporates Incremental process model Formal techniques Reviews

Cleanroom (contd) Case study 1820 lines of FoxBASE (U.S. Naval Underwater Systems Center, 1992) 18 faults detected by “functional verification” Informal proofs 19 faults detected in walkthroughs before compilation NO compilation errors NO execution-time failures

Cleanroom (contd) Fault counting procedures differ: Usual paradigms Count faults after informal testing (once SQA starts) Cleanroom Count faults after inspections (once compilation starts)

Cleanroom (contd) Report on 17 Cleanroom products [Linger, 1994] 350,000 line product, team of 70, 18 months 1.0 faults per KLOC Total of 1 million lines of code Weighted average: 2.3 faults per KLOC “[R]emarkable quality achievement”

Testing Objects We must inspect classes, objects We can run test cases on objects Classical module About 50 executable statements Give input arguments, check output arguments Object About 30 methods, some with 2, 3 statements Do not return value to caller—change state It may not be possible to check state—information hiding Method determine balance—need to know accountBalance before, after

Testing Objects (contd) Need additional methods to return values of all state variables Part of test plan Conditional compilation Inherited method may still have to be tested

Testing Objects (contd) Java implementation of tree hierarchy

Testing Objects (contd) Top half When displayNodeContents is invoked in BinaryTree, it uses RootedTree.printRoutine

Testing Objects (contd) Bottom half When displayNodeContents is invoked in method BalancedBinaryTree, it uses BalancedBinaryTree.printRoutine

Testing Objects (contd) Bad news BinaryTree.displayNodeContents must be retested from scratch when reused in method BalancedBinaryTree Invokes totally new printRoutine Worse news For theoretical reasons, we need to test using totally different test cases

Testing Objects (contd) Two testing problems: Making state variables visible Minor issue Retesting before reuse Arises only when methods interact We can determine when this retesting is needed [Harrold, McGregor, and Fitzpatrick, 1992] Not reasons to abandon the paradigm

Module Testing: Management Implications We need to know when to stop testing Cost–benefit analysis Risk analysis Statistical techniques

When to Rewrite Rather Than Debug When a module has too many faults It is cheaper to redesign, recode Risk, cost of further faults

Fault Distribution In Modules Is Not Uniform [Myers, 1979] 47% of the faults in OS/370 were in only 4% of the modules [Endres, 1975] 512 faults in 202 modules of DOS/VS (Release 28) 112 of the modules had only one fault There were modules with 14, 15, 19 and 28 faults, respectively The latter three were the largest modules in the product, with over 3000 lines of DOS macro assembler language The module with 14 faults was relatively small, and very unstable A prime candidate for discarding, recoding

Fault Distribution In Modules Not Uniform (contd) For every module, management must predetermine maximum allowed number of faults during testing If this number is reached Discard Redesign Recode Maximum number of faults allowed after delivery is ZERO

Air Gourmet Case Study: Black-Box Test Cases Sample black-box test cases Appendix J contains complete set

Challenges of the Implementation Phase Module reuse needs to be built into the product from the very beginning Reuse must be a client requirement Software project management plan must incorporate reuse