Certified SAT solving with GPU accelerated inprocessing
From MaRDI portal
Publication:6564174
DOI10.1007/S10703-023-00432-ZMaRDI QIDQ6564174
Armin Biere, Anton Wijs, Muhammad Osama
Publication date: 28 June 2024
Published in: Formal Methods in System Design (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Simulating circuit-level simplifications on CNF
- Complexity of fixed-size bit-vector logics
- An efficient SMT solver for string constraints
- SAT solver management strategies in IC3: an experimental approach
- raSAT: an SMT solver for polynomial constraints
- On a generalization of extended resolution
- Leveraging GPUs for effective clause sharing in parallel SAT solving
- Automatic verification of concurrent stochastic systems
- CrystalBall: gazing in the black box of SAT solving
- Reducing higher-order theorem proving to a sequence of SAT problems
- Algorithms for computing minimal unsatisfiable subsets of constraints
- Inprocessing Rules
- SAT-Based Model Checking without Unrolling
- DRAT-trim: Efficient Checking and Trimming Using Expressive Clausal Proofs
- GRASP: a search algorithm for propositional satisfiability
- Verifying Refutations with Extended Resolution
- Clause Elimination Procedures for CNF Formulas
- Theory and Applications of Satisfiability Testing
- A machine program for theorem-proving
- Theory and Applications of Satisfiability Testing
- Bounded model checking using satisfiability solving
This page was built for publication: Certified SAT solving with GPU accelerated inprocessing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6564174)
