A computational logic handbook
A computational logic handbook
A comparison of automatic versus manual parallelization of the Boyer-Moore theorem prover
Selected papers of the second workshop on Languages and compilers for parallel computing
Proceedings of the US/Japan workshop on Parallel Lisp on Parallel Lisp: languages and systems
Automated theorem proving in software engineering
Automated theorem proving in software engineering
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
ACL2 Theorems About Commercial Microprocessors
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Parallel Programmming in Maude
Research Directions in High-Level Parallel Programming Languages
Exploiting Parallelism in Interactive Theorem Provers
Proceedings of the 11th International Conference on Theorem Proving in Higher Order Logics
PARTHEO: A High-Performance Parallel Theorem Prover
Proceedings of the 10th International Conference on Automated Deduction
PVS: A Prototype Verification System
CADE-11 Proceedings of the 11th International Conference on Automated Deduction: Automated Deduction
Distributed Theorem Proving by Peers
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
SiCoTHEO: Simple Competitive Parallel Theorem Provers
CADE-13 Proceedings of the 13th International Conference on Automated Deduction: Automated Deduction
Implementation of multilisp: Lisp on a multiprocessor
LFP '84 Proceedings of the 1984 ACM Symposium on LISP and functional programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Efficient parallel programming in Poly/ML and Isabelle/ML
Proceedings of the 5th ACM SIGPLAN workshop on Declarative aspects of multicore programming
| Hi-index | 0.00 |
In order to take best advantage of modern multi-core systems, interactive theorem provers need to parallelize execution effectively. We describe our modification to a particular theorem prover, ACL2, to use parallel execution automatically in its proof process. Since the ACL2 prover is written primarily in the ACL2 programming language, our approach to parallelization takes advantage of ACL2 language primitives for parallel execution. We demonstrate that the resulting system often provides earlier useful feedback from failed proofs and significant reduction of execution time for successful proofs. Thus, our system not only incorporates parallelism into its proof process, but it also provides a platform for writing and verifying parallel programs written in the ACL2 programming language.