Verification of asynchronous interface circuits with bounded wire delays
Pages 188 - 195
References
[1]
M. C. Browne, E. M. Clarke, and D. L. Dill. Automatic Circuit Verification Using Temporal Logic: Two new examples. In Proceedings of Int'l Conference on Computer Design: VLSI in Computers, October 1985.
[2]
R. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. In IEEE Transactions on Computers, volume C-35, pages 677-691, August 1986.
[3]
J. Burch. Delay Models for Verifying Speed Dependent Asynchronous Circuits. In Proceedings, Tau 92:1992 A CM Workshop on Timing Issues in the Specification and Synthesis of Digital Systems, March 1992.
[4]
O. Coudert, C. Berthet, and J. C. Madre. Verification of Sequential Machines Using Boolean Functional Vectors. In IMEC-IFIP Int'i Workshop on Applied Formal Methods for Correct VLSI Design, pages 111-128, November 1989.
[5]
S. Devadas, K. Keutzer, S. Malik, and A. Wang. Event Suppression: Improving the Efficiency of Timing Simulation for Synchronous Digital Circuits. In Proceedings of the Brown/MIT Advanced Research in VLSI and Parallel Systems, pages 195-209, March 1992.
[6]
S. Devadas, K. Keutzer, S. Malik, and A. Wang. Verification of Asynchronous Circuits with Bounded Wire Delays. In Massachusetts Institute of Technology Technical Report, March 1992.
[7]
S. Devadas, H-K. T. Ma, and A. R. Newton. On the Verification of Sequential Machines at Differing Levels of Abstraction. In IEEE Transactions on Computer-Aided Design, pages 713-722, June 1988. Correction in May 1989.
[8]
D. L. Dill. Trace Theory for the Automatic Hierarchical Verification of Speed-Independent Circuits. MIT Press, 1987.
[9]
D. L. Dill. Timing Assumptions and Verification of Finite-State Concurrent Systems. In Proceedings of the Workshop on Automatic Verification Methods for Finite State Systems, Volume 407 of Lecture Notes in Computer Science, June 1989.
[10]
A. D. Friedman and P. R. Menon. Theory and Design of Switching Circuits. Computer Science Press, 1975.
[11]
A. Ghosh, S. Devadas, and A. R. Newton. Verification of Interacting Sequential Circuits. In Proceedings of the 27th Design Automation Conference, pages 213-219, June 1990.
[12]
N. Ishiura, Y. Deguchi, and S. Yajima. Coded Time-Symbolic Simulation using Shared Binary Decision Diagrams. In Proceedings of the 27th Design Automation Conference, pages 130-135, June 1990.
[13]
N. Ishiura, M. Takahashi, and S. Yajima. Time- Symbolic Simulation for Accurate Timing Verification. In Proceedings of the 26~h Design Automation Conference, pages 497-502, June 1989.
[14]
L. Lavagno, K. Keutzer, and A. Sangiovanni- Vincentelli. Algorithms for synthesis of hazardfree asynchronous circuits. In Proceedings of lhe Design Automation Conference, June 1991.
[15]
S. H. Unger. Asynchronous Sequenlial Switching Circuits. Wiley Interscience, 1969.
Index Terms
- Verification of asynchronous interface circuits with bounded wire delays
Recommendations
Verification of asynchronous interface circuits with bounded wire delays
Special issue: asynchronous circuit design for VLSI signal processingWe address the problem of verifying that the gate-level implementation of an asynchronous circuit, with given or extracted bounds on wire and gate delays, is equivalent to a specification of the asynchronous circuit behavior described as a classical ...
Verification of Asynchronous Circuits with Bounded Inertial Gate Delays
ATS '98: Proceedings of the 7th Asian Test SymposiumVerifying the correctness of asynchronous circuits is one of the most important task in asynchronous design. However, the absence of the global clock and the variation of gate delays in asynchronous circuits makes the verification a formidable task. In ...
Design of Asynchronous Circuits Assuming Unbounded Gate Delays
This paper considers the general problem of the synthesis of asynchronous combinational and sequential circuits based on the assumption that gate delays may be unbounded and that line delays are suitably constrained. Certain problems inherent to circuit ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
Sponsors
- SIGDA: ACM Special Interest Group on Design Automation
- IEEE-CAS: Circuits & Systems
- IEEE-CS: Computer Society
Publisher
IEEE Computer Society Press
Washington, DC, United States
Publication History
Published: 08 November 1992
Check for updates
Qualifiers
- Article
Acceptance Rates
Overall Acceptance Rate 457 of 1,762 submissions, 26%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 213Total Downloads
- Downloads (Last 12 months)37
- Downloads (Last 6 weeks)7
Reflects downloads up to 18 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in