Distributing the workload in a lazy theorem-prover
From MaRDI portal
Recommendations
Cites work
- A machine program for theorem-proving
- Applying Light-Weight Theorem Proving to Debugging and Verifying Pointer Programs
- Artificial Intelligence and Symbolic Computation
- Computer Aided Verification
- Computer Aided Verification
- Computer Aided Verification
- Counterexample-guided abstraction refinement for symbolic model checking
- Efficient distributed SAT and SAT-based distributed bounded model checking
- Graph-Based Algorithms for Boolean Function Manipulation
- GridSAT: Design and implementation of a computational grid application
- scientific article; zbMATH DE number 1809862 (Why is no real title available?)
- scientific article; zbMATH DE number 2080047 (Why is no real title available?)
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic
- Simplification by Cooperating Decision Procedures
- The discrete time TOOLBUS. -- A software coordination architecture
- Theorem proving using lazy proof explication.
- Theoretical Aspects of Computing - ICTAC 2004
Cited in
(3)
This page was built for publication: Distributing the workload in a lazy theorem-prover
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2870323)