Amazon cover image
Image from Amazon.com

Software Testing.

By: Material type: TextTextPublication details: Cambridge : Cambridge University Press, 2011.Description: 1 online resource (652 pages)Content type:
  • text
Media type:
  • computer
Carrier type:
  • online resource
ISBN:
  • 9781139528382
  • 1139528386
  • 1283812274
  • 9781283812276
  • 9781107012967
  • 1107012961
  • 9781139530668
  • 1139530666
  • 9781139525992
  • 1139525999
  • 9781139196185
  • 1139196189
  • 9781107652781
  • 1107652782
Subject(s): Additional physical formats: Print version:: Software Testing.DDC classification:
  • 005.14
LOC classification:
  • QA76.76.T48 S56 2011
Online resources:
Contents:
Cover; Title; Copyright; Contents; List of Figures; List of Tables; Preface; Acknowledgements; 1 Introduction; 1.1 SOME SOFTWARE FAILURES; 1.1.1 The Explosion of the Ariane 5 Rocket; 1.1.2 The Y2K Problem; 1.1.3 The USA Star-Wars Program; 1.1.4 Failure of London Ambulance System; 1.1.5 USS Yorktown Incident; 1.1.6 Accounting Software Failures; 1.1.7 Experience of Windows XP; 1.2 TESTING PROCESS; 1.2.1 What is Software Testing?; Modifications in the program 'Minimum'; 1.2.2 Why Should We Test?; 1.2.3 Who Should We Do the Testing?; 1.2.4 What Should We Test?; 1.3 SOME TERMINOLOGIES.
1.3.1 Program and Software1.3.2 Verification and Validation; 1.3.3 Fault, Error, Bug and Failure; 1.3.4 Test, Test Case and Test Suite; 1.3.5 Deliverables and Milestones; 1.3.6 Alpha, Beta and Acceptance Testing; 1.3.7 Quality and Reliability; 1.3.8 Testing, Quality Assurance and Quality Control; 1.3.9 Static and Dynamic Testing; 1.3.10 Testing and Debugging; 1.4 LIMITATIONS OF TESTING; 1.4.1 Errors in the Software Requirement and Specification Document; 1.4.2 Logical Bugs; 1.4.3 Difficult to Measure the Progress of Testing; 1.5 THE V SHAPED SOFTWARE LIFE CYCLE MODEL.
1.5.1 Graphical Representation1.5.2 Relationship of Development and Testing Parts; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 2 Functional Testing; 2.1 BOUNDARY VALUE ANALYSIS; 2.1.1 Robustness Testing; 2.1.2 Worst-Case Testing; 2.1.3 Robust Worst-Case Testing; 2.1.4 Applicability; 2.2 EQUIVALENCE CLASS TESTING; 2.2.1 Creation of Equivalence Classes; 2.2.2 Applicability; 2.3 DECISION TABLE BASED TESTING; 2.3.1 Parts of the Decision Table; 2.3.2 Limited Entry and Extended Entry Decision Tables; 2.3.3 'Do Not Care' Conditions and Rule Count; 2.3.4 Impossible Conditions.
2.3.5 Applicability2.4 CAUSE-EFFECT GRAPHING TECHNIQUE; 2.4.1 Identification of Causes and Effects; 2.4.2 Design of Cause-Effect Graph; 2.4.3 Use of Constraints in Cause-Effect Graph; 2.4.4 Design of Limited Entry Decision Table; 2.4.5 Writing of Test Cases; 2.4.6 Applicability; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 3 Essentials of Graph Theory; 3.1 WHAT IS A GRAPH?; 3.1.1 Degree of a Node; 3.1.2 Regular Graph; 3.2 MATRIX REPRESENTATION OF GRAPHS; 3.2.1 Incidence Matrix; 3.2.2 Adjacency Matrix; 3.3 PATHS AND INDEPENDENT PATHS; 3.3.1 Cycles; 3.3.2 Connectedness of a Graph.
3.4 GENERATION OF A GRAPH FROM PROGRAM3.4.1 Program Graphs; 3.4.2 DD Path Graphs; 3.5 IDENTIFICATION OF INDEPENDENT PATHS; 3.5.1 Cyclomatic Complexity; 3.5.2 Graph Matrices; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 4 Structural Testing; 4.1 CONTROL FLOW TESTING; 4.1.1 Statement Coverage; 4.1.2 Branch Coverage; 4.1.3 Condition Coverage; 4.1.4 Path Coverage; 4.2 DATA FLOW TESTING; 4.2.1 Define/Reference Anomalies; 4.2.2 Definitions; 4.2.3 Identification of du and dc Paths; 4.2.4 Testing Strategies Using du-Paths; 4.2.5 Generation of Test Cases; 4.3 SLICE BASED TESTING.
Summary: The book aims to present testing concepts and methods that can be used in practice.
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
eBook eBook e-Library EBSCO Computers Available
Total holds: 0

