LibrEDA STA (Static Timing Analysis)

LibrEDA STA implements static timing analysis algorithms for the LibrEDA framework. All STA algorithms work on the NetlistBase trait and hence are portable to other netlist data structures.

The concept of timing, delays and constraints is abstracted by a set of traits. This architecture should allow to implement simple timing models such as the non-linear delay model (NDLM) and more complicated models (such as statistical models) in a consistent way.

Documentation

Documentation can be shown with:

carco doc --open

Or alternatively found here.

lib.rs:

== this crate is experimental and not stable for now ==

Incremental graph-based static timing analysis (STA) for the LibrEDA framework.

Timing analysis is performed on netlist data structures that implement the [trait@NetlistBase] trait. This makes the STA algorithm easily portable.

The concept of timing, delays and constraints is abstracted by a set of traits. This architecture should allow to implement simple timing models such as the non-linear delay model (NLDM) and more complicated models (such as statistical models) in a consistent way.