Formal verification of modular multipliers using symbolic computer algebra and boolean satisfiability.
Alireza MahzoonDaniel GroßeChristoph SchollAlexander KonradRolf DrechslerPublished in: DAC (2022)
Keyphrases
- formal verification
- computer algebra
- boolean satisfiability
- computer algebra systems
- model checking
- branch and bound algorithm
- sat solvers
- theorem prover
- symmetry breaking
- integer linear programming
- probabilistic planning
- sat problem
- randomly generated
- combinatorial problems
- lower bound
- constraint satisfaction problems
- max sat
- phase transition
- column generation
- theorem proving
- np complete
- optimization problems
- np hard