Formal Proof of Sematic- Preserving for Mutation Operators
Formal Proof of Sematic- Preserving for Mutation Operators
Embedded Files
We provide a detailed explanation below on how the functional consistency of the four basic mutation operators is maintained, i.e., how they do not alter the original program's behavior. The other three new operators are combinations based on these foundational operators.
1. Proposition Statement
1. Proposition Statement
2. Definition of Four Operations
2. Definition of Four Operations
3. Proof of Add Node
3. Proof of Add Node
Figure 1: the Relationship of Add Node Operation in the Source-Code and FCG Level.
4. Proof of Add Edge
4. Proof of Add Edge
Figure 2: the Relationship of Add Edge Operation in the Source-Code and FCG Level.
5. Proof of Rewire
5. Proof of Rewire
Figure 3: the Relationship of Rewire Operation in the Source-Code and FCG Level.
6. Proof of Remove Node
6. Proof of Remove Node
Figure 4: the Relationship of Remove Node Operation in the Source-Code and FCG Level.
Page updated
Google Sites
Report abuse