Cover; Title; Copyright; Contents; List of Figures; List of Tables; Preface; Acknowledgements; 1 Introduction; 1.1 SOME SOFTWARE FAILURES; 1.1.1 The Explosion of the Ariane 5 Rocket; 1.1.2 The Y2K Problem; 1.1.3 The USA Star-Wars Program; 1.1.4 Failure of London Ambulance System; 1.1.5 USS Yorktown Incident; 1.1.6 Accounting Software Failures; 1.1.7 Experience of Windows XP; 1.2 TESTING PROCESS; 1.2.1 What is Software Testing?; Modifications in the program 'Minimum'; 1.2.2 Why Should We Test?; 1.2.3 Who Should We Do the Testing?; 1.2.4 What Should We Test?; 1.3 SOME TERMINOLOGIES.

1.3.1 Program and Software1.3.2 Verification and Validation; 1.3.3 Fault, Error, Bug and Failure; 1.3.4 Test, Test Case and Test Suite; 1.3.5 Deliverables and Milestones; 1.3.6 Alpha, Beta and Acceptance Testing; 1.3.7 Quality and Reliability; 1.3.8 Testing, Quality Assurance and Quality Control; 1.3.9 Static and Dynamic Testing; 1.3.10 Testing and Debugging; 1.4 LIMITATIONS OF TESTING; 1.4.1 Errors in the Software Requirement and Specification Document; 1.4.2 Logical Bugs; 1.4.3 Difficult to Measure the Progress of Testing; 1.5 THE V SHAPED SOFTWARE LIFE CYCLE MODEL.

1.5.1 Graphical Representation1.5.2 Relationship of Development and Testing Parts; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 2 Functional Testing; 2.1 BOUNDARY VALUE ANALYSIS; 2.1.1 Robustness Testing; 2.1.2 Worst-Case Testing; 2.1.3 Robust Worst-Case Testing; 2.1.4 Applicability; 2.2 EQUIVALENCE CLASS TESTING; 2.2.1 Creation of Equivalence Classes; 2.2.2 Applicability; 2.3 DECISION TABLE BASED TESTING; 2.3.1 Parts of the Decision Table; 2.3.2 Limited Entry and Extended Entry Decision Tables; 2.3.3 'Do Not Care' Conditions and Rule Count; 2.3.4 Impossible Conditions.

2.3.5 Applicability2.4 CAUSE-EFFECT GRAPHING TECHNIQUE; 2.4.1 Identification of Causes and Effects; 2.4.2 Design of Cause-Effect Graph; 2.4.3 Use of Constraints in Cause-Effect Graph; 2.4.4 Design of Limited Entry Decision Table; 2.4.5 Writing of Test Cases; 2.4.6 Applicability; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 3 Essentials of Graph Theory; 3.1 WHAT IS A GRAPH?; 3.1.1 Degree of a Node; 3.1.2 Regular Graph; 3.2 MATRIX REPRESENTATION OF GRAPHS; 3.2.1 Incidence Matrix; 3.2.2 Adjacency Matrix; 3.3 PATHS AND INDEPENDENT PATHS; 3.3.1 Cycles; 3.3.2 Connectedness of a Graph.

3.4 GENERATION OF A GRAPH FROM PROGRAM3.4.1 Program Graphs; 3.4.2 DD Path Graphs; 3.5 IDENTIFICATION OF INDEPENDENT PATHS; 3.5.1 Cyclomatic Complexity; 3.5.2 Graph Matrices; MULTIPLE CHOICE QUESTIONS; EXERCISES; FURTHER READING; 4 Structural Testing; 4.1 CONTROL FLOW TESTING; 4.1.1 Statement Coverage; 4.1.2 Branch Coverage; 4.1.3 Condition Coverage; 4.1.4 Path Coverage; 4.2 DATA FLOW TESTING; 4.2.1 Define/Reference Anomalies; 4.2.2 Definitions; 4.2.3 Identification of du and dc Paths; 4.2.4 Testing Strategies Using du-Paths; 4.2.5 Generation of Test Cases; 4.3 SLICE BASED TESTING.

4.3.1 Guidelines for Slicing.

The book aims to present testing concepts and methods that can be used in practice.

Print version record.

Includes bibliographical references and index.

Added to collection customer.56279.3

Powered by Koha