I am trying to generate all possible Associative Fault Mutants for a predicate.
For example: A predicate p= (a*b)*(c*d)
where * represents a logical operator viz., || or &&.
The possible mutants are
m1= a*(b*c)*d
m2= ((a*b)*c)d
m3= a*(b*(c*d))
and so on...
But, when the conditions contains 'Not' operator then what will the possible mutants?
for this predicate p= !(!(!a*b)*c)d, how to generate the possible associative fault mutants?
Any lead will be very helpful.
With De Morgan's rule you can transform expressions so that the negation stands only in front of single variables. Variables with or without a prepending negation operator are called literals. A typical method where such is needed is conjunctive or disjunctive normal form, e.g. used in theorem proving by resolution.
Are you doing some kind of typographical error correction?
Regards,
Joachim
Joachim Pimiskern,
Thanks a lot for your reply.
Actually, I don't want to use the De Morgan's rule because it will completely change the structure of that predicate.
Also, I wanted to create primary mutant where only one change present.
Can you please help me figure out the solution with these constraints.
Regards,
Arpita
!(...) could be defined a border across which one cannot permutate. E.g. * !() could permit all variants of and all variants of , but no recombinations of parts of alpha with parts of beta..
Regards,
Joachim
- Badges
- Science topic
- Similar topics
- Human-Computer Interaction
- Collaboration