没有自动定理证明器的支持，程序性质的证明全部需要程序员手工完成，工作量巨大。
Without automated theorem prover, programmers have to generate all proofs by hand, which is a huge workload.
尽管缺少自动化，高效地使用定理证明器能处理比模型检查器更大的设计并且要求更小的内存。
Although less automatic, efficient usage of a theorem prover can handle much larger designs than model checkers and requires less memory.
提出了一种为指针逻辑设计定理证明器的新技术，该项技术主要是基于变换和替代，已在APL的工具中得以实现。
This paper presents a technique for designing theorem prover which mainly based on transformation and substitution for Pointer Logic. The technique realized as a tool called APL is implemented.
一类构造性几何定理的数值并行法证明器。
A prover for parallel numerical verification of a class of constructive geometry theorems.
一类构造性几何定理的数值并行法证明器。
A prover for parallel numerical verification of a class of constructive geometry theorems.
应用推荐