You are previewing Advances in Computers.
O'Reilly logo
Advances in Computers

Book Description

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 articles usually allow. As a result, many articles have become standard references that continue to be of significant, lasting value in this rapidly expanding field.



  • In-depth surveys and tutorials on new computer technology
  • Well-known authors and researchers in the field
  • Extensive bibliographies with most chapters
  • Many of the volumes are devoted to single themes or subfields of computer science

Table of Contents

  1. Cover image
  2. Title page
  3. Table of Contents
  4. Copyright
  5. Preface
  6. Chapter One: Automated Test Oracles: A Survey
    1. Abstract
    2. 1 Introduction
    3. 2 Test Oracles
    4. 3 Scope of the Survey and Review Protocol
    5. 4 The Test Oracle Process
    6. 5 Information Sources and Translations of Test Oracles
    7. 6 Checkable Forms of Test Oracles
    8. 7 Summary and Future Directions
  7. Chapter Two: Automated Extraction of GUI Models for Testing
    1. Abstract
    2. 1 Introduction
    3. 2 Background
    4. 3 Automated GUI Testing
    5. 4 Reverse Engineering and Specification Mining
    6. 5 Using Extracted Models to Automate GUI Testing
    7. 6 Conclusion and Discussion
  8. Chapter Three: Automated Test Oracles: State of the Art, Taxonomies, and Trends
    1. Abstract
    2. 1 Introduction
    3. 2 Background
    4. 3 Oracles Taxonomies
    5. 4 A Quantitative Analysis and a Mapping of Studies
    6. 5 Discussions
    7. 6 Final and Concluding Remarks
    8. Acknowledgments
  9. Chapter Four: Anti-Pattern Detection: Methods, Challenges, and Open Issues
    1. Abstract
    2. 1 Anti-Pattern: Definitions and Motivations
    3. 2 Methods for the Detection of Anti-Patterns
    4. 3 A New Frontier of Anti-Patterns: Linguistic Anti-Patterns
    5. 4 Key Ingredients for Building an Anti-Pattern Detection Tool
    6. 5 Conclusion and Open Issues
  10. Chapter Five: Classifying Problems into Complexity Classes
    1. Abstract
    2. 1 Introduction
    3. 2 Time and Space Classes
    4. 3 Relations Between Classes
    5. 4 DSPACE(1) = Regular Languages
    6. 5 <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="bold">L&#160;=&#160;DSPACE(LOG <span class="italic">N</span></span>))
    7. 6 <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="bold">NL&#160;=&#160;NSPACE(LOG <span class="italic">n</span></span>))
    8. 7 P = DTIME(<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">n</span><sup xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops"><span class="italic">O</span>(1)</sup>))
    9. 8 Randomized Polynomial Time: <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic"><span class="bold">R</span></span>
    10. 9 NP = NTIME(<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">n</span><sup xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops"><span class="italic">O</span>(1)</sup>))
    11. 10 PH: The Polynomial Hierarchy
    12. 11 #P
    13. 12 PSPACE
    14. 13 EXPTIME
    15. 14 EXPSPACE = NEXPSPACE
    16. 15 DTIME(<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">TOW<sub>i</sub></span>((<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">n</span>))))
    17. 16 DSPACE(<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">TOW<sub>i</sub></span><span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="bold">(<span class="italic">n</span><sup>O(1)</sup>))</span>
    18. 17 Elementary
    19. 18 Primitive Recursive
    20. 19 Ackermann's Function
    21. 20 The Goodstein Function
    22. 21 Decidable, Undecidable and Beyond
    23. 22 Summary of Relations Between Classes
    24. 23 Other Complexity Measures
    25. 24 Summary
    26. 25 What is Natural?
    27. Acknowledgement
  11. Author Index
  12. Subject Index
  13. Contents of Volumes in this Series