Path verification using Boolean satisfiability

The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circ...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Hauptverfasser:	Ringe, M., Lindenkreuz, T., Barke, E.
Format:	Tagungsbericht
Sprache:	eng
Schlagworte:	Computer systems organization > Dependable and fault-tolerant systems and networks General and reference > Cross-computing tools and techniques > Performance Hardware > Emerging technologies Hardware > Integrated circuits > Logic circuits > Combinational circuits Hardware > Robustness Hardware > Very large scale integration design Mathematics of computing > Discrete mathematics Networks > Network performance evaluation Theory of computation > Design and analysis of algorithms
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Beschreibung
Zusammenfassung:	The importance of identifying false paths in a combinational circuit cannot be overstated since they may mask the true delay. We present a fast algorithm based on boolean satisfiability for solving this problem. We also present extensions to this per-path approach to find the critical path of a circuit in a reasonable time.
DOI:	10.5555/368058.368544