On Properties of SAT Instances Produced by SAT-Based ATPGs

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F09%3A00159044" target="_blank" >RIV/68407700:21230/09:00159044 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21240/09:00159044
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
On Properties of SAT Instances Produced by SAT-Based ATPGs
Original language description
In this paper we propose a study of properties of SAT (satisffability) instances produced by SAT-based Automatic Test Pattern Generators (ATPGs). Standard non-commercial SAT solvers are being widely used for the purpose of solving these instances.We showan analysis of properties of these special SAT instances. Even though these ATPG SAT instances have been thoroughly studied in the past, we show some newly found properties. Particularly, reasons why ATPG SAT instances are `easy to be solved' are shownby analysis of the SAT instances. Then, unexpected behavior of ATPG SAT instances, in terms of their satisfiffability, was observed. Next, we propose solution-preserving SAT transformations and study the properties of the reduced SAT instances.
Czech name
—
Czech description
—

Project
<a href="/en/project/GA102%2F09%2F1668" target="_blank" >GA102/09/1668: SoC circuits reliability and availability improvement</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2009
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection
Fifth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
978-80-87342-04-6
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
—
Publisher name
neuveden
Place of publication
Brno
Event location
Znojmo
Event date
Nov 13, 2009
Type of event by nationality
EUR - Evropská akce
UT code for WoS article
—

Similar results(10)