Article

An efficient finite-domain constraint solver for circuits

Authors:

G. Parthasarathy,

L.-C. WangAuthors Info & Claims

DAC '04: Proceedings of the 41st annual Design Automation Conference

Pages 212 - 217

https://doi.org/10.1145/996566.996628

Published: 07 June 2004 Publication History

Abstract

We present a novel hybrid finite-domain constraint solving engine for RTL circuits, that automatically uses data-path abstraction. We describe how DPLL search can be modified by using efficient finite-domain constraint propagation to improve communication between interacting integer and Boolean domains. This enables efficient combination of Boolean SAT and linear integer arithmetic solving techniques. We use conflict-based learning using the variables on the boundary of control and data-path for additional performance benefits. Finally, the hybrid constraint solver is experimentally analyzed using some example circuits.

References

[1]

Abramovici, M., Breuer, M. A., and Friedman, A. D. Digital Systems Testing and Testable Design, 1$^st$ ed. Computer Science Press, 1990.

[2]

C. Barett, D. L. Dill, and J. Levitt. Validity Checking for Combinations of Theories with Equality. In Proc. of FMCAD November 1996, M. Srivas and A. Camilleri, Eds., vol. 1166 of LNCS, pp. 187--201.

Digital Library

[3]

C. W. Barrett, D. L. Dill, and J. R. Levitt. A Decision Procedure for Bit-Vector Arithmetic. In 35th DAC (1998), pp. 522--527.

Digital Library

[4]

Brinkmann, R., and Dreschler, R. RTL-Datapath Verification using Integer Linear Programming. In Proc. of 15th VLSI Design Conf. (Jan. 2001), pp. 741--746.

Digital Library

[5]

R.E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Trans. on Computers C-35, 8 August 1986, 677--691.

Digital Library

[6]

Dantzig, G., and Eaves, B. Fourier-motzkin elimination and its dual. Journal of Combinatorial Theory A, 14 (1973), 288--297.

[7]

M. Davis, G. Logeland, and D. Loveland. A machine program for theorem proving. Communications of the ACM 5, 7 (1962).

Digital Library

[8]

M. Davis, and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM 7 (1960), 201--215.

Digital Library

[9]

R. Drechsler, B. Becker, and S. Ruppertz. K*BMDs: a new data structure for verification. In IFI WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods Frankfurt, Germany, October 1995.

Digital Library

[10]

W. Harvey, and P.J. Stuckey. Improving Linear Constraint Propagation by Changing Constraint Representation. Constraints 8, 2 (2003), 173--207.

Digital Library

[11]

C.-Y. Huang, and K.-T. Cheng. Assertion Checking by Combined Word-level ATPG and Modular Arithmetic Constraint-Solving Techniques. In 37th DAC,( 2000).

Digital Library

[12]

Iyer, M. A. RACE: A Word-Level ATPG-Based Constraints Solver System For Smart Random Simulation In Proc. of the ITC (2003), pp. 259--266.

[13]

M.K. Iyer, G. Parthasarathy, and K.-T. Cheng. SATORI -- A Fast Sequential Sat Solver for Circuits. In Proc. of ICCAD(November 2003), pp. 320--325.

Digital Library

[14]

W. Kelly, V. Maslow, W. Pugh, et. al. The Omega Calculator and Library v1.1.0. Tech. rep., Dept. of CS, University of Maryland, College Park, November 1996.

[15]

Liu, C., Kuehlmann, A., and Moskewicz, M. CAMA: a multi-valued satisfiablity solver. In Proc. of ICCAD (Nov. 2003), pp. 326--333.

Digital Library

[16]

J.P Marques-Silva, and K.A. Sakallah. Grasp - A Search Algorithm for Propositional Satisfiability. IEEE Trans. on Computers 48, 5 (May 1999), 506--521.

Digital Library

[17]

M. Moskiewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Engineering an Efficient SAT Solver. In 38th DAC (2001).

Digital Library

[18]

R.M. Stallman, and G.J. Sussman. Forward Reasoning and Dependency Directed Backtracking in a System for Computer Aided Circuit Analysis". Artificial Intelligence 9, 2 (1977), 135--196.

[19]

Strichman, O. On Solving Presburger and Linear Arithmetic with SAT. In Proc. of FMCAD(2002).

Digital Library

[20]

Zhang, L., Madigan, C., Moskewicz, M., and Malik, S. Efficient Conflict Driven Learning in a Boolean Satisfiability Solver. In Proc. of ICCAD (Nov. 2002).

Digital Library

Cited By

Beame PLiew V(2019)Toward Verifying Nonlinear Integer ArithmeticJournal of the ACM10.1145/331939666:3(1-30)Online publication date: 14-Jun-2019
https://dl.acm.org/doi/10.1145/3319396
Kafle BGange GSchachte PSøndergaard HStuckey P(2017)A Benders Decomposition Approach to Deciding Modular Linear Integer ArithmeticTheory and Applications of Satisfiability Testing – SAT 201710.1007/978-3-319-66263-3_24(380-397)Online publication date: 9-Aug-2017
https://doi.org/10.1007/978-3-319-66263-3_24
Beame PLiew V(2017)Towards Verifying Nonlinear Integer ArithmeticComputer Aided Verification10.1007/978-3-319-63390-9_13(238-258)Online publication date: 13-Jul-2017
https://doi.org/10.1007/978-3-319-63390-9_13
Show More Cited By

