Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/968878.969007acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
Article

Enhanced Diameter Bounding via Structural

Published: 16 February 2004 Publication History

Abstract

Bounded model checking (BMC) has gained widespread industrial use due to its relative scalability. Its exhaustiveness over all valid input vectors allows it to expose arbitrarily complex design flaws. However, BMC is limited to analyzing only a specific time window, hence will only expose those flaws which manifest within that window and thus cannot readily prove correctness. The diameter of a design has thus become an important concept -- a bounded check of depth equal to the diameter constitutes a complete proof. While the diameter of a design may be exponential in the number of its state elements, in practice it often ranges from tens to a few hundred regardless of design size. Therefore, a powerful diameterover-approximation technique may enable automatic proofs that otherwise would be infeasible. Unfortunately, exact diameter calculation requires exponential resources, and over-approximation techniques may yield exponentially loose bounds. In this paper, we provide a general approach for enabling the use of structural transformations, such as redundancy removal, retiming, and target enlargement, to tighten the bounds obtained by arbitrary diameterapproximation techniques. Numerous experiments demonstrate that this approach may significantly increase the set of designs for which practically useful diameter bounds may be obtained.

References

[1]
{1} A. Aziz, V. Singhal, and R. K. Brayton, "Verifying interacting finite state machines: Complexity issues," Tech. Rep. UCB/ERL M93/52, University of California at Berkeley, July 1993.
[2]
{2} A. Biere, A. Cimatti, E. M. Clarke, and Y. Zhu, "Symbolic model checking without BDDs," in Tools and Algorithms for Construction and Analysis of Systems, March 1999.
[3]
{3} L. Zhang and S. Malik, "Conflict driven learning in a quantified Boolean satisfiability solver," in Int'l Conference on Computer Design , Nov. 2002.
[4]
{4} M. N. Mneimneh and K. A. Sakallah, "SAT-based sequential depth computation," in ASP Design Automation Conference, January 2003.
[5]
{5} M. Sheeran, S. Singh, and G. Stalmarck, "Checking safety properties using induction and a SAT-solver," in Formal Methods in Computer-Aided Design, Nov. 2000.
[6]
{6} D. Kroening and O. Strichman, "Efficient computation of recurrence diameters," in Int'l Conference on Verification, Model Checking, and Abstract Interpretation, Jan. 2003.
[7]
{7} J. Baumgartner, A. Kuehlmann, and J. Abraham, "Property checking via structural analysis," in Computer-Aided Verification, July 2002.
[8]
{8} C.-C. Yen, K.-C. Chen, and J.-Y. Jou, "A practical approach to cycle bound estimation," in Int'l Workshop on Logic & Synthesis, 2002.
[9]
{9} A. Kuehlmann and J. Baumgartner, "Transformation-based verification using generalized retiming," in Computer-Aided Verification, July 2001.
[10]
{10} J. Baumgartner, T. Heyman, V. Singhal, and A. Aziz, "Model checking the IBM Gigahertz Processor: An abstraction algorithm for high-performance netlists," in Computer-Aided Verification, July 1999.
[11]
{11} E. A. Emerson, "Temporal and modal logic," Handbook of Theoretical Computer Science, vol. B, 1990.
[12]
{12} A. Aziz, V. Singhal, G. M. Swamy, and R. K. Brayton, "Minimizing interacting finite state machines: A compositional approach to language containment," in Int'l Conference on Computer Design, 1994.
[13]
{13} K. Fisler and M. Vardi, "Bisimulation and model checking," in Correct Hardware Design and Verification Methods, Sept. 1999.
[14]
{14} A. Kuehlmann, V. Paruthi, F. Krohm, and M. Ganai, "Robust Boolean reasoning for equivalence checking and functional property verification," IEEE Transactions on Computer-Aided Design, vol. 21, Dec. 2002.
[15]
{15} J. Baumgartner and A. Kuehlmann, "Min-area retiming on flexible circuit structures," in Int'l Conference on Computer-Aided Design, 2001.
[16]
{16} I.-H. Moon, H. H. Kwak, J. Kukula, T. Shiple, and C. Pixley, "Simplifying circuits for formal verification using parametric representation," in Formal Methods in Computer-Aided Design, Nov. 2002.
[17]
{17} J. Baumgartner, Automatic Structural Abstraction Techniques for Enhanced Verification. PhD thesis, University of Texas, Dec. 2002.
[18]
{18} C. Leiserson and J. Saxe, "Retiming synchronous circuitry," Algorithmica , vol. 6, 1991.
[19]
{19} A. Gupta, P. Ashar, and S. Malik, "Exploiting retiming in a guided simulation based validation methodology," in Correct Hardware Design and Verification Methods, Sept. 1999.
[20]
{20} G. Cabodi, S. Quer, and F. Somenzi, "Optimizing sequential verification by retiming transformations," in Design Automation Conference, June 2000.
[21]
{21} J. Baumgartner, A. Tripp, A. Aziz, V. Singhal, and F. Andersen, "An abstraction algorithm for the verification of generalized C-slow designs," in Computer-Aided Verification, July 2000.
[22]
{22} J. Yuan, J. Shen, J. Abraham, and A. Aziz, "On combining formal and informal verification," in Computer-Aided Verification, June 1997.
[23]
{23} C. H. Yang and D. L. Dill, "Validation with guided search of the state space," in Design Automation Conference, June 1998.
[24]
{24} M. Ganai, Algorithms for Efficient State Space Search. PhD thesis, University of Texas, May 2001.
[25]
{25} A. Kuehlmann and F. Krohm, "Equivalence checking using cuts and heaps," in Design Automation Conference, June 1997.
[26]
{26} R. P. Kurshan, Computer-Aided Verification of Coordinating Processes . Princeton University Press, 1994.
[27]
{27} A. Kuehlmann, M. Ganai, and V. Paruthi, "Circuit-based Boolean reasoning," in Design Automation Conference, June 2001.

Cited By

View all
  • (2018)Global and Local Deadlock Freedom in BIPACM Transactions on Software Engineering and Methodology10.1145/315291026:3(1-48)Online publication date: 3-Jan-2018
  • (2006)Computing Over-Approximations with Bounded Model CheckingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.07.021144:1(79-92)Online publication date: 1-Jan-2006

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DATE '04: Proceedings of the conference on Design, automation and test in Europe - Volume 1
February 2004
688 pages
ISBN:0769520855

Sponsors

Publisher

IEEE Computer Society

United States

Publication History

Published: 16 February 2004

Check for updates

Qualifiers

  • Article

Conference

DATE04
Sponsor:

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25
Design, Automation and Test in Europe
March 31 - April 2, 2025
Lyon , France

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2018)Global and Local Deadlock Freedom in BIPACM Transactions on Software Engineering and Methodology10.1145/315291026:3(1-48)Online publication date: 3-Jan-2018
  • (2006)Computing Over-Approximations with Bounded Model CheckingElectronic Notes in Theoretical Computer Science (ENTCS)10.1016/j.entcs.2005.07.021144:1(79-92)Online publication date: 1-Jan-2006

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media