research-article

A robust general constrained random pattern generator for constraints with variable ordering

Authors:

Chung-Yang (Ric) HuangAuthors Info & Claims

ICCAD '12: Proceedings of the International Conference on Computer-Aided Design

Pages 109 - 114

https://doi.org/10.1145/2429384.2429405

Published: 05 November 2012 Publication History

Abstract

Constrained random verification (CRV) methodology has been identified as an efficient solution to functional verification challenges. In practical cases, it is required to implement constraints with variable ordering to put essential efforts on cared patterns. However, handling constraints with variable ordering may encounter performance degradation of pattern generation speed and distribution. To resolve these challenges, we provide a preprocessing technique to analyze solution space by adaptively splitting ranges of variables and prove the feasibility of each subspace. This analysis allows us to perform effective range-reduction to enhance pattern generation speed and ensure the desired distribution. From the experimental results, our framework outperforms a state-of-art tool with 10X speedup in average and retains better stability of performance with the increase of number of variable orders.

References

[1]

IEEE Standard for SystemVerilog -- Unified Hardware Design, Specification and Verification Language, IEEE Computer Society, IEEE, New York, NY, IEEE Std 1800, 2005.

[2]

J. Yuan, K. Shultz, C. Pixley, H. Miller, and A. Aziz, "Modeling design constraints and biasing in simulation using BDDs," ICCAD, pp. 584--589, 1999.

Digital Library

[3]

J. Yuan, A. Aziz, C. Pixley, and K. Albin, "Simplifying Boolean constraint solving for random simulation-vector generation," TCAD, pp. 412--420, 2004.

Digital Library

[4]

Y. Zhao, J. Bian, S. Deng and Z. Kong, "Random stimulus generation with self-tuning," CSCWD, pp. 62--65, 2009.

Digital Library

[5]

S. M. Plaza, I. L. Markov and V. Bertacco, "Random stimulus generation using entropy and XOR constraints," DATE, pp. 664--669, 2008.

Digital Library

[6]

S. Deng, Z. Kong, J. Bian and Y. Zhao, "Self-adjusting constrained random stimulus generation using splitting evenness evaluation and XOR constraints," ASPDAC, pp. 769--774, 2009.

Digital Library

[7]

L. Devroye, "Random variate generation for unimodal and monotone densities", Computing, v. 32 n. 1, pp. 43--68, 1984.

Digital Library

[8]

M. A. Iyer, "RACE: A word-level ATPG-based constraints solver system for smart random simulation," ITC, pp. 299--308, 2003.

[9]

W. Wei, J. Erenrich, and B. Selman, "Towards efficient sampling: exploiting random walk strategies," AAAI, pp. 670--676, 2004.

Digital Library

[10]

B. Selman, H. A. Kautz, and B. Cohen, "Local search strategies for satisfiability testing," DMTCS, 1993.

[11]

N. Kitchen and A. Kuehlmann, "Stimulus generation for constrained random simulation," ICCAD, pp. 258--265, 2007.

Digital Library

[12]

N. Kitchen and A. Kuehlmann, "A Markov chain Monte Carlo sampler for mixed Boolean/integer constraints," CAV, pp. 446--461, 2009.

Digital Library

[13]

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller and E. Teller, "Equations of state calculations by fast computing machines" J. Cjem. Phys. pp. 1087--1092, 1970.

[14]

H. Kim, H. Jin, K. Ravi, P. Spacek, J. Pierce, B. Kurshan and F. Somenzi, "Application of formal word-level analysis to constrained random simulation," CAV, 2008.

Digital Library

[15]

B.-H Wu, C.-J. Yang, C.-C. Tso and C.-Y, Huang, "Toward an extremely-high-throughput and even-distribution pattern generator for the constrained random simulation techniques," ICCAD, pp. 602--607, 2011

Digital Library

[16]

MiniSAT 2.20 website: http://minisat.se/MiniSat.html

