论文信息 - FRI: Failure-Resistant Induction in RRL

FRI: Failure-Resistant Induction in RRL

We have described briefly a proof manager called FRI, which supports the cover set induction method of RRL. We believe that FRI makes the cover set method more powerful and applicable to a wider class of equational theories for automating inductive proofs. Without FRI, we could not obtain a proof of the Chinese Remainder theorem [9].

Hantao Zhang | Xin Hua

[1] David R. Musser,et al. The AFFIRM Theorem Prover: Proof Forests and Management of Large Proofs , 1980, CADE.

[2] Hantao Zhang,et al. Axiomatic semantics of a hardware specification language , 1992, [1992] Proceedings of the Second Great Lakes Symposium on VLSI.

[3] D. Kapur,et al. Reduction, superposition and induction: automated reasoning in an equational logic , 1988 .

[4] Deepak Kapur,et al. A Mechanizable Induction Principle for Equational Specifications , 1988, CADE.

[5] Matt Kaufmann. An Interactive Enhancement to the Boyer-Moore Theorem Prover , 1988, CADE.

[6] Robert S. Boyer,et al. Computational Logic , 1990, ESPRIT Basic Research Series.