ACM Home Page
Please provide us with feedback. Feedback
State reduction using reversible rules
Full text PdfPdf (123 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 33rd annual Design Automation Conference table of contents
Las Vegas, Nevada, United States
Pages: 564 - 567  
Year of Publication: 1996
ISBN:0-89791-779-0
Authors
C. Norris Ip  Department of Computer Science, Stanford University, Stanford, CA
David L. Dill  Department of Computer Science, Stanford University, Stanford, CA
Sponsors
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
EDAC : Electronic Design Automation Consortium
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 12,   Citation Count: 2
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/240518.240625
What is a DOI?

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.

 
1
J. Burch, E. Clarke, K. McMillan, D. Dill, and L. Hwang. Symbolic model checking: 102o states and beyond. 5th IEEE Symposium on Logic in Computer Science, 1990.
 
2
 
3
 
4
 
5
 
6
 
7
 
8
 
9
 
10
 
11
L. Lamport. What good is temporal logic. Information Processing 83, pages 657-668,1983.
 
12
 
13


Collaborative Colleagues:
C. Norris Ip: colleagues
David L. Dill: colleagues