Fundamental Approaches to Software Engineering 24th International Conference, FASE 2021, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2021, Luxembourg City, Luxembourg, March 27 - April 1, 2021, Proceedings
This open access book constitutes the proceedings of the 24th International Conference on Fundamental Approaches to Software Engineering, FASE 2021, which took place during March 27–April 1, 2021, and was held as part of the Joint Conferences on Theory and Practice of Software, ETAPS 2021. The confe...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | E-kniha |
| Jazyk: | angličtina |
| Vydáno: |
Netherlands
Springer Nature
2021
Springer International Publishing AG |
| Vydání: | 1 |
| Edice: | Lecture Notes in Computer Science; Theoretical Computer Science and General Issues |
| Témata: | |
| ISBN: | 3030715000, 9783030715007, 3030714993, 9783030714994 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
Obsah:
- 2 Method -- 2.1 Overall Design -- 2.2 The Oracle -- 2.3 The Mutator -- 2.4 The Fuzzer -- 3 Evaluation -- 3.1 Test Setting -- 3.2 Experiment Result -- 3.3 Threats to Validity -- 4 Related Work -- 5 Conclusion -- Acknowledgments -- References -- PASTA: An Efficient Proactive Adaptation Approach Based on Statistical Model Checking for Self-Adaptive Systems -- 1 Introduction -- 2 Related Work: Proactive Adaptation -- 3 Background: Statistical Model Checking (SMC) -- 4 Illustrative Example -- 5 Proactive Adaptation Based on Statistical Model Checking -- 5.1 PASTA overview -- 5.2 Knowledge -- 5.3 Monitoring Environmental Changes -- 5.4 Forecasting Future Environmental Change -- 5.5 Planning Adaptation Using SMC -- 5.6 Executing Adaptation -- 5.7 PASTA Implementation -- 6 Evaluation -- 6.1 Research Questions -- 6.2 Evaluation Setup -- 6.3 Evaluation Results -- 7 Threats to Validity -- 8 Conclusion -- Acknowledgement -- References -- Understanding Local Robustness of Deep Neural Networks under Natural Variations -- 1 Introduction -- 2 Background: DNN Testing -- 3 Methodology -- 3.1 Terminology -- 3.2 Data Collection -- 3.3 Classifying Robust vs. Weak Points -- 4 Experimental Design -- 4.1 Study Subjects -- 4.2 Evaluation -- 5 Results -- 6 Related Work -- 7 Threats to Validity -- 8 Conclusion and Future Work -- 9 Acknowledgement -- References -- Test-Comp Contributions -- Status Report on Software Testing: Test-Comp 2021 -- 1 Introduction -- 2 Definitions, Formats, and Rules -- 3 Categories and Scoring Schema -- 4 Reproducibility -- 5 Results and Discussion -- 6 Conclusion -- References -- CoVeriTest with Adaptive Time Scheduling (Competition Contribution) -- 1 Test-Generation Approach -- 2 Tool Architecture -- 3 Strengths and Weaknesses -- 4 Setup -- 5 Project and Contributors -- References
- Intro -- ETAPS Foreword -- Preface -- Organization -- Contents -- FASE Contributions -- On Benchmarking forConcurrent Runtime Verification -- 1 Introduction -- 2 Benchmark Design and Implementation -- 2.1 Approach -- 2.2 Realisability -- 2.3 Measurement Collection -- 3 Evaluation -- 3.1 Benchmark Expressiveness and Veracity -- 3.2 Case Study -- 4 Conclusion -- Reference -- Certified Abstract Cost Analysis -- 1 Introduction -- 2 QAE by Example -- 3 (Quantitative) Abstract Execution -- 3.1 Abstract Execution with Abstract Cost -- 3.2 Cost of Abstract Programs -- 3.3 Proving Quantitative Properties with QAE -- 4 Abstract Cost Analysis -- 4.1 Inference of Abstract Cost Relations -- 4.2 From ACRS to Abstract Cost Invariants -- 4.3 From Cost Invariants to Postconditions -- 5 Experimental Evaluation -- 6 Related Work -- 7 Conclusion and Future Work -- References -- Bootstrapping Automated Testing for RESTful Web Services -- 1 Introduction -- 2 Motivation -- 3 FET Techniques -- 3.1 Type Lattice -- 3.2 FET Lattice -- 3.3 FET Inference -- 4 FET-enhanced REST Fuzzing -- 4.1 Collecting and Parsing HTTP Traffic -- 4.2 Ubiquitous FET Lattice -- 4.3 FET-aware Trace-driven Fuzzing -- 5 Evaluation -- 5.1 FET Inference Accuracy Evaluation -- 5.2 Leif Effectiveness Evaluation -- 5.3 Comparative Evaluation -- 6 Related Work -- 7 Conclusion and Future Work -- Acknowledgments -- References -- A Decision Tree Lifted Domain for Analyzing Program Families with Numerical Features -- 1 Introduction -- 2 Motivating Example -- 3 A Language for Program Families -- 4 Lifted Analysis based on Tuples -- 5 Lifted Analysis based on Decision Trees -- 6 Evaluation -- 7 Related Work -- 8 Conclusion -- References -- Finding a Universal Execution Strategy for Model Transformation Networks -- 1 Introduction -- 2 Problem Statement -- 2.1 Motivating Example -- 2.2 Context
- Paracosm: A Test Framework for Autonomous Driving Simulations -- 1 Introduction -- 2 Paracosm through Examples -- 3 Systematic Testing of Paracosm Worlds -- 3.1 Test Inputs and Coverage -- 3.2 Test Generation -- 4 Implementation and Tests -- 4.1 Runtime System and Implementation -- 4.2 Evaluation -- 4.3 Case Studies -- 4.4 Results and Analysis -- 4.5 Threats to Validity -- 5 Related Work -- 6 Future Work and Conclusion -- Acknowledgements -- References -- Compositional Analysis of Probabilistic Timed Graph Transformation Systems -- 1 Introduction -- 2 Running Example -- 3 Preliminaries -- 4 Decomposition of Large-Scale Topologies -- 5 Overapproximation of Behavior -- 6 Evaluation -- 7 Conclusion and Future Work -- References -- Effcient Bounded Model Checking of Heap-Manipulating Programs using Tight Field Bounds -- 1 Introduction -- 2 A Motivating Example -- 3 Tight Field Bounds -- 4 A Technique for Nondeterministic Generation of Dynamic Structures -- 4.1 Computing Tight Field Bounds -- 5 Evaluation -- 6 Related Work -- 7 Conclusions -- References -- Effects of Program Representation on Pointer Analyses - An Empirical Study -- 1 Introduction -- 2 Background and Motivation -- 2.1 Intermediate Representation -- 2.2 Static modeling of libraries -- 2.3 Heap Abstraction -- 3 Methodology -- 3.1 Metrics Used -- 4 Evaluation -- 4.1 RQ1: Class hierarchy differences with benchmarks -- 4.2 RQ2: Precision differences with class hierarchy -- 4.3 RQ3: Precision for IR varies with the framework -- 4.4 RQ4: Heap abstractions in pointer analysis frameworks -- 5 Threats to Validity -- 6 Related Work -- 7 Conclusion -- References -- Keeping Pace with the History of Evolving Runtime Models -- 1 Introduction to InTempo -- 2 RTMнAnalysis -- 3 LogAnalysis -- 4 Conclusion and Future Work -- References -- SpecTest: Specification-Based Compiler Testing -- 1 Introduction
- FuSeBMC: A White-Box Fuzzer for Finding Security Vulnerabilities in C Programs (Competition Contribution) -- 1 Test Generation Approach -- 2 Strengths and Weaknesses -- 3 Tool Setup and Configuration -- 4 Software Project -- References -- Symbiotic 8: Parallel and Targeted Test Generation (Competition Contribution) -- 1 Test-Generation Approach -- 1.1 Workflow of Symbiotic 8 -- 2 Software Architecture -- 3 Strengths and Weaknesses -- 4 Tool Setup and Configuration -- 5 Software Project and Contributors -- References -- Author Index
- 2.3 Formalisation -- 3 Related Work -- 4 Design Space -- 4.1 One Execution per Transformation -- 4.2 Unlimited Executions -- 5 Proposed Strategy -- 5.1 Execution Order: Providing Explainability -- 5.2 Execution Bound: Reacting to Each Other -- 5.3 The Explanatory Strategy -- 6 Conclusion -- References -- CoVEGI: Cooperative Verification via Externally Generated Invariants -- 1 Introduction -- 2 Fundamentals -- 3 Concept -- 3.1 Components of the CoVEGI-Framework -- 3.2 Cooperation within CoVEGI -- 3.3 Witness Injection -- 3.4 Adapter for LLVM-based Helper Invariant Generators -- 4 Evaluation -- 4.1 Research Questions -- 4.2 Experimental Setup -- 4.3 Experimental Results -- 4.4 Threads to Validity -- 5 Related work -- 6 Conclusion -- References -- Engineering Secure Self-Adaptive Systems with Bayesian Games -- 1 Introduction -- 2 Background -- 2.1 Running Example -- 2.2 Bayesian Game Theory -- 3 Self-Adaptive Framework Incorporating Bayesian Game Theory -- 4 Bayesian Game Through Model Transformation -- 4.1 Analysis Results for Znn.com Example -- 5 Evaluation - Routing Games -- 5.1 Game Definition for Interdomain Routing -- 5.2 Dynamic Programming Algorithm -- 5.3 Experiment Setup & -- Results -- 6 Related Work -- 7 Conclusion and Future Work -- Acknowledgements -- References -- An Abstract Contract Theory for Programs with Procedures -- 1 Introduction -- 2 Contract Based Design -- 2.1 Contract Based Design of Cyber-Physical Systems -- 2.2 A Contract Meta-Theory -- 3 Denotational Semantics of Programs and Contracts -- 3.1 The Denotational Semantics of Programs with Procedures -- 3.2 Hoare Logic and Contracts -- 4 An Abstract Contract Theory -- 4.1 Components -- 4.2 Denotational Contracts -- 5 Connection to Meta-Theory -- 6 Connection to Programs with Procedures -- 7 Conclusion -- References