A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf
.
Towards Symbolic Model-Based Mutation Testing: Combining Reachability and Refinement Checking
2012
Electronic Proceedings in Theoretical Computer Science
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
doi:10.4204/eptcs.80.7
fatcat:36yzeldqoneh3kj2sz45iae6bi