Application of Formal Word-Level Analysis to Constrained Random Simulation

Authors:
Hyondeuk Kim;Hoonsang Jin;Kavita Ravi;Petr Spacek;John Pierce;Bob Kurshan;Fabio Somenzi
Affiliations:
University of Colorado at Boulder, and Cadence Design Systems,;Cadence Design Systems,;Cadence Design Systems,;Cadence Design Systems,;Cadence Design Systems,;Cadence Design Systems,;University of Colorado at Boulder,
Venue:
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Year:
2008

Citing 3
Cited 5

Modeling design constraints and biasing in simulation using BDDs

ICCAD '99 Proceedings of the 1999 IEEE/ACM international conference on Computer-aided design
Finite Instantiations for Integer Difference Logic

FMCAD '06 Proceedings of the Formal Methods in Computer Aided Design
Stimulus generation for constrained random simulation

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design

A Markov Chain Monte Carlo Sampler for Mixed Boolean/Integer Constraints

CAV '09 Proceedings of the 21st International Conference on Computer Aided Verification
Efficient Term-ITE Conversion for Satisfiability Modulo Theories

SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Toward an extremely-high-throughput and even-distribution pattern generator for the constrained random simulation techniques

Proceedings of the International Conference on Computer-Aided Design
The system verification methodology for advanced TLM verification

Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
A robust general constrained random pattern generator for constraints with variable ordering

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Constrained random simulation is supported by constraint solvers integrated within simulators. These constraint solvers need to be fast and memory efficient to maintain simulation performance. Binary Decision Diagrams (BDDs) have been successfully applied to represent constraints in this context. However, BDDs are vulnerable to size explosions depending on the constraints they are representing and the number of Boolean variables appearing in them. In this paper, we present a word-level analysis tool DomRedto reduce the number of Boolean variables required to represent constraints by reducing the domain of constraint variables. DomRedemploys static analysis techniques to obtain these reductions. We present experimental results to illustrate the impact of this tool.