Without automated theorem prover, programmers have to generate all proofs by hand, which is a huge workload.
没有自动定理证明器的支持，程序性质的证明全部需要程序员手工完成，工作量巨大。
This is an automated theorem prover for first-order and equational logic, used to support inference in language processing.
这是一个用于一阶和逻辑方程序的自动理论证明器，用于支持语言处理中的推理。
Although less automatic, efficient usage of a theorem prover can handle much larger designs than model checkers and requires less memory.
尽管缺少自动化，高效地使用定理证明器能处理比模型检查器更大的设计并且要求更小的内存。
Sometimes the abstraction itself may be so large that the theorem prover may take an inordinate amount of time and resources to complete the proof.
有时抽象本身可能是很大的工作量，以致定理证明程序可能花费过多时间和资源来完成证明。
Effective use of a theorem prover requires a solid understanding of the internal operations of the tool and a familiarity with the mathematical proof process.
高效地使用定理证明需要对工具的内部操作有坚实的理解并且熟悉数学证明过程。
Or else, the abstraction may throw away so much information that the theorem prover may yield results that are correct for the abstraction, but incorrect for the program being analysed.
要不然，抽象会丢掉那么多信息，以致于定理证明程序产生的结果对抽象而言是正确的，但是对于正在被分析的程序而言则是不正确的了。
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.
提出了一种为指针逻辑设计定理证明器的新技术，该项技术主要是基于变换和替代，已在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.
提出了一种为指针逻辑设计定理证明器的新技术，该项技术主要是基于变换和替代，已在APL的工具中得以实现。
应用推荐