Skip to main content

An ACL2 Tutorial

  • Conference paper
Theorem Proving in Higher Order Logics (TPHOLs 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5170))

Included in the following conference series:

Abstract

We describe a tutorial that demonstrates the use of the ACL2 theorem prover. We have three goals: to enable a motivated reader to start on a path towards effective use of ACL2; to provide ideas for other interactive theorem prover projects; and to elicit feedback on how we might incorporate features of other proof tools into ACL2.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Boyer, R.S., Moore, J S.: Proving theorems about pure lisp functions. JACM 22(1), 129–144 (1975)

    Article  MATH  Google Scholar 

  2. Boyer, R.S., Moore, J S.: A Computational Logic. Academic Press, NY (1979)

    MATH  Google Scholar 

  3. Boyer, R.S., Moore, J S.: A Computational Logic Handbook. Academic Press, London (1997)

    MATH  Google Scholar 

  4. Boyer, R.S., Hunt Jr., W.A.: Function memoization and unique object representation for ACL2 functions. In: Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and Its Applications, pp. 81–89. ACM, New York (2006)

    Chapter  Google Scholar 

  5. Boyer, R.S., Goldschlag, D.M., Kaufmann, M., Moore, J S.: Functional instantiation in first-order logic. In: Lifschitz, V. (ed.) Artificial Intelligence and Mathematical Theory of Computation: Papers in Honor of John McCarthy, pp. 7–26. Academic Press, London (1991)

    Chapter  Google Scholar 

  6. Dillinger, P., Kaufmann, M., Manolios, P.: Hacking and extending ACL2. In: ACL2 Workshop 2007, Austin, Texas (November 2007), http://www.cs.uwyo.edu/~ruben/acl2-07/

  7. Dillinger, P., Manolios, P., Moore, J S., Vroon, D.: ACL2s: The ACL2 Sedan. Theoretical Computer Science 174(2), 3–18 (2006)

    MATH  Google Scholar 

  8. Gamboa, R., Kaufmann, M.: Non-Standard Analysis in ACL2. Journal of Automated Reasoning 27(4), 323–351 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  9. Greve, D.A., Kaufmann, M., Manolios, P., Moore, J S., Ray, S., Ruiz-Reina, J.L., Sumners, R., Vroon, D., Wilding, M.: Efficient execution in an automated reasoning environment. Journal of Functional Programming 18(1), January 3–18, 2008; Tech. Rpt. TR-06-59, Dept. of Computer Sciences, Univ. of Texas, Austin, http://www.cs.utexas.edu/ftp/pub/techreports/tr06-59.pdf

  10. Hunt Jr., W.A., Kaufmann, M., Krug, R., Moore, J S., Smith, E.: Meta reasoning in ACL2. In: Hurd, J., Melham, T. (eds.) TPHOLs 2005. LNCS, vol. 3603, pp. 163–178. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  11. Kaufmann, M.: Modular proof: The fundamental theorem of calculus. In: Kaufmann, M., Manolios, P., Moore, J S. (eds.) Computer-Aided Reasoning: ACL2 Case Studies, Boston, MA., pp. 75–92. Kluwer Academic Publishers, Dordrecht (2000)

    Chapter  Google Scholar 

  12. Kaufmann, M., Moore, J S.: A precise description of the ACL2 logic. In: Dept. of Computer Sciences, University of Texas, Austin (1997), http://www.cs.utexas.edu/users/moore/publications/km97a.ps.gz

  13. Kaufmann, M., Moore, J S.: Structured Theory Development for a Mechanized Logic. Journal of Automated Reasoning 26(2), 161–203 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  14. Kaufmann, M., Moore, J S.: The ACL2 home page. In: Dept. of Computer Sciences, University of Texas, Austin (2008), http://www.cs.utexas.edu/users/moore/acl2/

  15. Kaufmann, M., Moore, J S.: Proof Search Debugging Tools in ACL2. In: Boulton, R., Hurd, J., Slind, K. (eds.) Tools and Techniques for Verification of System Infrastructure, A Festschrift in honour of Prof. Michael J. C. Gordon FRS, Royal Society, London (March 2008), http://www.ttvsi.org/

  16. Kaufmann, M., Moore, J S.: The ACL2 User’s Manual. In: Dept. of Computer Sciences, University of Texas, Austin (2008), http://www.cs.utexas.edu/users/moore/acl2/#User’s-Manual

  17. Kaufmann, M., Moore, J S., Ray, S., Reeber, E.: Integrating external deduction tools with ACL2. In: Benzmueller, C., Fischer, B., Sutcliffe, G. (eds.) Proceedings of the 6th International Workshop on Implementation of Logics (IWIL 2006). CEUR Workshop Proceedings, vol. 212, pp. 7–26 (2006); The Journal of Applied Logic (to appear)

    Google Scholar 

  18. Manolios, P., Moore, J S.: Partial functions in ACL2. Journal of Automated Reasoning 31(2), 107–127 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  19. Rager, D.L.: Adding parallelism capabilities to ACL2. In: Proceedings of the Sixth International Workshop on the ACL2 Theorem Prover and its applications, pp. 90–94. ACM Press, New York (2006)

    Chapter  Google Scholar 

  20. Steele Jr., G.L.: Common Lisp The Language, 2nd edn. Digital Press (1990)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kaufmann, M., Moore, J.S. (2008). An ACL2 Tutorial. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2008. Lecture Notes in Computer Science, vol 5170. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-71067-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-71067-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-71065-3

  • Online ISBN: 978-3-540-71067-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics