Search-Based Software Engineering

CHF 78.35
Auf Lager
SKU
GTQ892AOCR4
Stock 1 Verfügbar
Geliefert zwischen Mo., 02.03.2026 und Di., 03.03.2026

Details

This book constitutes the refereed proceedings of the 10th International Symposium on Search-Based Software Engineering, SSBSE 2018, held in Montpellier, France, in September 2018.

The 12 full papers and 7 short papers presented together with 3 keynotes, 2 tutorials, and 1 anniversary paper were carefully reviewed and selected from 21 submissions. SSBSE welcomes not only applications from throughout the software engineering lifecycle but also a broad range of search methods ranging from exact Operational Research techniques to nature-inspired algorithms and simulated annealing.

Chapter "Deploying Search Based Software Engineering with Sapienz at Facebook" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.



Klappentext
Chapter "Deploying Search Based Software Engineering with Sapienz at Facebook" is available open access under a Creative Commons Attribution 4.0 International License via link.springer.com.

Inhalt
Deploying Search Based Software Engineering with Sapienz at Facebook.- Evolving Living Technologies Insights from the EvoEvo Project.- Ultra-Large Repair Search Space with Automatically Mined Templates: The Cardumen Mode of Astor.- How Can Metaheuristics Help Software Engineers?.- A Tutorial on Using and Extending the EvoSuite Search-Based Test Generator.- A Preliminary Systematic Mapping Study of Human Competitiveness of SBSE.- Search-Based Stress Testing the Elastic Resource Provisioning for Cloud-Based Applications.- Injecting Social Diversity in Multi-Objective Genetic Programming: The Case of Model Well-formedness Rule Learning.- Automated Optimization of Weighted Non-Functional Objectives in Self-Adaptive Systems.- Comparison of Search-Based Algorithms for Stress-Testing Integrated Circuits.- Damage Reduction Via White-box Failure Shaping.- Automated Co-Evolution of Metamodels and Transformation Rules: A Search-Based Approach.- Learning Without Peeking: Secure Multi-Party Computation Genetic Programming.- Towards Minimizing the Impact of Changes Using Search-Based Approach.- Exploring Evolutionary Search Strategies to Improve Applications' Energy Efficiency.- Optimization Experiments in the Continuous Space The Limited Growth Optimistic Optimization Algorithm.- Incremental Control Dependency Frontier Exploration for Many-Criteria Test Case Generation.- Single-objective Versus Multi-Objectivized Optimization for Evolutionary Crash Reproduction.- A New Approach for Search Space Reduction and Seeding by Analysis of the Clauses.- Learning Fault Localization for Both Humans and Machines Using Multi-Objective GP.- Mapping Class Dependencies for Fun and Profit.- Evolving Better Software Parameters.- On the Placebo Effect in Interactive SBSE: A Preliminary Study.- EvoIsolator: Evolving Program Slices for Hardware Isolation Based Security.- Detecting Real Faults in the Gson Library Through Search-Based Unit Test Generation.<p

Weitere Informationen

  • Allgemeine Informationen
    • GTIN 09783319992402
    • Editor Phil McMinn, Thelma Elita Colanzi
    • Sprache Englisch
    • Auflage 1st edition 2018
    • Größe H235mm x B155mm x T23mm
    • Jahr 2018
    • EAN 9783319992402
    • Format Kartonierter Einband
    • ISBN 3319992406
    • Veröffentlichung 22.08.2018
    • Titel Search-Based Software Engineering
    • Untertitel 10th International Symposium, SSBSE 2018, Montpellier, France, September 8-9, 2018, Proceedings
    • Gewicht 622g
    • Herausgeber Springer International Publishing
    • Anzahl Seiten 412
    • Lesemotiv Verstehen
    • Genre Informatik

Bewertungen

Schreiben Sie eine Bewertung
Nur registrierte Benutzer können Bewertungen schreiben. Bitte loggen Sie sich ein oder erstellen Sie ein Konto.
Made with ♥ in Switzerland | ©2025 Avento by Gametime AG
Gametime AG | Hohlstrasse 216 | 8004 Zürich | Schweiz | UID: CHE-112.967.470
Kundenservice: customerservice@avento.shop | Tel: +41 44 248 38 38