An assertion graph based abstraction algorithm in GSTE and Its application

Generalized Symbolic Trajectory Evaluation (GSTE) is an alternative model checking technique based on particular automata to specify the properties. Despite the success of GSTE, its state explosion remains a major hurdle when applying it to large industrial designs. This paper presents two efficient theoretical underpinning abstraction algorithms based on assertion graph to combat the state explosion problem. We implement these two algorithms as a prototype system for discrete models. Experimental results show that the prototype system is 10× faster than the former without abstraction.