Article

Free access

Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits

Authors:

Gianpiero Cabodi,

Paolo Camurati,

Luciano Lavagno,

Stefano QuerAuthors Info & Claims

DAC '97: Proceedings of the 34th annual Design Automation Conference

Pages 728 - 733

https://doi.org/10.1145/266021.266355

Published: 13 June 1997 Publication History

PDF eReader

Abstract

Extending the applicability of reachability analysis to large andreal circuits is a key issue.In fact they are still limited forthe following reasons: peak BDD size during image computation,BDD explosion for representing state sets and very highsequential depth.Following the promising trend of partitioning and problem decomposition,we present a new approach based on a disjunctivepartitioned transition relation and on an improved iterativesquaring.In this approach a Finite State Machine is decomposedand traversed one "functioning-mode" at a time bymeans of the "disjunctive" partitioned approach.The overall algorithm aims at lowering the intermediate peakBDD size pushing further reachability analysis.Experimentson a few industrial circuits containing counters and on somelarge benchmarks show the feasibility of the approach.

References

[1]

K. Ravi, F. Somenzi, "High-Density Reachability Analysis," in Proc. IEEE/ACM ICCAD'95, pp. 154- 158, November 1995

Digital Library

Google Scholar

[2]

G. Cabodi, P. Camurati, S. Quer, "Improved Reachability Analysis of Large Finite State Machine," in Proc. IEEE/ACM ICCAD'96, pp. a54-a60, November 1996

Digital Library

Google Scholar

[3]

J.R. Butch, E.M. Clarke, D.E. Long, K.L. McMillan, D.L. Dill: "Symbolic Model Checking for Sequential Circuit Verification," lEEE-Trar~saction on CAD, pp. 401-424, Volume 13, Number 4, April 1994

Google Scholar

[4]

J.R. Butch, E.M. Clarke, D.E. Long: "Representing Circuits More Efficiently in Symbolic Model Checking," in Proc. A CM/IEEE DAC'91, pp. 403-407, June 1991

Digital Library

Google Scholar

[5]

R. I-Iojati, S.C. Krishnan, R.K. Brayton, "Early Quantification and Partitioned Transition Relation," in Proc. IEEE ICCD'96, pp. 12-19, October 1996

Digital Library

Google Scholar

[6]

H. Cho, G.D. I-Iachtel, E. Macii, M. Poncino, K. Ravi, F. Somenzi, "Approximate Finite State Machine Traversal: Extensions and New Results," in Proc. IWLS'95, May 1995

Google Scholar

[7]

M68HCll Reference Manual, Motorola inc., 1991

Google Scholar

[8]

G. Cabodi, P. Camurati, L. Lavagno, S. Quer, "Synthesis and verification of counters based on symbolic techniques," in Proc. EDAA/1EEE/ACM ED~TC'97, pp. 176-181, March 1997

Digital Library

Google Scholar

Cited By

View all

Ge-Ernst AScholl CSíč JWimmer R(2022)Solving dependency quantified Boolean formulas using quantifier localizationTheoretical Computer Science10.1016/j.tcs.2022.03.029Online publication date: Mar-2022
https://doi.org/10.1016/j.tcs.2022.03.029
Munoz DOh JPinto MFuentes LBatory D(2019)Uniform Random Sampling Product Configurations of Feature Models That Have Numerical FeaturesProceedings of the 23rd International Systems and Software Product Line Conference - Volume A10.1145/3336294.3336297(289-301)Online publication date: 9-Sep-2019
https://dl.acm.org/doi/10.1145/3336294.3336297
Tang YNorman TParsons S(2010)Computing argumentation in polynomial number of BDD operationsProceedings of the 7th international conference on Argumentation in Multi-Agent Systems10.1007/978-3-642-21940-5_16(268-285)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-21940-5_16
Show More Cited By

Index Terms

Disjunctive partitioning and partial iterative squaring: an effective approach for symbolic traversal of large circuits

Recommendations

Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring
The Euromicro Journal
New bit-parallel Montgomery multiplier for trinomials using squaring operation

A new bit-parallel Montgomery multiplier for GF ( 2 m ) is presented, where the field is generated with an irreducible trinomial. We first present a slightly generalized version of a newly proposed divide and conquer approach. Then, by combining this ...
VLSI circuit partitioning by cluster-removal using iterative improvement techniques
ICCAD '96: Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design

Move-based iterative improvement partitioning methods such as the Fiduccia-Mattheyses (FM) algorithm and Krishnamurthy's Look-Ahead (LA) algorithm are widely used in VLSI CAD applications largely due to their time efficiency and ease of implementation. ...