Cited By

Mani Paret JMohamed O(2015)Optimum domain partitioning to increase functional verification coverageSixteenth International Symposium on Quality Electronic Design10.1109/ISQED.2015.7085462(419-423)Online publication date: Mar-2015
https://doi.org/10.1109/ISQED.2015.7085462
Jomu George MMohamed O(2015)A methodology to generate evenly distributed input stimuli by clustering of variable domainProceedings of the 2015 33rd IEEE International Conference on Computer Design (ICCD)10.1109/ICCD.2015.7357171(605-612)Online publication date: 18-Oct-2015
https://dl.acm.org/doi/10.1109/ICCD.2015.7357171
Wu BYang CHuang C(2014)A High-Throughput and Arbitrary-Distribution Pattern Generator for the Constrained Random VerificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2013.228277633:1(139-152)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1109/TCAD.2013.2282776
Show More Cited By

Index Terms

A robust general constrained random pattern generator for constraints with variable ordering
1. Applied computing
  1. Arts and humanities
    1. Architecture (buildings)
      1. Computer-aided design
  2. Physical sciences and engineering
    1. Engineering
      1. Computer-aided design
2. Theory of computation
  1. Semantics and reasoning
    1. Program reasoning
      1. Program verification

Recommendations

Variable ordering and constraint propagation for constrained CP-nets

A Conditional Preferences network (CP-net) is a known graphical model for representing qualitative preferences. In many real world applications we are often required to manage both constraints and preferences in an efficient way. The goal here is to ...
On Random Ordering Constraints
CSR '09: Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications

Ordering constraints are analogous to instances of the satisfiability problem in conjunctive normalform, but instead of a boolean assignment we consider a linear ordering of the variables in question. A clause becomes true given a linear ordering iff ...
Minimal ordering constraints for some families of variable symmetries

Variable symmetries in a constraint satisfaction problem can be broken by adding lexicographic ordering constraints. Existing general methods of generating such sets of ordering constraints can require a huge number of constraints. This adds an ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ICCAD '12: Proceedings of the International Conference on Computer-Aided Design

November 2012

781 pages

ISBN:9781450315739

DOI:10.1145/2429384

General Chair:
Alan J. Hu
Univ. of British Columbia, Vancouver, BC, Canada

Copyright © 2012 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

SIGDA: ACM Special Interest Group on Design Automation
IEEE CEDA

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 05 November 2012

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

National Science Council Taiwan

Conference

ICCAD '12

Sponsor:

SIGDA

ICCAD '12: The International Conference on Computer-Aided Design

November 5 - 8, 2012

California, San Jose

Acceptance Rates

Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
65
Total Downloads

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

Reflects downloads up to 05 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Mani Paret JMohamed O(2015)Optimum domain partitioning to increase functional verification coverageSixteenth International Symposium on Quality Electronic Design10.1109/ISQED.2015.7085462(419-423)Online publication date: Mar-2015
https://doi.org/10.1109/ISQED.2015.7085462
Jomu George MMohamed O(2015)A methodology to generate evenly distributed input stimuli by clustering of variable domainProceedings of the 2015 33rd IEEE International Conference on Computer Design (ICCD)10.1109/ICCD.2015.7357171(605-612)Online publication date: 18-Oct-2015
https://dl.acm.org/doi/10.1109/ICCD.2015.7357171
Wu BYang CHuang C(2014)A High-Throughput and Arbitrary-Distribution Pattern Generator for the Constrained Random VerificationIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2013.228277633:1(139-152)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1109/TCAD.2013.2282776
Wu BHuang C(2013)A robust constraint solving framework for multiple constraint sets in constrained random verificationProceedings of the 50th Annual Design Automation Conference10.1145/2463209.2488880(1-7)Online publication date: 29-May-2013
https://dl.acm.org/doi/10.1145/2463209.2488880

View Options

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.

Figures

Tables

Media

View Table of Conten