Skip to main content
SpringerLink
Log in
Book cover

International Conference on Formal Methods in Computer-Aided Design

FMCAD 2004: Formal Methods in Computer-Aided Design pp 82–97Cite as

Integrating Reasoning About Ordinal Arithmetic into ACL2

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3312))

Abstract

Termination poses one of the main challenges for mechanically verifying infinite state systems. In this paper, we develop a powerful and extensible framework based on the ordinals for reasoning about termination in a general purpose programming language. We have incorporated our work into the ACL2 theorem proving system, thereby greatly extending its ability to automatically reason about termination. The resulting technology has been adopted into the newly released ACL2 version 2.8. We discuss the creation of this technology and present two case studies illustrating its effectiveness.

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

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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science 236, 133–178 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  4. Boyer, R.S., Moore, J.S.: A Computational Logic. Academic Press, New York (1979)

    MATH  Google Scholar 

  5. Colón, M.A., Sipma, H.B.: Synthesis of linear ranking functions. In: Margaria, T., Yi, W. (eds.) TACAS 2001. LNCS, vol. 2031, pp. 67–81. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  6. Colón, M.A., Sipma, H.B.: Practical methods for proving program termination. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol. 2404, pp. 442–454. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  7. Dams, D., Gerth, R., Grumberg, O.: A heuristic for the automatic generation of ranking functions. In: Workshop on Advanced Verification (July 2000), See http://www.cs.utah.edu/wave/

  8. Hirokawa, N., Middledorp, A.: Automating the dependency pair method. In: Automated Deduction – CADE-19. LNCS (LNAI), pp. 32–46. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  9. Hu, A.J., Vardi, M.Y. (eds.): Computer-Aided Verification – CAV 1998. LNCS, vol. 1427. Springer, Heidelberg (1998)

    Google Scholar 

  10. Kaufmann, M., Manolios, P., Moore, J.S. (eds.): Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  11. Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)

    Google Scholar 

  12. Kaufmann, M., Moore, J.S.: ACL2 homepage. See, http://www.cs.utexas.edu/users/moore/acl2

  13. Kaufmann, M., Moore, J.S. (eds.): Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003) (July 2003), See http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/

  14. Lee, C.S., Jones, N.D., Ben-Amram, A.M.: The size-change principle for program termination. ACM Symposium on Principles of Programming Languages 28, 81–92 (2001)

    Google Scholar 

  15. Manolios, P., Vroon, D.: Algorithms for ordinal arithmetic. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol. 2741, pp. 243–257. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  16. Manolios, P., Vroon, D.: Ordinal arithmetic in ACL2. In: Kaufmann and Moore [13], See http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/

  17. Martín-Mateos, F.-J., Alonso, J.-A., Hidalgo, M.-J., Ruiz-Reina, J.-L.: A formal proof of Dickson’s Lemma in ACL2. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS, vol. 2850, pp. 49–58. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  18. Morris, F., Jones, C.: An early program proof by Alan Turing. IEEE Annals of the History of Computing 6(2), 139–143 (1984)

    Article  MATH  MathSciNet  Google Scholar 

  19. Podelske, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: Steffen, B., Levi, G. (eds.) VMCAI 2004. LNCS, vol. 2937, pp. 239–251. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  20. Ruiz-Reina, J.-L., Alonso, J.-A., Hidalgo, M.-J., Martin, F.-J.: Multiset relations: A tool for proving termination. In: Kaufmann, M., Moore, J.S. (eds.) Proceedings of the ACL2 Workshop 2000. The University of Texas at Austin, Technical Report TR-00-29 (November 2000)

    Google Scholar 

  21. Sustik, M.: Proof of Dixon’s lemma using the ACL2 theorem prover via an explicit ordinal mapping. In: Kaufmann and Moore [13], See http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/

  22. Wilding, M., Greve, D., Hardin, D.: Efficient simulation of formal processor models. Formal Methods in System Design 18(3), 233–248 (2001)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Georgia Institute of Technology, College of Computing, 801 Atlantic Drive, Atlanta, Georgia, 30332, USA

    Panagiotis Manolios & Daron Vroon

Authors
  1. Panagiotis Manolios
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Daron Vroon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Science Department, University of British Columbia,  

    Alan J. Hu

  2. IBM Austin Research Laboratory, 11400 Burnet Rd, MS 904-6H004, TX 78758-3493, Austin, USA

    Andrew K. Martin

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Manolios, P., Vroon, D. (2004). Integrating Reasoning About Ordinal Arithmetic into ACL2. In: Hu, A.J., Martin, A.K. (eds) Formal Methods in Computer-Aided Design. FMCAD 2004. Lecture Notes in Computer Science, vol 3312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30494-4_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30494-4_7

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23738-9

  • Online ISBN: 978-3-540-30494-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation