Communications of the ACM
On the learnability of Boolean formulae
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
Universal approximation using radial-basis-function networks
Neural Computation
Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
Constant depth circuits, Fourier transform, and learnability
Journal of the ACM (JACM)
An introduction to computational learning theory
An introduction to computational learning theory
Test program generation for functional verification of PowerPC processors in IBM
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Implementation Issues in the Fourier Transform Algorithm
Machine Learning
A scalable software-based self-test methodology for programmable processors
Proceedings of the 40th annual Design Automation Conference
On A Software-Based Self-Test Methodology and Its Application
VTS '05 Proceedings of the 23rd IEEE Symposium on VLSI Test
Simulation-Based Functional Test Generation for Embedded Processors
IEEE Transactions on Computers
Data mining in design and test processes: basic principles and promises
Proceedings of the 2013 ACM international symposium on International symposium on physical design
Hi-index | 0.00 |
This paper presents a simulation-based methodology for extracting a simplified view of design functionality from a given module. Such a simplified design view can be used to facilitate test pattern justification from the outputs of the module to the inputs of the module. In this work, we formulate this type of design simplification as a learning problem. By developing a scheme for learning word-level functions, we point out that the core of the problem is to develop an efficient Boolean learner. We discuss the implementation of such a Boolean learner and compare its performance with the one of best-known learning algorithms, the Fourier analysis based method. Experimental results are presented to illustrate the implementation of the simulation-based methodology and its usage for extracting a simplified view of Open RISC 1200 datapath.