Velev SAT Benchmarks
From MaRDI portal
Cited in
(85)- \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
- DPvis
- SBSAT
- UnitWalk
- Algebraic models of correctness for abstract pipelines.
- Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors.
- SatEx
- SATLIB
- UBCSAT
- MAX-2-SAT
- Walksat
- SATO
- QingTing1
- PBS
- SAT competition
- SATIRE
- zChaff
- BG-WalkSAT
- UnitWalk: A new SAT solver that uses local search guided by unit clause elimination
- Incomplete dynamic backtracking for linear pseudo-Boolean problems
- Chaff
- BerkMin
- bv2epr
- Quaffle
- NuMDG
- A formal methods approach to predicting new features of the eukaryotic vesicle traffic system
- Jerusat
- SATORI
- SCOOT
- PiMaG
- Constrained pseudo-propositional logic
- Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions
- MUP
- AMUSE
- SATLIB Benchmark Suite
- Exploiting multivalued knowledge in variable selection heuristics for SAT solvers
- NuMDG: a new tool for multiway decision graphs construction
- Visualizing SAT instances and runs of the DPLL algorithm
- Using word-level information in formal hardware verification
- EVC
- Saucy
- Backdoors to q-Horn
- The state of SAT
- BerkMin: A fast and robust SAT-solver
- Regular-SAT: A many-valued approach to solving combinatorial problems
- SatEx: A web-based framework for SAT experimentation
- scientific article; zbMATH DE number 1670770 (Why is no real title available?)
- scientific article; zbMATH DE number 1670784 (Why is no real title available?)
- scientific article; zbMATH DE number 1701763 (Why is no real title available?)
- Synthesis of domain specific CNF encoders for bit-vector solvers
- Conflict Anticipation in the Search for Graph Automorphisms
- Backdoors to satisfaction
- Empirical study of the anatomy of modern SAT solvers
- nishe
- SAT-Based Model Checking
- DDVerify
- Efficient Information-Flow Verification Under Speculative Execution
- Shatter
- Decomposing SAT Instances with Pseudo Backbones
- Extended Resolution Proofs for Conjoining BDDs
- OSCAR
- semprop
- scientific article; zbMATH DE number 1956571 (Why is no real title available?)
- scientific article; zbMATH DE number 1798182 (Why is no real title available?)
- Application of constraints to formal verification and artificial intelligence
- scientific article; zbMATH DE number 1903346 (Why is no real title available?)
- Anatomy and empirical evaluation of modern SAT solvers
- Automatic abstraction of equations in a logic of equality
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- Improving Glucose for incremental SAT solving with assumptions: application to MUS extraction
- A quantifier-free first-order knowledge logic of authentication
- Correct Hardware Design and Verification Methods
- FourierSAT
- Theory and Applications of Satisfiability Testing
- Theory and Applications of Satisfiability Testing
- scientific article; zbMATH DE number 2243370 (Why is no real title available?)
- On Solving the Partial MAX-SAT Problem
- Extended Resolution Proofs for Symbolic SAT Solving with Quantification
- A Scalable Algorithm for Minimal Unsatisfiable Core Extraction
- Convergence testing in term-level bounded model checking
- A parallelization scheme based on work stealing for a class of SAT solvers
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005)
- Dynamic symmetry-breaking for Boolean satisfiability
This page was built for software: Velev SAT Benchmarks
