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: Comparing Reuse Strategies in Different Development Environments
    1. Abstract
    2. 1 Introduction
    3. 2 Development Approaches for Embedded and Nonembedded Systems with Reuse
    4. 3 Review Process and Inclusion Criteria
    5. 4 Reuse and Development Approaches for Embedded versus Nonembedded Systems
    6. 5 Metrics Reported
    7. 6 Analysis of Outcomes
    8. 7 Threats to Validity
    9. 8 Conclusion and Future Work
    10. Acknowledgments
    11. Appendix A: Years of Publication
  7. Chapter Two: Advances in Behavior Modeling
    1. Abstract
    2. 1 Introduction
    3. 2 Properties of the Modeling Semantics Needed for System Life Cycle Support
    4. 3 Events, States, Transitions, and Communication–Composition
    5. 4 Behavior Semantics in UML
    6. 5 Outside UML
    7. 6 Summary of Semantic Elements of Behavior Modeling Approaches and Their Properties
    8. Acknowledgments
  8. Chapter Three: Overview of Computational Approaches for Inference of MicroRNA-Mediated and Gene Regulatory Networks
    1. Abstract
    2. 1 Introduction
    3. 2 Biological Backgrounds of Cell Regulatory Mechanisms and Experimental Technologies
    4. 3 Computational Backgrounds of the Inference of MiRNA-Mediated and GRNs
    5. 4 Models for GRNs Inference
    6. 5 Computational Approaches for Inference of MicroRNA-Mediated Regulatory Networks
    7. 6 Model Validation
    8. 7 Conclusion and Further Works
  9. Chapter Four: Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices
    1. Abstract
    2. 1 Introduction
    3. 2 Notation and Definitions
    4. 3 A Proof Using the Order (<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="sansserif">N</span>, &#8804;), ≤)
    5. 4 A Proof Using the Ordering (<span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="sansserif">N</span> &#215; × <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="sansserif">N</span> &#215; × <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="sansserif">N</span> &#215; × <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="sansserif">N</span>, &lt;, <<sub xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops">lex</sub>))
    6. 5 A General Theorem About Proving Programs Terminate Using Well-Founded Orderings
    7. 6 A Proof Using Ramsey's Theorem
    8. 7 A General Theorem About Proving Programs Terminate Using Ramsey Theorem
    9. 8 A Proof Using Matrices and Ramsey's Theorem
    10. 9 Another Proof Using Matrices and Ramsey's Theorem
    11. 10 A Proof Using Transition Invariants and Ramsey's Theorem
    12. 11 Another Proof Using Transition Invariants and Ramsey's Theorem
    13. 12 Solving Subcases of the Termination Problem
    14. 13 How Much Ramsey Theory Do We Need?
    15. 14 Open Problems
    16. 15 Summary
    17. Acknowledgments
    18. A Using Just <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">C</span><sub xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops">1</sub> and and <span xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops" class="italic">C</span><sub xmlns="http://www.w3.org/1999/xhtml" xmlns:epub="http://www.idpf.org/2007/ops">2</sub> to Prove Termination to Prove Termination
    19. B A Verification That Needs the Full Ramsey Theory
    20. C Ramsey's Theorem
    21. D The Transitive Ramsey Theorem
  10. Chapter Five: Advances in Testing JavaScript-Based Web Applications
    1. Abstract
    2. 1 Introduction
    3. 2 Empirical Studies
    4. 3 Testing Techniques
    5. 4 Test Oracles
    6. 5 Test Adequacy Assessment
    7. 6 Handling Failures
    8. 7 Programmer Support
    9. 8 Concluding Remarks
  11. Author Index
  12. Subject Index
  13. Contents of Volumes in This Series