EHSAT an efficient RTL satisfiability solver using an extended DPLL procedure

This paper presents an efficient algorithm to solve the satisfiability (SAT) problem for RTL designs using a complete hybrid branch-and-bound strategy with conflict-driven learning. The main framework is the extended Davis-Putnam-Logemann-Loveland procedure (DPLL) which is a unified procedure combin...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:2007 44th ACM/IEEE Design Automation Conference S. 588 - 593
Hauptverfasser: Deng, Shujun, Bian, Jinian, Wu, Weimin, Yang, Xiaoqing, Zhao, Yanni
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 04.06.2007
IEEE
Schriftenreihe:ACM Conferences
Schlagworte:
ISBN:1595936270, 9781595936271
ISSN:0738-100X
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents an efficient algorithm to solve the satisfiability (SAT) problem for RTL designs using a complete hybrid branch-and-bound strategy with conflict-driven learning. The main framework is the extended Davis-Putnam-Logemann-Loveland procedure (DPLL) which is a unified procedure combining Boolean logic and arithmetic operations. A hybrid two-literal-watching scheme and interval reasoning based on RTL predicates are used as the powerful hybrid constraint propagation strategies. Conflict-based learning is also implemented as another important technique to enhance efficiency. Comparisons with a state-of-the-art RTL SAT solver, a SMT solver and an ILP solver show that EHSAT outperforms these solvers for RTL satisfiability problems.
Bibliographie:SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
ISBN:1595936270
9781595936271
ISSN:0738-100X
DOI:10.1145/1278480.1278629