Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Formal equivalence checking
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Equivalence checking and levels of abstraction == In general, there is a wide range of possible definitions of functional equivalence covering comparisons between different levels of abstraction and varying granularity of timing details. *The most common approach is to consider the problem of machine equivalence which defines two [[Synchronous circuit|synchronous design]] specifications functionally equivalent if, clock by clock, they produce ''exactly'' the same sequence of output signals for ''any'' valid sequence of input signals. *[[Microprocessor]] designers use equivalence checking to compare the functions specified for the [[instruction set]] architecture (ISA) with a [[register transfer level]] (RTL) implementation, ensuring that any program executed on both models will cause an identical update of the main memory content. This is a more general problem. *A system design flow requires comparison between a transaction level model (TLM), e.g., written in [[SystemC]] and its corresponding RTL specification. Such a check is becoming of increasing interest in a system-on-a-chip (SoC) design environment.
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)