Kill All Mutants! (Intro to Mutation Testing)
summary
Mutation testing mutates AST nodes (operator swaps, argument flips, replacing a body with a constant, removing loop control) and runs the test suite to see which mutants are killed and which survive. It reveals weak tests and redundant code, costs lots of CPU, and often needs incremental mode or file-level filtering to be practical. Common tooling exists for many languages, CI gates can block PRs with new surviving mutants, and extreme mutation (emptying functions) finds gross redundancy.
AI-written summary · about
chapters (9)
- 0:00Introduction to mutation testing
- 1:12How mutation testing works
- 10:06Technical details of mutation
- 13:38Simple mutation testing example
- 19:20Complex mutation testing example
- 24:00History and background of mutation testing
- 25:25Integrating mutation testing in workflow
- 26:49Pros and cons summary
- 27:54Q&A session
related talks
29mKill All Mutants! (Intro to Mutation Testing)
01h 06mKill All Mutants! (Intro to Mutation Testing)
47mKill All Mutants! (Intro to Mutation Testing)
21mKill All Mutants! (Intro to Mutation Testing)
52mKill All Mutants! (Intro to Mutation Testing)
50mKill All Mutants! Intro to Mutation Testing
22mKill All Mutants! (Introduction to Mutation Testing)
30mKill All Mutants! (Intro to Mutation Testing)