Performance and evaluation of LISP systems
Performance and evaluation of LISP systems
Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The Boyer Benchmark at warp speed
ACM SIGPLAN Lisp Pointers
ACM SIGPLAN Lisp Pointers
On programming of arithmetic operations
Communications of the ACM
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
A compressed format for collections of phylogenetic trees and improved consensus performance
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
ACL2 '06 Proceedings of the sixth international workshop on the ACL2 theorem prover and its applications
TPHOLs '08 Proceedings of the 21st International Conference on Theorem Proving in Higher Order Logics
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
Abbreviated output for input in ACL2: an implementation case study
Proceedings of the Eighth International Workshop on the ACL2 Theorem Prover and its Applications
A verified runtime for a verified theorem prover
ITP'11 Proceedings of the Second international conference on Interactive theorem proving
A mechanically verified AIG-to-BDD conversion algorithm
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
| Hi-index | 0.00 |
We have developed an extension of ACL2 that includes the implementation of hash-based association lists and function memoization; this makes some algorithms execute more quickly. This extension, enabled partially by the implementation of Hash-CONS, represents ACL2 data objects in a canonical way, thus the comparison of any two such objects can be determined without the cost of descending through their CONS structures. A restricted set of ACL2 user-defined functions may be memoized; the underlying implementation may conditionally retain the values of such function calls so that if a repeated function application is requested, a previously computed value may instead be returned. We have defined a fast association list access and update functions using hash tables. We provide a file reader that identifies and eliminates duplicate representations of repeated objects, and a file printer that produces output with no duplicate subexpressions.