ACM Home Page
Please provide us with feedback. Feedback
Efficient validity checking for processor verification
Full text Publisher SitePublisher Site PdfPdf (88 KB)
Source International Conference on Computer Aided Design archive
Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design table of contents
San Jose, California, United States
Pages: 2 - 6  
Year of Publication: 1995
ISBN:0-8186-7213-7
Authors
Robert B. Jones  Computer Systems Laboratory, Stanford University, Stanford, CA
David L. Dill  Computer Systems Laboratory, Stanford University, Stanford, CA
Jerry R. Burch  Cadence Berkeley Laboratories, Berkeley, CA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
IEEE-CS : Computer Society
Publisher
IEEE Computer Society  Washington, DC, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 20,   Citation Count: 13
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  

ABSTRACT

We describe an efficient validity checker for the quantifier-free logic of equality with uninterpreted functions. This logic is well suited for verifying microprocessor control circuitry since it allows the abstraction of datapath values and operations. Our validity checker uses special data structures to speed up case splitting, and powerful heuristics to reduce the number of case splits needed. In addition, we present experimental results and show that this implementation has enabled the automatic verification of an actual high-level microprocessor description.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

BD94a
 
BD94b
 
Bea93
 
C+94
F. Corella et al. Multiway decision graphs for automated hardware verification. Unpublished manuscript, August 1994.
 
CLR90
 
Cyr93
D. Cyrluk. Microprocessor verification in PVS: A methodology and simple example. Technical Report SRI-CSL-93-12, SRI Computer Science Laboratory, December 1993.
 
HP90
K+94
 
LCDM89
E Lammens, L. Claesen, and H. De Man. Correctness verification of VLSI modules supported by a very efficient boolean prover. In Proceedings: IEEE International Conference on Computer Design, October 1989.
 
Nel81
G. Nelson. Techniques for program verification. Technical Report CSL-81-10, Xerox PARC, June 1981.
NO79
NO80
 
SB90
Sho79
 
SM95
M. Srivas and S. P. Miller. Applying formal verification to a commercial microprocessor. In Computer Hardware Description Languages, August 1995.
Tar75
 
Wil95
R. Wilson. Verification feels strain. Electronic Engineering Times, (840): 18-22, March 1995.
 
Win95

CITED BY  13
 
 
 
 
 

Collaborative Colleagues:
Robert B. Jones: colleagues
David L. Dill: colleagues
Jerry R. Burch: colleagues

Peer to Peer - Readers of this Article have also read: