作者: P. Ammann , P.E. Black
关键词:
摘要: A recent method combines model checkers with specification-based mutation analysis to generate test cases from formal software specifications. However high-level specifications usually must be reduced make a checker feasible. We propose new reduction, parts of which can applied mechanically, soundly reduce some large, even infinite, state machines manageable pieces. Our work differs other in that we use the reduction for generating sets, as opposed typical goal analyzing properties. Consequently, have different criteria, and prove soundness rule. Informally rule is counterexamples are original specification. The changes machine temporal logic constraints checking specification avoid unsound cases. Java virtual stack an example generation.