Write a Blog >>
Fri 13 Nov 2020 08:09 - 08:10 at Virtual room 1 - Testing 3

Higher-order mutation has the potential for improving major drawbacks of
traditional first-order mutation, such as by simulating more realistic faults
or improving test-optimization techniques. Despite interest in studying
promising higher-order mutants, such mutants are difficult to find due to the
exponential search space of mutation combinations. State-of-the-art
approaches rely on genetic search, which is often incomplete and expensive
due to its stochastic nature. First, we propose a novel way of finding a
complete set of higher-order mutants by using variational execution, a
technique that can, in many cases, explore large search spaces completely and
often efficiently. Second, we use the identified complete set of higher-order
mutants to study their characteristics. Finally, we use the identified
characteristics to design and evaluate a new search strategy, independent of
variational execution, that is highly effective at finding higher-order
mutants even in large codebases.

Fri 13 Nov
Times are displayed in time zone: (UTC) Coordinated Universal Time change

08:00 - 08:02
Talk
Baital: An Adaptive Weighted Sampling Approach for Improved t-wise Coverage
Research Papers
Eduard BaranovUniversité Catholique de Louvain, Belgium, Axel LegayUniversité Catholique de Louvain, Belgium, Kuldeep S. MeelNational University of Singapore, Singapore
DOI
08:03 - 08:04
Research paper
Cost Measures Matter for Mutation Testing Study Validity
Research Papers
Giovani GuizzoUniversity College London, UK, Federica SarroUniversity College London, UK, Mark HarmanUniversity College London, UK
DOI Pre-print
08:05 - 08:06
Talk
Developing and Evaluating Objective Termination Criteria for Random Testing
Journal First
Porfirio TramontanaDepartment of Electrical Engineering and Information Technologies, University of Naples Federico II, Italy, Domenico AmalfitanoUniversity of Naples Federico II, Nicola AmatucciDepartment of Civil, Architectural and Environmental Engineering, University of Naples Federico II, Italy, Atif MemonApple Inc., Anna Rita FasolinoFederico II University of Naples
08:07 - 08:08
Talk
Efficient Binary-Level Coverage Analysis
Research Papers
M. Ammar Ben KhadraTU Kaiserslautern, Germany, Dominik StoffelTU Kaiserslautern, Germany, Wolfgang KunzTU Kaiserslautern, Germany
DOI Pre-print Media Attached
08:09 - 08:10
Talk
Efficiently Finding Higher-Order Mutants
Research Papers
Chu-Pan WongCarnegie Mellon University, USA, Jens MeinickeCarnegie Mellon University, USA, Leo ChenCarnegie Mellon University, USA, João P. DinizFederal University of Minas Gerais, Brazil, Christian KästnerCarnegie Mellon University, USA, Eduardo FigueiredoFederal University of Minas Gerais, Brazil
DOI
08:11 - 08:12
Talk
Selecting Fault Revealing Mutants
Journal First
Thierry Titcheu ChekamUniversity of Luxembourg (SnT), Mike PapadakisUniversity of Luxembourg, Luxembourg, Tegawendé F. BissyandéUniversity of Luxembourg, Luxembourg, Yves Le TraonUniversity of Luxembourg, Luxembourg, Koushik SenUniversity of California at Berkeley
08:13 - 08:30
Talk
Conversations on Testing 3
Paper Presentations
Chu-Pan WongCarnegie Mellon University, USA, Eduard BaranovUniversité Catholique de Louvain, Belgium, Giovani GuizzoUniversity College London, UK, M. Ammar Ben KhadraTU Kaiserslautern, Germany, Porfirio TramontanaDepartment of Electrical Engineering and Information Technologies, University of Naples Federico II, Italy, Thierry Titcheu ChekamUniversity of Luxembourg (SnT), M: Marcel BöhmeMonash University, Australia