Random Stimulus Generation using Entropy and XOR Constraints

Plaza,; Bertacco,

doi:10.1109/date.2008.4484754

Cited by 12 publications

(14 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11], it is shown that if S f is the set of all solutions of f , then the addition of constraints from k such random w vectors probabilistically reduces the solution space to 2 −k |S f |.…”

Section: Deriving Evenly-distributed Sat Solutionsmentioning

confidence: 99%

“…Based on the Valiant-Vazirani theorem [13], Plaza et al [11] proposed to use XOR-constraints to generate SAT solutions that are evenly distributed. In their technique, assume that a SAT instance f with variables x 1 , x 2 , .…”

Section: Deriving Evenly-distributed Sat Solutionsmentioning

confidence: 99%

“…To address this problem, we utilize the Valiant-Vazirani theorem [11], [13] by adding XOR constraints to the SAT instance. The theorem states that each XOR constraint has a high probability of reducing the solution space by half, thus it can generate input patterns that distribute more evenly in the solution space.…”

Section: A Input Pattern Partitioningmentioning

confidence: 99%

See 2 more Smart Citations

Improving design verifiability by early RTL coverability analysis

Chang

Jiang

et al. 2012

Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMCODE2012)

View full text Add to dashboard Cite

Achieving high coverage is an important goal in design verification. Fixing coverability problems found at the verification stage, however, can require tremendous effort. To address this problem, we propose a flow for analyzing code and variable-toggle coverability at the early-RTL block-level stage. In addition, we devise a novel technique to analyze the coverability problems so that engineers can resolve the issues more efficiently. By identifying coverability problems at early RTL design stages, design verifiability can be improved, thus reducing the effort required at the verification phase.

show abstract

Section: Deriving Evenly-distributed Sat Solutionsmentioning

confidence: 99%

Section: Deriving Evenly-distributed Sat Solutionsmentioning

confidence: 99%

See 1 more Smart Citation

Improving design verifiability by early RTL coverability analysis

Chang

Jiang

et al. 2012

Tenth ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMCODE2012)

View full text Add to dashboard Cite

show abstract

“…In the verification and validation of large design components constraint-based random simulation remains an integral part. In [18] entropy metrics to define coverage targets of internal signals is combined with a framework which uses small randomized XOR constraints to generate stimuli for inadequately stimulated circuit regions. The authors in [19] present a methodology to analyze contradictory constraints that occur in constraint-based random simulation.…”

Section: Related Workmentioning

confidence: 99%

Constraint-based platform variants specification for early system verification

Burger

Viehl

Braun

et al. 2014

2014 19th Asia and South Pacific Design Automation Conference (ASP-DAC)

View full text Add to dashboard Cite

To overcome the verification gap arising from significantly increased external IP integration and reuse during electronic platform design and composition, we present a model-based approach to specify platform variants. The variants specification is processed automatically by formalizing and solving the integrated constraint sets to derive valid platforms. These constraint sets enable a precise specification of the required platform variants for verification, exploration and test. Experimental results demonstrate the applicability, versatility and scalability of our novel model-based approach.

show abstract

“…There exist several studies focusing on both pattern generation speed and distribution evenness [2][3][4][5][6][7][8][9][10][11][12][13][14].…”

Section: Introductionmentioning

confidence: 99%

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

Huang

2012

Proceedings of the International Conference on Computer-Aided Design

View full text Add to dashboard Cite

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.

show abstract

Random Stimulus Generation using Entropy and XOR Constraints

Abstract: Despite the growing research effort in formal verification, constraint-based

Cited by 12 publications

References 7 publications

Improving design verifiability by early RTL coverability analysis

Improving design verifiability by early RTL coverability analysis

Constraint-based platform variants specification for early system verification

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

Contact Info

Product

Resources

About