Journal Article10.1109/TCAD.2013.2292501
Latency Analysis for Sequential Circuits
Alexander Finder,André Sülflow,Görschwin Fey +2 more
- 23 May 2011
- Vol. 33, Iss: 4, pp 129-134
TL;DR: A minimal and maximal latency measure for sequential circuits is proposed that explains how long a circuit's state and outputs depend on input stimuli and how this provides insight into the behavior of circuit designs.
read more
Abstract: Verifying correctness is a major bottleneck in today's circuit and system design. Verification includes the tasks of error detection, error localization, and error correction in an implemented design, as well as the analysis and avoidance of transient faults. For all those tasks, knowing when an assignment to signals becomes observable at the outputs and for how long it influences the system is important. In this letter, we propose a minimal and maximal latency measure for sequential circuits. This measure explains how long a circuit's state and outputs depend on input stimuli. Exact and heuristic algorithms are discussed to determine the measure. We evaluate the algorithms on state-of-the-art designs. Experimental results show how the measure provides insight into the behavior of circuit designs.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
Interpolation and SAT-based model checking
TL;DR: In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
775
Determining Application-Specific Knowledge for Improving Robustness of Sequential Circuits
TL;DR: This paper proposes an alternative method, which overcomes drawbacks by determining application-specific knowledge of the circuit, namely the relations of flip-flops and when they assume the same value, and is automatically applicable to arbitrary circuits.
12
Quality Assessment of RFET-based Logic Locking Protection Mechanisms using Formal Methods
Marcel Merten,Sebastian Huhn,Rolf Drechsler +2 more
- 23 May 2022
TL;DR: This work proposes a novel method to assess the quality of the RFET-based logic locking structures for sequential circuits and validates that the proposed scheme unveils weaknesses of the protection structure, which remain undetected when using existing techniques.
5
SAT-based Key Determination Attack for Improving the Quality Assessment of Logic Locking Mechanisms
TL;DR: A novel approach on determining the most intimidating incorrect keys for improving the assessment quality of arbitrary logic locking mechanisms and proves that the proposed key determination procedure unveils weaknesses of the protection mechanism that remain undetected when using existing techniques and, hence, clearly outperforms any other existing key determination procedures.
2
References
Symbolic Model Checking without BDDs
Armin Biere,Alessandro Cimatti,Edmund M. Clarke,Yunshan Zhu +3 more
- 22 Mar 1999
TL;DR: This paper shows how boolean decision procedures, like Stalmarck's Method or the Davis & Putnam Procedure, can replace BDDs, and introduces a bounded model checking procedure for LTL which reduces model checking to propositional satisfiability.
Interpolation and SAT-Based Model Checking
Kenneth L. McMillan
- 08 Jul 2003
TL;DR: In this article, a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants was proposed, which is greatly more efficient than BDD-based symbolic model-checking.
A systematic methodology to compute the architectural vulnerability factors for a high-performance microprocessor
Shubhendu S. Mukherjee,Christopher T. Weaver,Joel Emer,Steven K. Reinhardt,Todd Austin +4 more
- 03 Dec 2003
TL;DR: This paper identifies numerous cases, such as prefetches, dynamicallydead code, and wrong-path instructions, in which a fault will not affect correct execution, and shows AVFs of 28% and 9% for the instruction queue and execution units, respectively,averaged across dynamic sections of the entire CPU2000benchmark suite.
•Journal Article
Interpolation and SAT-based model checking
TL;DR: In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
775
Fault localization with nearest neighbor queries
M. Renieres,Steven P. Reiss +1 more
- 06 Oct 2003
TL;DR: A method for performing fault localization using similar program spectra and a generic method for establishing the quality of a report, based on the way an "ideal user" would navigate the program using the report to save effort during debugging.
762