Implementing a cost-aware evaluator for ACL2 expressions

Authors:
Ruben Gamboa;John Cowles
Affiliations:
University of Wyoming, Laramie, WY;University of Wyoming, Laramie, WY
Venue:
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
Year:
2006

Citing 7
Cited 1

The addition of bounded quantification and partial functions to a computational logic and its theorem prover

Journal of Automated Reasoning
A computational logic handbook

A computational logic handbook
Introduction to algorithms

Introduction to algorithms
Purely functional data structures

Purely functional data structures
An exercise in graph theory

Computer-Aided reasoning
Nonconstructive Computational Mathematics

Journal of Automated Reasoning
Structured Theory Development for a Mechanized Logic

Journal of Automated Reasoning

ACL2-certified AVL trees

Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of ACL2's most interesting features is that it is executable, so users can run the programs that they verify, and debug them during verification. In fact, the ACL2 implementors have gone well out of their way to make sure ACL2 programs can be executed efficiently. Nevertheless, ACL2 does not provide a framework for reasoning about the cost of function invocations. This paper describes how such a framework can be added to ACL2, by using ACL2 macros and supporting code to access the prover state. The approach is illustrated with a cost analysis of red-black tree operations.