A theorem prover for a computational logic-Reference-Cited by-同舟云学术

A theorem prover for a computational logic

Published:1990 Issue: Volume: Page:1-15
ISSN:0302-9743
Container-title:10th International Conference on Automated Deduction
language:
Short-container-title:

Author:

Boyer Robert S.,Moore J Strother

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-52885-7_75.pdf

Reference77 articles.

1. W. Bevier. A Verified Operating System Kernel. Ph.D. Th., University of Texas at Austin, 1987.

2. W. R. Bevier. "Kit and the Short Stack". Journal of Automated Reasoning 5, 4 (1989), 519–530.

3. William Bevier, Matt Kaufmann, and William Young. Translation of a Gypsy Compiler Example into the Boyer-Moore Logic. Internal Note 169, Computational Logic, Inc., January, 1990.

4. W.W. Bledsoe. "Splitting and Reduction Heuristics in Automatic Theorem Proving". Artificial Intelligence 2 (1971), 55–77.

5. W. Bledsoe, R. Boyer, and W. Henneman. "Computer Proofs of Limit Theorems". Artificial Intelligence 3 (1972), 27–60.

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Logika: The Sireum Verification Framework;Lecture Notes in Computer Science;2024

2. Some techniques for reasoning automatically on co-inductive data structures;Journal of Logic and Computation;2023-06-06

3. First-Order Automated Reasoning with Theories: When Deduction Modulo Theory Meets Practice;Journal of Automated Reasoning;2019-09-23

4. Fermat, Euler, Wilson - Three Case Studies in Number Theory;Journal of Automated Reasoning;2016-10-04

5. A Framework for the Verification of Certifying Computations;Journal of Automated Reasoning;2013-06-29