SAT solvers application of deriving all test pairs detecting robust testable PDFs

Эндаумент фонд ТГУ!
Впиши своё имя в историю университета
- Сделать пожертвование -

Add to "Quick Collection"

Description	Size	Format
SAT solvers application of deriving all test pairs detecting robust testable PDFs	499 KB	Adobe Acrobat PDF	Read	Download
DOI Доступ к ресурсу на сайте издателя			10.1109/EWDTS52692.2021.9581004

Title: SAT solvers application of deriving all test pairs detecting robust testable PDFs
Creator: Matrosova, Anzhela Yu.
|
Andreeva, V. V.
|
Tychinskiy, V. Z.
Date: 2021
DOI: 10.1109/EWDTS52692.2021.9581004
Description: It is known that if we have set of test pairs of neighbor Boolean vectors for robust testable PDF for each path considered in the given circuit, we may derive test sequence for these faults consisting of fragments that are characterized by minimal length and minimal power consumption. Conventionally they try to find at least one test pair. It is possible to find all test pairs using operations on ROBDDs. In the frame of SAT technology it is possible to find products presenting test pairs one by one. It seemed that having got several products presenting test pairs we may derive rather high quality test sequence for the given set of circuit paths. New approach to deriving test pairs in the frame of SAT technology is suggested. The approach is based on deriving the combinational circuit that represents all test pairs. This circuit is constructed from the given combinational circuit and the chosen circuit path. The complexity of the obtained circuit practically coincides with the complexity of the given combinational circuit. Using this circuit we may obtain products representing test pairs one by one.

Relationships: Show Relationship Browser for this Object
collection(s): Институт прикладной математики и компьютерных наук (c 01.09.2017 г.)
Identifier: смотреть в электронном каталоге НБ ТГУ
Type: статьи в сборниках
Source: 2021 IEEE East-West Design & Test Symposium (EWDTS), Batumi, Georgia, September 10-13, 2021 : proceedings. [S. l.], 2021. P. 252-255
Language: eng

Created: 05-04-2022

926 Visitors

759 Hits

189 Downloads