Comments

Information & Contributors

Information

Published In

DAC '97: Proceedings of the 34th annual Design Automation Conference

June 1997

788 pages

ISBN:0897919203

DOI:10.1145/266021

Chairmen:
Ellen J. Yoffa
IBM T. J. Watson Research Center, Yorktown Heights, NY
,
Giovanni De Micheli
Stanford Univ., Stanford, CA
,
Jan M. Rabaey
Univ. of California, Berkeley

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 1997

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

DAC97

Sponsor:

EDAC
SIGDA
IEEE-CAS

DAC97: The 34th Design Automation Conference

June 9 - 13, 1997

California, Anaheim, USA

Acceptance Rates

DAC '97 Paper Acceptance Rate 139 of 400 submissions, 35%;

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

39
Total Citations
View Citations
70
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)11

Reflects downloads up to 03 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Ge-Ernst AScholl CSíč JWimmer R(2022)Solving dependency quantified Boolean formulas using quantifier localizationTheoretical Computer Science10.1016/j.tcs.2022.03.029Online publication date: Mar-2022
https://doi.org/10.1016/j.tcs.2022.03.029
Munoz DOh JPinto MFuentes LBatory D(2019)Uniform Random Sampling Product Configurations of Feature Models That Have Numerical FeaturesProceedings of the 23rd International Systems and Software Product Line Conference - Volume A10.1145/3336294.3336297(289-301)Online publication date: 9-Sep-2019
https://dl.acm.org/doi/10.1145/3336294.3336297
Tang YNorman TParsons S(2010)Computing argumentation in polynomial number of BDD operationsProceedings of the 7th international conference on Argumentation in Multi-Agent Systems10.1007/978-3-642-21940-5_16(268-285)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.1007/978-3-642-21940-5_16
Yang ZWang CGupta AIvančić F(2009)Model checking sequential software programs via mixed symbolic analysisACM Transactions on Design Automation of Electronic Systems10.1145/1455229.145523914:1(1-26)Online publication date: 23-Jan-2009
https://dl.acm.org/doi/10.1145/1455229.1455239
Thomas DChakraborty SPandya P(2008)Efficient guided symbolic reachability using reachability expressionsInternational Journal on Software Tools for Technology Transfer (STTT)10.5555/3220900.322111510:2(113-129)Online publication date: 1-Mar-2008
https://dl.acm.org/doi/10.5555/3220900.3221115
Thomas DChakraborty SPandya P(2008)Efficient guided symbolic reachability using reachability expressionsInternational Journal on Software Tools for Technology Transfer10.1007/s10009-007-0057-710:2(113-129)Online publication date: 8-Jan-2008
https://doi.org/10.1007/s10009-007-0057-7
Wang CYang ZIvančić FGupta A(2007)Disjunctive image computation for software verificationACM Transactions on Design Automation of Electronic Systems10.1145/1230800.123080212:2(10-es)Online publication date: 1-Apr-2007
https://dl.acm.org/doi/10.1145/1230800.1230802
Wang CYang ZIvančić FGupta AGielen G(2006)Disjunctive image computation for embedded software verificationProceedings of the conference on Design, automation and test in Europe: Proceedings10.5555/1131481.1131815(1205-1210)Online publication date: 6-Mar-2006
https://dl.acm.org/doi/10.5555/1131481.1131815
Ward DSomenzi FHassoun S(2006)Decomposing image computation for symbolic reachability analysis using control flow informationProceedings of the 2006 IEEE/ACM international conference on Computer-aided design10.1145/1233501.1233662(779-785)Online publication date: 5-Nov-2006
https://dl.acm.org/doi/10.1145/1233501.1233662
Peranandam PNalla PRuf JWeiss RKropf TRosenstiel WSentovich E(2006)Fast falsification based on symbolic bounded property checkingProceedings of the 43rd annual Design Automation Conference10.1145/1146909.1147181(1077-1082)Online publication date: 24-Jul-2006
https://dl.acm.org/doi/10.1145/1146909.1147181
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Cited By

Index Terms

Recommendations

Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring

New bit-parallel Montgomery multiplier for trinomials using squaring operation

VLSI circuit partitioning by cluster-removal using iterative improvement techniques

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

Abstract

References

Cited By

Index Terms

Recommendations

Reachability analysis of large circuits using disjunctive partitioning and partial iterative squaring

New bit-parallel Montgomery multiplier for trinomials using squaring operation

VLSI circuit partitioning by cluster-removal using iterative improvement techniques

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Upcoming Conference

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations