Design and analysis of different alternating variable searches for search-based software testing

DOI10.1016/j.tcs.2014.12.009zbMath1330.68048OpenAlexW2088241124MaRDI QIDQ888422

Dirk Sudholt, Joseph Kempka, Phil McMinn

Publication date: 30 October 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2014.12.009

zbMATH Keywords

local searchruntime analysistest data generationsearch-based software engineering

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Uses Software

• IGUANA

Cites Work

• Unnamed Item
• Unnamed Item
• Crossover can be constructive when computing unique input-output sequences
• Bioinspired computation in combinatorial optimization. Algorithms and their computational complexity
• Analyzing evolutionary algorithms. The computer science perspective.
• Precision, local search and unimodal functions
• Runtime analysis of the \((1+1)\) EA on computing unique input output sequences
• Fibonaccian searching
• Introduction to Software Testing
• Tight Bounds for Blind Search on the Integers and the Reals
• Sequential Minimax Search for a Maximum
• Numerical Methods of Statistics