Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking

Details Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking

2012-02-28

arxiv.org/abs/1202.6123v1

EPTCS 80, 2012, pp. 88-102

Computer Science

Software Engineering

In Proceedings MBT 2012, arXiv:1202.5826

Scientific paper

10.4204/EPTCS.80.7

Model-based mutation testing uses altered test models to derive test cases that are able to reveal whether a modelled fault has been implemented. This requires conformance checking between the original and the mutated model. This paper presents an approach for symbolic conformance checking of action systems, which are well-suited to specify reactive systems. We also consider nondeterminism in our models. Hence, we do not check for equivalence, but for refinement. We encode the transition relation as well as the conformance relation as a constraint satisfaction problem and use a constraint solver in our reachability and refinement checking algorithms. Explicit conformance checking techniques often face state space explosion. First experimental evaluations show that our approach has potential to outperform explicit conformance checkers.

Affiliated with

Also associated with

No associations

Rating

Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-605557