SWORD: A SAT like prover using word level information

@inproceedings{Wille2007SWORDAS,
  title={SWORD: A SAT like prover using word level information},
  author={Robert Wille and G{\"o}rschwin Fey and Daniel Gro{\ss}e and Stephan Eggersgl{\"u}{\ss} and Rolf Drechsler},
  booktitle={VLSI-SoC},
  year={2007}
}
Solvers for Boolean Satisfiability (SAT) are state-of-the-art to solve verification problems. But when arithmetic operations are considered, the verification performance degrades with increasing data-path width. Therefore, several approaches that handle a higher level of abstraction have been studied in the past. But the resulting solvers are still not robust enough to handle problems that mix word level structures with bit level descriptions. In this paper, we present the satisfiability solver… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 38 CITATIONS

Similar Papers

Loading similar papers…