RTL-Datapath Verification using Integer Linear Programming

  title={RTL-Datapath Verification using Integer Linear Programming},
  author={Raik Brinkmann and Rolf Drechsler},
  booktitle={VLSI Design},
Satisfiability of complex word-level formulas often arises as a problem in formal verification of hardware designs described at the register transfer level (RTL). Even though most designs are described in a hardware description language (HDL), like Verilog or VHDL, usually this problem is solved in the Boolean domain, using Boolean solvers. These engines often show a poor performance for data path verification. Instead of solving the problem at the bit-level, a method is proposed to transform… CONTINUE READING
Highly Influential
This paper has highly influenced 11 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS
Highly Cited
This paper has 146 citations. REVIEW CITATIONS


Publications citing this paper.
Showing 1-10 of 91 extracted citations

A layered algorithm for quantifier elimination from linear modular constraints

Formal Methods in System Design • 2016
View 16 Excerpts
Highly Influenced

Modular equivalence verification of polynomial datapaths with multiple word-length operands

2011 IEEE International High Level Design Validation and Test Workshop • 2011
View 4 Excerpts
Highly Influenced

Formal verification at higher levels of abstraction

2007 IEEE/ACM International Conference on Computer-Aided Design • 2007
View 3 Excerpts
Highly Influenced

Normalization at the arithmetic bit level

Proceedings. 42nd Design Automation Conference, 2005. • 2005
View 4 Excerpts
Highly Influenced

RTL SAT simplification by Boolean and interval arithmetic reasoning

ICCAD-2005. IEEE/ACM International Conference on Computer-Aided Design, 2005. • 2005
View 6 Excerpts
Highly Influenced

147 Citations

Citations per Year
Semantic Scholar estimates that this publication has 147 citations based on the available data.

See our FAQ for additional information.


Publications referenced by this paper.
Showing 1-4 of 4 references

The Omega test: A fast and practical integer programming algorithm for dependence analysis

Proceedings of the 1991 ACM/IEEE Conference on Supercomputing (Supercomputing '91) • 1991
View 4 Excerpts
Highly Influenced

Similar Papers

Loading similar papers…