Techniques for SAT-based constrained test pattern generation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SAT-based Automatic Test Pattern Generation

Due to the rapidly growing size of integrated circuits, there is a need for new algorithms for Automatic Test Pattern Generation (ATPG). While classical algorithms reach their limit, there have been recent advances in algorithms to solve Boolean Satisfiability (SAT). Because Boolean SAT solvers are working on Conjunctive Normal Forms (CNF), the problem has to be transformed. During transformati...

متن کامل

Pattern-Constrained Test Case Generation

In this paper we present a novel approach for patternconstrained test case generation. The generation of test cases with known characteristics is usually a non-trivial task. In contrast, the proposed method allows for a transparent and intuitive modeling of the relations contained in the test data. For the presented approach, we utilize a general-purpose data generator: It relies on easy to und...

متن کامل

New Techniques for Deterministic Test Pattern Generation

This paper presents new techniques for speeding up deterministic test pattern generation for VLSI circuits. These techniques improve the PODEM algorithm by reducing number of back-tracks with a low computational cost. This is achieved by nding more necessary signal line assignments, by detecting connicts earlier, and by avoiding unnecessary work during test generation. We have incorporated thes...

متن کامل

Implicit Test Pattern Generation Constrained to

This paper presents an implicit methodology that constrains a test pattern generator to identify test sequences which can be reproduced by cellular automata (CA). The so identiied CA can be synthesized as an autonomous-nite state machine and can be attached to the inputs of a circuit under test (e.g., a controller). In this way, the circuit under test preserves its integrity and its performance...

متن کامل

SAT Based Automated Test Case Generation For MUMCUT Coverage

MUMCUT is a criterion for testing Boolean specifications. The traditional test case generation methods for this problem are based on approximate approaches. The efficiency of these algorithms depend on the designers’ experience on this coverage. In this paper, the authors apply SAT based method to solve this problem. Two SAT solvers, walksat and zChaff, are employed to generate approximate and ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Microprocessors and Microsystems

سال: 2013

ISSN: 0141-9331

DOI: 10.1016/j.micpro.2012.09.010