作者: Marc Boule , Zeljko Zilic
DOI: 10.1109/ASPDAC.2007.358006
关键词:
摘要: In this paper, we present a method for generating checker circuits from sequential-extended regular expressions (SEREs). Such sequences form the core of increasingly-used assertion-based verification (ABV) languages. A generator capable transforming assertions into efficient allows adoption ABV in hardware emulation. Towards that goal, introduce algorithms sequence fusion and length matching intersection, two SERE operators are not typically used over expressions. We also develop an algorithm failure detection automata, concept critical to extending ABV, as well our symbol encoding. Experiments with complex show tool outperforms best known generator.