The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Fingerprint-based recognition relies on the matching of features derived from the ridges and valleys of the friction ridge surface. When a large quantity of good-quality features are available, identification can be made with a high level of confidence. When portions of the fingerprint image are of lower quality, accuracy will suffer in the feature extraction and subsequent matching steps. This study...
Scan-based DFT is the de-facto industrial practice for testing integrated circuits (ICs). Variations in the scan architecture to improve test metrics have been the primary focus in recent years. In this paper, we propose a new nonscan DFT in which a subset of the circuit flip-flops are made directly loadable from the primary inputs and another subset of flip-flops are made observable at the output...
Silicon Diagnosis is the process of locating potential defect sites (candidates) in a defective chip. These candidates are then used as an aid during physical failure analysis. It is desired that the cardinality of the candidate set returned by silicon diagnosis be as small as possible. To this end, effective test patterns that can distinguish many faults in the candidate set is critical. Generation...
High test data volume and long test application time are two major concerns for testing scan based circuits. The Illinois Scan (ILS) architecture has been shown to be effective in addressing both these issues. The ILS achieves a high degree of data compression thereby reducing both test data volume and test application time. However, the fault coverage achieved in the Broadcast Mode of the ILS architecture...
In this paper, a novel heuristic for abstraction-guided state justification is proposed based on ant colony optimization (ACO). A probabilistic state transition model is developed to help formulate the state justification problem as a searching scheme of artificial ants. The amount of pheromone left by the ants is directly proportional to the quality of the search so that it can serve as an effective...
In the Internet age, security is a major concern as identity thefts often cause detrimental effects. Masquerading is an important factor for identity theft and current authentication systems using traditional methods woefully lack mechanisms to detect and prevent it. This paper presents an application independent, continual, non-intrusive, fast and easily deployable user re-authentication system based...
We propose an inverted voltage scheme for exciting and pronouncing the behavior of any undesirable logic that may be inserted in the IC manufactured abroad. The inverted voltage scheme is coupled with a sustained vector simulation technique to further enhance the behavioral difference between the genuine and targeted test IC. Experimental results on a variety of ISCAS'89 benchmarks show that we are...
Phishing is an attempt to fraudulently acquire userspsila sensitive information, such as passwords or financial information, by masquerading as a trustworthy entity in online transactions. Recently, a number of researchers have proposed using external online resources like the Google Page Rank system to assist phishing detection. The advantage of such an approach is that the detection capability will...
Bit-precise verification with variables modeled as bitvectors has recently drawn much interest. However, a huge search space usually results after bit-blasting. To accelerate the verification of bit-vector formulae, we propose an efficient algorithm to discover non-uniform encoding widths. We of variables in the verification model, which may be smaller than their original modeling widths but sufficient...
Intentional tampering in the internal circuit structure by implanting Trojans can result in disastrous operational consequences. While a faulty manufacturing leads to a nonfunctional device, effect of an external implant can be far more detrimental. Therefore, effective detection and diagnosis of such maligned ICs in the post silicon testing phase is imperative, if the parts are intended to be used...
Abstraction-guided simulation is a promising semi-formal framework for design validation. Unlike previously proposed approaches that utilized potentially costly abstraction-refinement for altering the abstraction when encountering hard corner cases, in this paper, a novel and low-cost method is proposed. The search begins with an initial abstraction and dynamically switches guidance to a new, different...
We present a new approach to intelligently mine three types of invariants from a sequential circuit to significantly improve SAT-based state justification. We adaptively generate mining databases targeting on the hard-to-reach corner-case states, from which global invariants, target state related invariants, and observability-don't-care extended invariants are mined. Each mined invariant involves...
Adaptive micro-architectures aim to achieve greater energy efficiency by dynamically allocating computing resources to match the workload performance. The decisions of when to adapt (temporal dimension) and what to adapt (spatial dimension) are taken by a control algorithm based on an analysis of the power/performance tradeoffs in both dimensions. We perform a rigorous analysis to quantify the energy...
The increasing complexity and size of software designs has made scalability a major bottleneck in software verification. Program abstraction has shown potential in alleviating this problem through selective search space reduction. In this paper, we propose an Ant Colony Optimization (ACO)-directed program structure construction to formulate a novel under-approximation based program abstraction (UAPA)...
This paper presents a hybrid automatic test pattern generation (ATPG) technique using the staggered single-capture scheme followed by the one-hot single-capture scheme for detecting structural faults, which are neither timing-dependent nor sequence-dependent in a scan design. Structural faults are also called combinational faults or DC faults, such as stuck-at faults and bridging faults. Typically,...
Outsourcing of SoC fabrication units has created the potential threat of design tampering using hardware Trojans. Methods based on side-channel analysis exist to differentiate such maligned ICs from the genuine ones but process variation in the foundries limit the effectiveness of such approaches. In this work, we propose a circuit partition based approach to detect and locate the embedded Trojan...
As software security becomes increasingly crucial in modern software system, security-oriented software development will become a vital component towards a secure system. Therefore, how to effectively analyze and measure the software security vulnerability during the software development process emerges as an essential problem. In this paper, we propose a new security sensitivity metric for software...
Secure memory access protection plays a critical role in making software systems resilient to malicious security attacks. Run-time checking is one of the major strategies that provides safe memory accesses. However, in many security-critical applications, the performance overhead due to the extra computation at runtime is often unacceptable. In order to reduce this cost, we propose a new strategy...
In this paper, we propose a novel approximation algorithm (RelaxSAT) for MIN-ONE SAT. RelaxSAT generates a set of constraints from the objective function to guide the search. The constraints are gradually relaxed to eliminate the conflicts with the original Boolean SAT formula until a solution is found. The experiments demonstrate that RelaxSAT is able to handle very large instances which cannot be...
With the advance of SAT solvers, transforming a software program to a prepositional formula has generated much interest for bounded model checking of software in recent years. However, reasoning at the Boolean level often may not be able to identify some key relations among the original high-level program variables. In this paper, we propose a novel framework that uses simulation-directed data mining...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.