Formal Verification of Completion-Completeness for NCL Circuits

Son N. Le, Sudarshan K. Srinivasan, Scott C. Smith · 2020

Ensuring completion-completeness is required for delay-insensitivity when utilizing bit-wise completion to pipeline NCL circuits comprised of input-incomplete logic functions. Hence, this work presents an automated formal method to detect NCL circuits that are not completion-complete.

Read the paper · More papers on PaperTik