Verification of timing constraints on large digital systems
Conference
·
OSTI ID:6496513
A new approach to the verification of the timing constraints on large digital systems has been developed. The associated algorithm is computationally very efficient, and provides early and continuous feedback about the timing aspects of synchronous sequential circuits as they are designed. It also provides means for conveniently verifying the design in sections, permitting the section-by-section timing verification of designs which are too large to examine as a unit on existing computer systems. A system using this algorithm has been implemented, and has been used to verify the timing constraints on the design of the S-1 Mark IIA processor.
- Research Organization:
- California Univ., Livermore (USA). Lawrence Livermore Lab.
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 6496513
- Report Number(s):
- UCRL-83791(Rev.1); CONF-800622-2(Rev.1)
- Resource Relation:
- Conference: 17. design automation conference, Minneapolis, MN, USA, 23 Jun 1980
- Country of Publication:
- United States
- Language:
- English
Similar Records
Verification of timing constraints on large digital systems
Verification of timing constraints in large digital systems
Static scheduling of synchronous data flow programs for digital signal processing
Technical Report
·
Thu May 01 00:00:00 EDT 1980
·
OSTI ID:6496513
Verification of timing constraints in large digital systems
Conference
·
Sat Dec 01 00:00:00 EST 1979
·
OSTI ID:6496513
Static scheduling of synchronous data flow programs for digital signal processing
Journal Article
·
Thu Jan 01 00:00:00 EST 1987
· IEEE Trans. Comput.; (United States)
·
OSTI ID:6496513