点击次数：

发布时间：2019-03-11

论文类型：会议论文

发表时间：2011-12-01

收录刊物：Scopus、EI

卷号：136 LNEE

页面范围：377-384

摘要：In this paper, we presents a novel method towards PSL assertion checking by using computer algebra system to perform symbolic simulation over synchronous circuit model. The method we studied is based on Groebner bases and can deal with a constrained subset of PSL Boolean layer. We provide an algorithm framework based on constructing data-flow model and calculating the zero set relationship of their polynomials. This paper shows that computer algebra can provide canonical symbolic representations for assertions as well as circuit system models. The approach to symbolic simulation will be a useful supplement to the existent verification methods based on simulation. ? 2012 Springer-Verlag.