Advertisement

Overview of a theorem-prover for a computational logic

  • Robert S. Boyer
  • J Strother Moore
Extended Abstracts Of Current Deduction Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 230)

Keywords

Decision Procedure Correctness Proof Computational Logic Automate Theorem Prove Incompleteness Theorem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    R. S. Boyer and J S. Moore. A Computational Logic. Academic Press, New York, 1979.Google Scholar
  2. [2]
    R.S. Boyer and J S. Moore. Metafunctions: Proving Them Correct and Using Them Efficiently as New Proof Procedures. In R. S. Boyer and J S. Moore (editors), The Correctness Problem in Computer Science. Academic Press, London, 1981.Google Scholar
  3. [3]
    R. S. Boyer and J S. Moore. A Verification Condition Generator for FORTRAN. In R. S. Boyer and J S. Moore (editors), The Correctness Problem in Computer Science. Academic Press, London, 1981.Google Scholar
  4. [4]
    R. S. Boyer and J S. Moore. The Mechanical Verification of a FORTRAN Square Root Program. CSL Report, SRI International, 1981.Google Scholar
  5. [5]
    R. S. Boyer and J S. Moore. MJRTY — A Fast Majority Vote Algorithm. Technical Report ICSCA-CMP-32, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.Google Scholar
  6. [6]
    R. S. Boyer and J S. Moore. Proof Checking the RSA Public Key Encryption Algorithm. American Mathematical Monthly 91(3):181–189, 1984.Google Scholar
  7. [7]
    R. S. Boyer and J S. Moore. A Mechanical Proof of the Unsolvability of the Halting Problem. JACM 31(3):441–458, 1984.CrossRefMathSciNetGoogle Scholar
  8. [8]
    R. S. Boyer and J S. Moore. Integrating Decision Procedures into Heuristic Theorem Provers: A Case Study with Linear Arithmetic. In Machine Intelligence. Oxford University Press, (to appear, 1986).Google Scholar
  9. [9]
    R. S. Boyer and J S. Moore. A Mechanical Proof of the Turing Completeness of Pure Lisp. In W.W. Bledsoe and D.W. Loveland (itors), Automated Theorem Proving: After 25 Years, pages 133–167. American Mathematical Society, Providence, R.I., 1984.Google Scholar
  10. [10]
    R. S. Boyer, M. W. Green and J S. Moore. The Use of a Formal Simulator to Verify a Simple Real Time Control Program. Technical Report ICSA-CMP-29, University of Texas at Austin, 1982.Google Scholar
  11. [11]
    Benedetto Lorenzo Di Vito. Verification of Communications Protcols and Abstract Process Models. PhD Thesis ICSCA-CMP-25, Institute for Computing Science and Computer Applications, University of Texas at Austin, 1982.Google Scholar
  12. [12]
    Huang, C.-H., and Lengauer, C. The Automated Proof of a Trace Trans formation for a Bitonic Sort. Technical Report TR-84-30, Department of Computer Sciences, The University of Texas at Austin, Oct., 1984.Google Scholar
  13. [13]
    Warren A. Hunt, Jr. FM8501: A Verified Microprocessor. Technical Report 47, University of Texas at Austin, December, 1985.Google Scholar
  14. [14]
    Lengauer, C. On the Role of Automated Theorem Proving in the Compile-Time Derivation of Concurrency. Journal of Automated Reasoning 1(1):75–101, 1985.CrossRefGoogle Scholar
  15. [15]
    Lengauer, C., and Huang, C.-H. A Mechanically Certified Theorem about Optimal Concurrency of Sorting Networks, and Its Proof. Technical Report TR-85-23, Department of Computer Sciences, The University of Texas at Austin, Oct., 1985.Google Scholar
  16. [16]
    David M. Russinoff. A Mechanical Proof of Wilson's Theorem. Masters Thesis, Department of Computer Sciences, University of Texas at Austin, 1983.Google Scholar
  17. [17]
    N. Shankar. Towards Mechanical Metamathematics. Journal of Automated Reasoning 1(1), 1985.Google Scholar
  18. [18]
    N. Shankar. A Mechanical Proof of the Church-Rosser Theorem. Technical Report ICSCA-CMP-45, Institute for Computing Science, University of Texas at Austin, 1985.Google Scholar
  19. [19]
    N. Shankar. Checking the proof of Godel's incompleteness theorem. Technical Report, Institute for Computing Science, University of Texas at Austin, 1986.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1986

Authors and Affiliations

  • Robert S. Boyer
    • 1
  • J Strother Moore
    • 1
  1. 1.Institute for Computing Science and Computer ApplicationsUniversity of Texas at AustinUSA

Personalised recommendations