Symbolic Model Checking
A halting algorithm to determine the existence of decoder
Proceedings of the 2010 Conference on Formal Methods in Computer-Aided Design
| Hi-index | 0.00 |
Counterexample minimization tries to remove irrelevant variables from counterexamples, such that they are easier to be understood. For the first time, we proposes a novel approach to minimize loop-like and path-like counterexamples of ACTL properties. For a counterexample s0... sk, our algorithm tries to extract a succinct cube sequence c0... ck, such that paths run through c0... ck are all valid counterexamples. Experimental result shows that our algorithm can significantly minimize ACTL counterexamples.