一致性验证的结构化激励生成算法

为解决Cache一致性验证中传统随机激励方法的冗余覆盖及覆盖死角等问题，提出了一种高层次结构化激励生成算法和相应的高层次功能覆盖率模型.首先根据实际多核应用场景将冲突访存操作分类成基本同步和复杂同步，并进一步抽象成有向二分图模型，由此提出一种通用的层次化输入空间等价类划分算法和对应的高层次HSPC（Host Slave Pair Coverage）功能覆盖率模型，最后基于树的搜索提出了结构化激励生成算法.上述方案成功应用于IME-Diamond SoC的Cache一致性的功能验证中，实际结果表明，相比传统基于代码的覆盖率，高层次HSPC功能覆盖率模型的揭示功能Bug能力更强，而且相对于传统的随机生成，结构化的激励能够将覆盖率收敛所需的激励数减少96.3%.

Structural Stimuli Generation Algorithm for Cache Coherence Verification

In order to deal with the problems of redundant and failed coverage in the traditional random stimuli for cache coherence verification, a high level structural stimuli generation algorithm and the corresponding functional coverage model were presented. Firstly, conflict memory accesses were categorized into basic/complex synchronizations, and thus abstracted into general bipartite graph model. Consequently, a general layered equivalence partition algorithm of ISS and the corresponding high level HSPC (Host Slave Pair Coverage) functional coverage model were proposed. Finally, two structural stimuli generation algorithms based on the search of ISS tree were presented. Experiments were performed in the functional verification of the cache system of IME-Diamond SoC, and the result indicates the HSPC coverage model can help uncover functional bugs more easily when compared with code coverage, and structural stimuli generation can reduce 96.3% stimuli for coverage convergence when compared with random stimuli generation.