ion Techniques for Validation Coverage Analysis and Test Generation 1 Dinos Moundanos Jacob A. Abraham Computer Engineering Research Center The University of Texas at Austin ENS 424 Austin, TX 78712… (More)
New approaches to address the diicult problems in test are necessary if its current status as a major bottleneck in the production of quality integrated circuits is to be changed. In this paper we… (More)
In this paper we introduce some new methods using which importance of a variable in a Boolean function can be computed. Such methods can easily be used for computing variable order to construct BDDs.… (More)
In this paper we introduce some new methods for constructing Ordered Partial Decision Diagrams (0P.DDs). The algorithms are effective in capturing a signi$cant fraction of a given function’s truth… (More)
Below you will find readings to be presented in class by the students. You must select a paper (or papers, if multiple ones are listed on the same line), then send an email to request it. If nobody… (More)
Only very small designs can be verified currently using property checking due to state-space explosion. Abstractions have been developed to simplify the design in an attempt to address this problem.… (More)
Despite great advances in Formal Veri cation (FV), simulation is still the primary means for design validation. The de nition of pragmatic measures for the coverage achieved and the problem of… (More)
In this paper we introduce some new methods for constructing Ordered Partial Decision Diagrams (OPDDs). The algorithms are eeective in capturing a signiicant fraction of a given function's truth… (More)
We discuss an open problem in construction of Reduced Ordered Binary Decision Diagrams (ROBDDs) using composition, and prove that the worst case complexity of the construction is truly cubic. With… (More)