The following pages link to MiniSat (Q13332):
Displaying 50 items.
- Efficient bounded model checking of heap-manipulating programs using tight field bounds (Q2044185) (← links)
- SAT-based explicit \(\mathsf{LTL}_f\) satisfiability checking (Q2046017) (← links)
- Certifying proofs for SAT-based model checking (Q2058379) (← links)
- SAT modulo discrete event simulation applied to railway design capacity analysis (Q2058381) (← links)
- Drawing with SAT: four methods and a tool for producing railway infrastructure schematics (Q2065524) (← links)
- Boosting isomorphic model filtering with invariants (Q2079277) (← links)
- New records of pre-image search of reduced SHA-1 using SAT solvers (Q2079908) (← links)
- A posthumous contribution by Larry Wos: excerpts from an unpublished column (Q2102925) (← links)
- Pardinus: a temporal relational model finder (Q2102939) (← links)
- Flexible proof production in an industrial-strength SMT solver (Q2104495) (← links)
- Preprocessing of propagation redundant clauses (Q2104502) (← links)
- Supercharging plant configurations using Z3 (Q2117195) (← links)
- Towards a compact SAT-based encoding of itemset mining tasks (Q2117214) (← links)
- OptiLog: a framework for SAT-based systems (Q2118280) (← links)
- Deep cooperation of CDCL and local search for SAT (Q2118286) (← links)
- Hash-based preprocessing and inprocessing techniques in SAT solvers (Q2118288) (← links)
- Efficient all-UIP learned clause minimization (Q2118297) (← links)
- Assessing progress in SAT solvers through the Lens of incremental SAT (Q2118309) (← links)
- On dedicated CDCL strategies for PB solvers (Q2118312) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- The \textsc{MergeSat} solver (Q2118329) (← links)
- XOR local search for Boolean Brent equations (Q2118332) (← links)
- Leveraging GPUs for effective clause sharing in parallel SAT solving (Q2118339) (← links)
- Certified DQBF solving by definition extraction (Q2118343) (← links)
- Logical cryptanalysis with WDSat (Q2118349) (← links)
- Advanced algorithms for abstract dialectical frameworks based on complexity analysis of subclasses and SAT solving (Q2124467) (← links)
- Satisfiability and synthesis modulo oracles (Q2152655) (← links)
- Learning a propagation complete formula (Q2170198) (← links)
- Careful synchronization of partial deterministic finite automata (Q2170286) (← links)
- Symmetry avoidance in MACE-style finite model finding (Q2180212) (← links)
- DRAT-based bit-vector proofs in CVC4 (Q2181940) (← links)
- CrystalBall: gazing in the black box of SAT solving (Q2181946) (← links)
- Meet-in-the-middle attacks and structural analysis of round-reduced PRINCE (Q2188966) (← links)
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results (Q2216123) (← links)
- Incremental column-wise verification of arithmetic circuits using computer algebra (Q2225473) (← links)
- Popularity-similarity random SAT formulas (Q2238712) (← links)
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions (Q2238714) (← links)
- Propositional proof systems based on maximum satisfiability (Q2238728) (← links)
- On the complexity of reconstructing chemical reaction networks (Q2254073) (← links)
- Improved agreeing-gluing algorithm (Q2254079) (← links)
- Polynomial time algorithm for min-ranks of graphs with simple tree structures (Q2258079) (← links)
- On the order of test goals in specification-based testing (Q2270689) (← links)
- Limitations of restricted branching in clause learning (Q2272157) (← links)
- Propagation via lazy clause generation (Q2272160) (← links)
- Design and results of the second international competition on computational models of argumentation (Q2287197) (← links)
- Clause vivification by unit propagation in CDCL SAT solvers (Q2287199) (← links)
- How we designed winning algorithms for abstract argumentation and which insight we attained (Q2289004) (← links)
- \textsc{OptiMathSAT}: a tool for optimization modulo theories (Q2303246) (← links)
- Definability for model counting (Q2303508) (← links)
- A tableaux calculus for default intuitionistic logic (Q2305412) (← links)
