Kill All Mutants! Intro to Mutation Testing
summary
Explains mutation testing as creating many single small code changes (mutants) and running the covering tests to see which surviving mutants fool the suite, with concrete examples: a power function where swapped operands and arithmetic mutants survive until targeted inputs are added, and a send_message loop mutant revealing untested large-chunk behavior. Notes CPU cost with a worked estimate (~1,000 mutants per function → ~100× test runs → ~17 minutes from a 10s suite), lists language tools including roodle test.
AI-written summary · about
chapters (13)
- 0:00Start
- 3:30Mutation Testing
- 5:14Drawbacks
- 11:10What Exactly Does Mutation Testing Do and How
- 15:31Abstract Syntax Tree
- 21:32Examples
- 33:28Occasionally Asked Questions
- 34:35Why Is It so Cpu Intensive
- 36:02Trimming Down the Mutant Horde
- 36:48Competent Programmer Hypothesis
- 37:06The Competent Programmer Hypothesis
- 37:57Practical Considerations
- 44:54Roodle Test
related talks
52mKill All Mutants! (Intro to Mutation Testing)
01h 06mKill All Mutants! (Intro to Mutation Testing)
39mKill All Mutants! (Intro to Mutation Testing)
47mKill All Mutants! (Intro to Mutation Testing)
22mKill All Mutants! (Introduction to Mutation Testing)
30mKill All Mutants! (Intro to Mutation Testing)
21mKill All Mutants! (Intro to Mutation Testing)
29mKill All Mutants! (Intro to Mutation Testing)
