Advances in computers Volume 95 Volume 95 /
Since its first volume in 1960, Advances in Computers has presented detailed coverage of innovations in computer hardware, software, theory, design, and applications. It has also provided contributors with a medium in which they can explore their subjects in greater depth and breadth than journal ar...
| Otros Autores: | , |
|---|---|
| Formato: | Libro electrónico |
| Idioma: | Inglés |
| Publicado: |
Waltham, Massachusetts ; San Diego, California :
Academic Press
2014.
|
| Edición: | 1st ed |
| Materias: | |
| Ver en Biblioteca Universitat Ramon Llull: | https://discovery.url.edu/permalink/34CSUC_URL/1im36ta/alma991009628393406719 |
Tabla de Contenidos:
- Cover image; Title page; Table of Contents; Copyright; Preface; Chapter One: Automated Test Oracles: A Survey; Abstract; 1 Introduction; 2 Test Oracles; 3 Scope of the Survey and Review Protocol; 4 The Test Oracle Process; 5 Information Sources and Translations of Test Oracles; 6 Checkable Forms of Test Oracles; 7 Summary and Future Directions; Chapter Two: Automated Extraction of GUI Models for Testing; Abstract; 1 Introduction; 2 Background; 3 Automated GUI Testing; 4 Reverse Engineering and Specification Mining; 5 Using Extracted Models to Automate GUI Testing; 6 Conclusion and Discussion
- Chapter Three: Automated Test Oracles: State of the Art, Taxonomies, and TrendsAbstract; 1 Introduction; 2 Background; 3 Oracles Taxonomies; 4 A Quantitative Analysis and a Mapping of Studies; 5 Discussions; 6 Final and Concluding Remarks; Acknowledgments; Chapter Four: Anti-Pattern Detection: Methods, Challenges, and Open Issues; Abstract; 1 Anti-Pattern: Definitions and Motivations; 2 Methods for the Detection of Anti-Patterns; 3 A New Frontier of Anti-Patterns: Linguistic Anti-Patterns; 4 Key Ingredients for Building an Anti-Pattern Detection Tool; 5 Conclusion and Open Issues
- Chapter Five: Classifying Problems into Complexity ClassesAbstract; 1 Introduction; 2 Time and Space Classes; 3 Relations Between Classes; 4 DSPACE(1) = Regular Languages; 5 L = DSPACE(LOG N); 6 NL = NSPACE(LOG n); 7 P = DTIME(nO(1)); 8 Randomized Polynomial Time: R; 9 NP = NTIME(nO(1)); 10 PH: The Polynomial Hierarchy; 11 #P; 12 PSPACE; 13 EXPTIME; 14 EXPSPACE = NEXPSPACE; 15 DTIME(TOWi(n)); 16 DSPACE(TOWi(nO(1))); 17 Elementary; 18 Primitive Recursive; 19 Ackermann''s Function; 20 The Goodstein Function; 21 Decidable, Undecidable and Beyond; 22 Summary of Relations Between Classes
- 23 Other Complexity Measures24 Summary; 25 What is Natural?; Acknowledgement; Author Index; Subject Index; Contents of Volumes in this Series
