Advances in Computers

Chapter One: Comparing Reuse Strategies in Different Development Environments

• Abstract
• 1 Introduction
• 2 Development Approaches for Embedded and Nonembedded Systems with Reuse
• 3 Review Process and Inclusion Criteria
• 4 Reuse and Development Approaches for Embedded versus Nonembedded Systems
• 5 Metrics Reported
• 6 Analysis of Outcomes
• 7 Threats to Validity
• 8 Conclusion and Future Work
• Acknowledgments
• Appendix A: Years of Publication

Chapter Two: Advances in Behavior Modeling

• Abstract
• 1 Introduction
• 2 Properties of the Modeling Semantics Needed for System Life Cycle Support
• 3 Events, States, Transitions, and Communication–Composition
• 4 Behavior Semantics in UML
• 5 Outside UML
• 6 Summary of Semantic Elements of Behavior Modeling Approaches and Their Properties
• Acknowledgments

Chapter Three: Overview of Computational Approaches for Inference of MicroRNA-Mediated and Gene Regulatory Networks

• Abstract
• 1 Introduction
• 2 Biological Backgrounds of Cell Regulatory Mechanisms and Experimental Technologies
• 3 Computational Backgrounds of the Inference of MiRNA-Mediated and GRNs
• 4 Models for GRNs Inference
• 5 Computational Approaches for Inference of MicroRNA-Mediated Regulatory Networks
• 6 Model Validation
• 7 Conclusion and Further Works

Chapter Four: Proving Programs Terminate Using Well-Founded Orderings, Ramsey's Theorem, and Matrices

• Abstract
• 1 Introduction
• 2 Notation and Definitions
• 3 A Proof Using the Order (N, ≤)
• 4 A Proof Using the Ordering (N × N × N × N, <_lex)
• 5 A General Theorem About Proving Programs Terminate Using Well-Founded Orderings
• 6 A Proof Using Ramsey's Theorem
• 7 A General Theorem About Proving Programs Terminate Using Ramsey Theorem
• 8 A Proof Using Matrices and Ramsey's Theorem
• 9 Another Proof Using Matrices and Ramsey's Theorem
• 10 A Proof Using Transition Invariants and Ramsey's Theorem
• 11 Another Proof Using Transition Invariants and Ramsey's Theorem
• 12 Solving Subcases of the Termination Problem
• 13 How Much Ramsey Theory Do We Need?
• 14 Open Problems
• 15 Summary
• Acknowledgments
• A Using Just C₁ and C₂ to Prove Termination
• B A Verification That Needs the Full Ramsey Theory
• C Ramsey's Theorem
• D The Transitive Ramsey Theorem

Chapter Five: Advances in Testing JavaScript-Based Web Applications

• Abstract
• 1 Introduction
• 2 Empirical Studies
• 3 Testing Techniques
• 4 Test Oracles
• 5 Test Adequacy Assessment
• 6 Handling Failures
• 7 Programmer Support
• 8 Concluding Remarks