作者: Xinyan Gao , Ning Zhou , Fengqi Li , Dakui Li
DOI: 10.1007/978-3-642-26001-8_49
关键词:
摘要: 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 studied is based on Groebner bases and can deal with constrained subset of Boolean layer. We provide an algorithm framework constructing data-flow model calculating the zero set relationship their polynomials. This paper shows that canonical representations for assertions as well models. approach will be useful supplement existent verification methods simulation.