ACM Home Page
Please provide us with feedback. Feedback
On computing the transitive closure of a state transition relation
Full text PdfPdf (514 KB)
Source Annual ACM IEEE Design Automation Conference archive
Proceedings of the 30th international Design Automation Conference table of contents
Dallas, Texas, United States
Pages: 260 - 265  
Year of Publication: 1993
ISBN:0-89791-577-1
Authors
Sponsors
EDAC : Electronic Design Automation Consortium
IEEE-CAS : Circuits & Systems
SIGDA: ACM Special Interest Group on Design Automation
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 29,   Citation Count: 10
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/157485.164884
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
2
 
3
4
 
5
J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the International Symposium on Logic in Computer Science, 1990.
 
6
 
7
O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In IEEE International Conference on Computer-Aided Design, 1990.
 
8
K. Karplus. Representing boolean functions with ifthen-else DAGs. In Decennial CalTech VLSI Conference, 1989.

CITED BY  10

Collaborative Colleagues:
Yusuke Matsunaga: colleagues
Patrick C. McGeer: colleagues
Robert K. Brayton: colleagues