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.
Saved in:
Superior document: | Lecture Notes in Computer Science Series ; v.12649 |
---|---|
: | |
TeilnehmendeR: | |
Place / Publishing House: | Cham : : Springer International Publishing AG,, 2021. ©2021. |
Year of Publication: | 2021 |
Edition: | 1st ed. |
Language: | English |
Series: | Lecture Notes in Computer Science Series
|
Online Access: | |
Physical Description: | 1 online resource (383 pages) |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
id |
5006523277 |
---|---|
ctrlnum |
(MiAaPQ)5006523277 (Au-PeEL)EBL6523277 (OCoLC)1244545481 |
collection |
bib_alma |
record_format |
marc |
spelling |
Guerra, Esther. 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. 1st ed. Cham : Springer International Publishing AG, 2021. ©2021. 1 online resource (383 pages) text txt rdacontent computer c rdamedia online resource cr rdacarrier Lecture Notes in Computer Science Series ; v.12649 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. 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. 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. 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. 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. Description based on publisher supplied metadata and other sources. Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. Electronic books. Stoelinga, Mariëlle. Print version: Guerra, Esther Fundamental Approaches to Software Engineering Cham : Springer International Publishing AG,c2021 9783030714994 ProQuest (Firm) Lecture Notes in Computer Science Series https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6523277 Click to View |
language |
English |
format |
eBook |
author |
Guerra, Esther. |
spellingShingle |
Guerra, Esther. 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. Lecture Notes in Computer Science Series ; 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. 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. 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. 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. 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. |
author_facet |
Guerra, Esther. Stoelinga, Mariëlle. |
author_variant |
e g eg |
author2 |
Stoelinga, Mariëlle. |
author2_variant |
m s ms |
author2_role |
TeilnehmendeR |
author_sort |
Guerra, Esther. |
title |
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. |
title_sub |
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. |
title_full |
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. |
title_fullStr |
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. |
title_full_unstemmed |
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. |
title_auth |
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. |
title_new |
Fundamental Approaches to Software Engineering : |
title_sort |
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. |
series |
Lecture Notes in Computer Science Series ; |
series2 |
Lecture Notes in Computer Science Series ; |
publisher |
Springer International Publishing AG, |
publishDate |
2021 |
physical |
1 online resource (383 pages) |
edition |
1st ed. |
contents |
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. 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. 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. 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. 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. |
isbn |
9783030715007 9783030714994 |
callnumber-first |
Q - Science |
callnumber-subject |
QA - Mathematics |
callnumber-label |
QA76 |
callnumber-sort |
QA 276.758 |
genre |
Electronic books. |
genre_facet |
Electronic books. |
url |
https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6523277 |
illustrated |
Not Illustrated |
oclc_num |
1244545481 |
work_keys_str_mv |
AT guerraesther fundamentalapproachestosoftwareengineering24thinternationalconferencefase2021heldaspartoftheeuropeanjointconferencesontheoryandpracticeofsoftwareetaps2021luxembourgcityluxembourgmarch27april12021proceedings AT stoelingamarielle fundamentalapproachestosoftwareengineering24thinternationalconferencefase2021heldaspartoftheeuropeanjointconferencesontheoryandpracticeofsoftwareetaps2021luxembourgcityluxembourgmarch27april12021proceedings |
status_str |
n |
ids_txt_mv |
(MiAaPQ)5006523277 (Au-PeEL)EBL6523277 (OCoLC)1244545481 |
carrierType_str_mv |
cr |
hierarchy_parent_title |
Lecture Notes in Computer Science Series ; v.12649 |
is_hierarchy_title |
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. |
container_title |
Lecture Notes in Computer Science Series ; v.12649 |
author2_original_writing_str_mv |
noLinkedField |
_version_ |
1792331059411550208 |
fullrecord |
<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>09839nam a22004573i 4500</leader><controlfield tag="001">5006523277</controlfield><controlfield tag="003">MiAaPQ</controlfield><controlfield tag="005">20240229073839.0</controlfield><controlfield tag="006">m o d | </controlfield><controlfield tag="007">cr cnu||||||||</controlfield><controlfield tag="008">240229s2021 xx o ||||0 eng d</controlfield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9783030715007</subfield><subfield code="q">(electronic bk.)</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="z">9783030714994</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(MiAaPQ)5006523277</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(Au-PeEL)EBL6523277</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1244545481</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">MiAaPQ</subfield><subfield code="b">eng</subfield><subfield code="e">rda</subfield><subfield code="e">pn</subfield><subfield code="c">MiAaPQ</subfield><subfield code="d">MiAaPQ</subfield></datafield><datafield tag="050" ind1=" " ind2="4"><subfield code="a">QA76.758</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Guerra, Esther.</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Fundamental Approaches to Software Engineering :</subfield><subfield code="b">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.</subfield></datafield><datafield tag="250" ind1=" " ind2=" "><subfield code="a">1st ed.</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cham :</subfield><subfield code="b">Springer International Publishing AG,</subfield><subfield code="c">2021.</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">©2021.</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">1 online resource (383 pages)</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">computer</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">online resource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Lecture Notes in Computer Science Series ;</subfield><subfield code="v">v.12649</subfield></datafield><datafield tag="505" ind1="0" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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 &amp -- 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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="505" ind1="8" ind2=" "><subfield code="a">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.</subfield></datafield><datafield tag="588" ind1=" " ind2=" "><subfield code="a">Description based on publisher supplied metadata and other sources.</subfield></datafield><datafield tag="590" ind1=" " ind2=" "><subfield code="a">Electronic reproduction. Ann Arbor, Michigan : ProQuest Ebook Central, 2024. Available via World Wide Web. Access may be limited to ProQuest Ebook Central affiliated libraries. </subfield></datafield><datafield tag="655" ind1=" " ind2="4"><subfield code="a">Electronic books.</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Stoelinga, Mariëlle.</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Print version:</subfield><subfield code="a">Guerra, Esther</subfield><subfield code="t">Fundamental Approaches to Software Engineering</subfield><subfield code="d">Cham : Springer International Publishing AG,c2021</subfield><subfield code="z">9783030714994</subfield></datafield><datafield tag="797" ind1="2" ind2=" "><subfield code="a">ProQuest (Firm)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Lecture Notes in Computer Science Series</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ebookcentral.proquest.com/lib/oeawat/detail.action?docID=6523277</subfield><subfield code="z">Click to View</subfield></datafield></record></collection> |