Velev SAT Benchmarks

swMATH13373MaRDI QIDQ25287FDOQ25287

Author name not available (Why is that?)

Official website: http://www.miroslav-velev.com/sat_benchmarks.html

Cited In (80)

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

This page was built for software: Velev SAT Benchmarks