Index Terms

Recommendations

Applications of Boolean Satisfiability to Verification and Testing of Switch-Level Circuits

This work extends to the switch level the verification and testing techniques based upon boolean satisfiability (SAT), so that SAT-based methodologies can be applied to circuits that cannot be well described at the gate level. The main achieved goal was ...
Boolean satisfiability with transitivity constraints

We consider a variant of the Boolean satisfiability problem where a subset ε of the propositional variables appearing in formula F_sat encode a symmetric, transitive, binary relation over N elements. Each of these relational variables, e_i,j, for 1 ≤ i < ...
A hybrid BDD and SAT finite domain constraint solver
PADL'06: Proceedings of the 8th international conference on Practical Aspects of Declarative Languages

Finite-domain constraint solvers based on Binary Decision Diagrams (BDDs) are a powerful technique for solving constraint problems over finite set and integer variables represented as Boolean formulæ. Boolean Satisfiability (SAT) solvers are another ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

DAC '04: Proceedings of the 41st annual Design Automation Conference

June 2004

1002 pages

ISBN:1581138288

DOI:10.1145/996566

General Chair:
Sharad Malik
Princeton University, Princeton, NJ
,
Program Chairs:
Limor Fix
Intel Semiconductors Ltd., Haifa, Israel
,
Andrew B. Kahng
University of California at San Diego, La Jolla, CA

Copyright © 2004 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 07 June 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

DAC04

Sponsor:

DAC04: The 41st Annual Design Automation Conference 2004

June 7 - 11, 2004

CA, San Diego, USA

Acceptance Rates

Overall Acceptance Rate 1,770 of 5,499 submissions, 32%

Upcoming Conference

DAC '25

Sponsor:
sigda

62nd ACM/IEEE Design Automation Conference

June 22 - 26, 2025

San Francisco , CA , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

21
Total Citations
View Citations
409
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

Beame PLiew V(2019)Toward Verifying Nonlinear Integer ArithmeticJournal of the ACM10.1145/331939666:3(1-30)Online publication date: 14-Jun-2019
https://dl.acm.org/doi/10.1145/3319396
Kafle BGange GSchachte PSøndergaard HStuckey P(2017)A Benders Decomposition Approach to Deciding Modular Linear Integer ArithmeticTheory and Applications of Satisfiability Testing – SAT 201710.1007/978-3-319-66263-3_24(380-397)Online publication date: 9-Aug-2017
https://doi.org/10.1007/978-3-319-66263-3_24
Beame PLiew V(2017)Towards Verifying Nonlinear Integer ArithmeticComputer Aided Verification10.1007/978-3-319-63390-9_13(238-258)Online publication date: 13-Jul-2017
https://doi.org/10.1007/978-3-319-63390-9_13
Chihani ZMarre BBobot FBardin S(2017)Sharpening Constraint Programming Approaches for Bit-Vector TheoryIntegration of AI and OR Techniques in Constraint Programming10.1007/978-3-319-59776-8_1(3-20)Online publication date: 31-May-2017
https://doi.org/10.1007/978-3-319-59776-8_1
Bryant RKroening DOuaknine JSeshia SStrichman OBrady B(2009)An abstraction-based decision procedure for bit-vector arithmeticInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3220882.322098411:2(95-104)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.5555/3220882.3220984
Achterberg T(2009)SCIP: solving constraint integer programsMathematical Programming Computation10.1007/s12532-008-0001-11:1(1-41)Online publication date: 20-Jan-2009
https://doi.org/10.1007/s12532-008-0001-1
Bryant RKroening DOuaknine JSeshia SStrichman OBrady B(2009)An abstraction-based decision procedure for bit-vector arithmeticInternational Journal on Software Tools for Technology Transfer10.1007/s10009-009-0101-x11:2(95-104)Online publication date: 12-Feb-2009
https://doi.org/10.1007/s10009-009-0101-x
Mirzaeian SFeijun Zheng Cheng K(2008)RTL Error Diagnosis Using a Word-Level SAT-Solver2008 IEEE International Test Conference10.1109/TEST.2008.4700568(1-8)Online publication date: Oct-2008
https://doi.org/10.1109/TEST.2008.4700568
Bryant RKroening DOuaknine JSeshia SStrichman OBrady B(2007)Deciding bit-vector arithmetic with abstractionProceedings of the 13th international conference on Tools and algorithms for the construction and analysis of systems10.5555/1763507.1763544(358-372)Online publication date: 24-Mar-2007
https://dl.acm.org/doi/10.5555/1763507.1763544
Kroening DSeshia SGielen G(2007)Formal verification at higher levels of abstractionProceedings of the 2007 IEEE/ACM international conference on Computer-aided design10.5555/1326073.1326192(572-578)Online publication date: 5-Nov-2007
https://dl.acm.org/doi/10.5555/1326073.1326192
Show More Cited By

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents