From 05eeb077598a5a3be1a78270837a38f9687fc501 Mon Sep 17 00:00:00 2001 From: Stanislav Pankevich Date: Mon, 4 Jan 2021 21:07:20 +0100 Subject: [PATCH] docs: How Mull works: fix sentence --- docs/HowMullWorks.rst | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) diff --git a/docs/HowMullWorks.rst b/docs/HowMullWorks.rst index 2ab23775d..193bbe568 100644 --- a/docs/HowMullWorks.rst +++ b/docs/HowMullWorks.rst @@ -18,11 +18,11 @@ Mull is based on LLVM and uses its API extensively. The main APIs used are: Mull finds and creates mutations of a program in memory, on the level of LLVM bitcode. -All mutations are injected into the original program code and each injected gets -mutation hidden under a conditional flag that enables that specific mutation. -The resulting program is compiled into a single binary which is run multiple -times, one run per mutation. With each run, a condition for a corresponding -mutation is activated to check how the injection of that particular mutation +All mutations are injected into original program's code. Each injected mutation +is hidden under a conditional flag that enables that specific mutation. The +resulting program is compiled into a single binary which is run multiple times, +one run per mutation. With each run, Mull activates a condition for a +corresponding mutation to check how the injection of that particular mutation affects the execution of a test suite. Mull runs the tested program and its mutated versions in child subprocesses so