Integrating reasoning about ordinal arithmetic into ACL2

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3312, Issue , 2004, Pages 82-97

  Manolios, Panagiotis ^a   Vroon, Daron ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED DESIGN;

CASE-STUDIES; EXTENSIBLE FRAMEWORK; GENERAL-PURPOSE PROGRAMMING LANGUAGE; INFINITE STATE SYSTEMS; THEOREM PROVING SYSTEMS;

FORMAL METHODS;

EID: 35048842232     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30494-4_7     Document Type: Article

References (22)

1. T. Arts and J. Giesl. Termination of term rewriting using dependency pairs. Theoretical Computer Science, 236:133-178, 2000.
2. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, 1998.
3. R. S. Boyer and J. S. Moore. Proving theorems about pure lisp functions. JACM, 22(1):129-144, 1975.
4. R. S. Boyer and J. S. Moore. A Computational Logic. Academic Press, New York, 1979.
5. M. A. Colón and H. B. Sipma. Synthesis of linear ranking functions. In TACAS01: Tools and Algorithms for the Construction and Analysis of Systems, volume 2031 of LNCS, pages 67-81, 2001.
6. M. A. Colón and H. B. Sipma. Practical methods for proving program termination. In International Conference on Computer Aided Verification, CAV'02, volume 2404 of LNCS, pages 442-454, 2002.
7. D. Dams, R. Gerth, and O. Grumberg. A heuristic for the automatic generation of ranking functions. In Workshop on Advanced Verification, July 2000. See URL http://www.cs.utah.edu/wave/.
8. N. Hirokawa and A. Middledorp. Automating the dependency pair method. In Automated Deduction - CADE-19, LNAI, pages 32-46. Springer-Verlag, 2003.
9. A. J. Hu and M. Y. Vardi, editors. Computer-Aided Verification - CAV '98, volume 1427 of LNCS. Springer-Verlag, 1998.
10. M. Kaufmann, P. Manolios, and J. S. Moore, editors. Computer-Aided Reasoning: ACL2 Case Studies. Kluwer Academic Publishers, June 2000.
11. M. Kaufmann, P. Manolios, and J. S. Moore. Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, July 2000.
12. M. Kaufmann and J. S. Moore. ACL2 homepage. See URL http://www.cs.utexas. edu/users/moore/acl2.
13. M. Kaufmann and J. S. Moore, editors. Fourth International Workshop on the ACL2 Theorem Prover and Its Applications (ACL2-2003), July 2003. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/.
14. C. S. Lee, N. D. Jones, and A. M. Ben-Amram. The size-change principle for program termination. ACM Symposium on Principles of Programming Languages, 28:81-92, 2001.
15. P. Manolios and D. Vroon. Algorithms for ordinal arithmetic. In F. Baader, editor, 19th International Conference on Automated Deduction - CADE-19, volume 2741 of LNAI, pages 243-257. Springer-Verlag, July/August 2003.
16. P. Manolios and D. Vroon. Ordinal arithmetic in ACL2. In Kaufmann and Moore [13]. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/.
17. F.-J. Martín-Mateos, J.-A. Alonso, M.-J. Hidalgo, and J.-L. Ruiz-Reina. A formal proof of Dickson's Lemma in ACL2. In M. Y. Vardi and A. Voronkov, editors, Logic for Programming, Artificial Intelligence and Reasoning (LPAR 2003), volume 2850 of LNCS, pages 49-58. Springer Verlag, 2003.
18. F. Morris and C. Jones. An early program proof by Alan Turing. IEEE Annals of the History of Computing, 6(2): 139-143, April-June 1984.
19. A. Podelske and A. Rybalchenko. A complete method for the synthesis of linear ranking functions. In B. Steffen and G. Levi, editors, Verification, Model Checking, and Abstract Interpretation, VMCAI 2004, volume 2937 of LNCS, pages 239-251, 2004.
20. J.-L. Ruiz-Reina, J.-A. Alonso, M.-J. Hidalgo, and F.-J. Martin. Multiset relations: A tool for proving termination. In M. Kaufmann and J. S. Moore, editors, Proceedings of the ACL2 Workshop 2000. The University of Texas at Austin, Technical Report TR-00-29, November 2000.
21. M. Sustik. Proof of Dixon's lemma using the ACL2 theorem prover via an explicit ordinal mapping. In Kaufmann and Moore [13]. See URL http://www.cs.utexas.edu/users/moore/acl2/workshop-2003/.
22. M. Wilding, D. Greve, and D. Hardin. Efficient simulation of formal processor models. Formal Methods in System Design, 18(3):233-248, May 2001.