Implementing a cost-aware evaluator for ACL2 expressions
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
| Hi-index | 0.00 |
AVL trees supply operations for information storage and retrieval in time proportional to the logarithm of the number of items stored and in a space increment, beyond the space needed for the information itself, that increases linearly with the number of items. The public operations of insertion, deletion, and retrieval are supported internally by rotations to maintain order and balance properties that make it possible to meet logarithmic performance requirements. This report describes an AVL implementation in ACL2. It focuses on verifying correctness issues of order, balance, and conservation of keys.