Advances in computers Volume 99 Volume 99 /

Advances in Computers carries on a tradition of excellence, presenting detailed coverage of innovations in computer hardware, software, theory, design, and applications. The book provides contributors with a medium in which they can explore their subjects in greater depth and breadth than journal...

Descripción completa

Detalles Bibliográficos
Otros Autores: Memon, Atif, author (author), Memon, Atif, editor (editor)
Formato: Libro electrónico
Idioma:Inglés
Publicado: Waltham, MA : Elsevier Science 2015.
Edición:First edition
Colección:Advances in Computers
Materias:
Ver en Biblioteca Universitat Ramon Llull:https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009629694306719
Tabla de Contenidos:
  • Front Cover; Advances in Computers; Copyright; Contents; Preface; Chapter One: Combinatorial Testing: Theory and Practice; 1. Introduction; 1.1. Empirical Data on Failures; 1.2. Implications for Testing; 2. Covering Arrays; 2.1. History of DoE; 2.2. From DoE to CAs; 2.3. Combinatorial Coverage; 2.3.1. Measures of Combinatorial Coverage; 2.3.2. Using Combinatorial Coverage; 3. Algorithms for CT; 3.1. Categories of Algorithms; 3.2. Algorithms for Higher Strength Combinatorial Test Suites; 3.3. Example Tools; 3.4. ACTS/CCM; 4. Input Partitioning and Representation
  • 4.1. Combinatorial Issues in Input Model Development 4.2. Size Considerations with CAs; 4.3. Modeling Environment Conditions and State; 4.4. Types of Constraints for Input Parameter Model; 4.4.1. Environment Constraints Versus System Constraints; 4.4.2. First-Order Constraints Versus Higher-Order Constraints; 4.4.3. Temporal Constraints Versus Nontemporal Constraints; 5. Constraints Handling in CA Algorithms; 5.1. Representations of Constraints; 5.2. Major Approaches to Constraint Handling; 5.2.1. The Abstract Parameters Approach; 5.2.2. The Submodels Approach; 5.2.3. The Avoid Approach
  • 5.2.4. The Replace Approach 5.3. Validity Checking for the Avoid Approach; 5.3.1. Constraint Solving-Based Validity Checking; 5.3.2. Forbidden Tuples-Based Validity Checking; 6. Case Studies; 6.1. Document Object Model; 6.2. Lockheed Martin; 7. Advanced Topics in CT; 7.1. Test Suite Prioritization; 7.1.1. Generation of Prioritized Test Suites by Combinatorial-Based Coverage; 7.1.2. Prioritization of Existing Test Suites by Combinatorial-Based Coverage; 7.2. Sequence Covering Arrays; 7.2.1. Example; 7.2.2. Generating Sequence Covering Arrays; 7.3. Fault Localization
  • 7.3.1. Identifying Failure-Inducing Combinations 7.3.2. Identifying Faults in the Source Code; 7.4. Relationship Between CT and Structural Coverage; 7.4.1. Basic Structural Coverage; 7.4.2. Effects of Input Model; 7.5. Testing Very Large Systems; 8. Future Directions; 8.1. Algorithms; 8.2. Input Modeling; 8.3. Harder Problems; Conclusions; References; About the Authors; Chapter Two: Constraint-Based Testing: An Emerging Trend in Software Testing; 1. Introduction; 1.1. Software Testing; 1.2. Constraint-Based Testing; 1.3. Constraint-Based Test Input Generation; 1.4. Organization of the Chapter
  • 2. A Motivating Example 3. Bibliographic Notes; 4. Foundations; 4.1. Constraint Generation; 4.1.1. Assignment; 4.1.2. Conditional; 4.1.3. Iteration; 4.2. Constraint Solving and Optimization; 4.3. Linear Programming for Test Data Generation; 4.4. SAT and SMT Solving for Test Input Generation; 4.5. Constraint Programming Approaches for Test Data Generation; 4.6. User-Defined Constraints; 4.7. The w Constraint for Handling Loops; 4.8. Illustrative Example; 5. Extensions; 5.1. Constraint Solving for Floating-Point Computations; 5.2. Test Input Generation for Object-Oriented Code; 6. Perspectives
  • References