%0 Journal Article
%T 基于指针数组的Gr?bner基方法的优化<br>Optimization of Gr?bner Basis Method Based on Pointer Array
%A 齐爽
%A 冯天烁
%A 史美琦
%A 江建国
%J Computer Science and Application
%P 1485-1491
%@ 2161-881X
%D 2023
%I Hans Publishing
%R 10.12677/CSA.2023.137147
%X <span style=\"font-size:14px;\">门级整数乘法器电路的验证是形式化验证领域内的一个难题，目前最有效的方法是Gr？bner基方法。在基于此方法的验证过程中，多项式的表示对内存的使用情况有很大的影响。在验证工具Teluma中，多项式表示为单项式的链表。由于链表结点需要同时存储数据元素本身的信息和一个指示其直接后继的信息，这会占用较大的内存空间。针对这一问题，本文对多项式的数据结构进行了优化，采用了动态数组存储单项式，指针数组表示多项式的方法。实验结果表明，该优化方法减少了验证过程中内存的使用。</span><br />
<span style=\"font-size:14px;\">The verification of gate-level integer multiplier circuit is a difficult problem in the field of formal verification, and the most effective method is Gr？bner basis method. In the verification process based on this method, the representation of the polynomial has a great influence on the amount of memory used. In the verification tool Teluma, polynomials are represented as linked list of mono-mials. Because linked list nodes need to store both information about the data element itself and a message indicating its immediate successor, this takes up a large amount of memory space. To solve this problem, this paper optimizes the data structure of polynomials. Dynamic array is used to store monomials and pointer array is to represent polynomials. The experimental results show that the optimization method can reduce memory usage in the verification process.</span>
%K 形式化验证，乘法器，对偶变量，Gr?bner基，指针数组<br>Formal Verification
%K Multiplier
%K Dual Variable
%K Gr?bner Basis
%K Pointer Array
%U http://www.hanspub.org/journal/PaperInformation.aspx?PaperID=69637