Performance of a SystemVerilog Sudoku Solver with VCS
PaperFirst seen 7/14/2026
Last seen 7/14/2026
Evidence 10 chunks
NEIGHBORHOOD
No graph connections found for this entity yet. It may appear in future ingestion runs.
explore full graph →RELATIONSHIPS
24 connectionsThe paper compares OOP and FLAT constraint composition approaches.
The paper discusses CNF as the formula structure used by the constraint solver.
The paper mentions Latin square as the mathematical model underlying Sudoku.
The paper discusses parasitic literals as a side effect of the implication operator in constraints.
The paper discusses the implication operator and its effect on parasitic literals in constraints.
The paper investigates whether using if-else instead of implication improves solver efficiency.
The paper investigates whether using constants instead of variables in constraints improves solver efficiency.
The paper evaluates the VCS constraint solver's performance on Sudoku puzzles.
The paper evaluates MathSAT5 as a public domain SAT solver and compares it against VCS.
The paper evaluates Yices as a public domain SAT solver and compares it against VCS.
The paper evaluates Z3 as a public domain SAT solver and compares it against VCS.
The paper uses Sudoku constraint solving as a benchmark methodology.
The paper uses OOP constraint composition as one of the test bench approaches.
The paper uses flat constraint composition as one of the test bench approaches.
The paper uses clausal reduction optimization techniques and evaluates their effect on solver performance.
The paper uses SystemVerilog as the hardware verification language for the test bench.
The paper uses Perl for post-processing verification scripts and to generate flat game board test benches.
The paper uses the SystemVerilog Sudoku solver test bench as its primary experimental artifact.
Jeremy Ridgeway is affiliated with Avago Technologies, the organization associated with this paper.
The paper mentions SMT as a technique used in conjunction with SAT by constraint solvers.
The paper translates constraints to SMT2 format to use with public domain SAT solvers.
The paper discusses constrained random verification as the motivation for efficient constraint solving.
The paper is authored by Jeremy Ridgeway.
The paper mentions SAT solving as a technique employed by constraint solvers.