DC FieldValueLanguage
dc.contributor.authorTibebu, Abraham Temesgen-
dc.contributor.authorFey, Görschwin-
dc.date.accessioned2019-05-06T13:03:44Z-
dc.date.available2019-05-06T13:03:44Z-
dc.date.issued2018-07-11-
dc.identifier.citationProceedings - 21st IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2018 : 117-122 (2018-07-11)de_DE
dc.identifier.isbn978-153865754-6de_DE
dc.identifier.urihttp://hdl.handle.net/11420/2629-
dc.description.abstractAll solutions SAT (All-SAT) is important in applications where we require enumerating all satisfying assignments of a propositional formula, e.g., when reasoning over many or all possible test patterns in Automatic Test Pattern Generation (ATPG). We applied structural analysis starting from primary inputs or primary outputs to generalize a current total assignment to a partial assignment. This speeds up the determination of all satisfying assignments. The experiments were conducted using a large number of random instances and different available All-SAT solvers. We show that structural analysis techniques can significantly speed up enumeration of all satisfying assignments of combinational circuits and yield the the second largest number of total satisfying assignments from all compared All-SAT solvers.en
dc.language.isoende_DE
dc.relation.ispartofProceedings - 21st IEEE International Symposium on Design and Diagnostics of Electronic Circuits and Systems, DDECS 2018de_DE
dc.titleAugmenting all solution SAT solving for circuits with structural informationde_DE
dc.typeinProceedingsde_DE
dc.identifier.urnurn:nbn:de:gbv:830-882.034349-
dc.type.dinicontributionToPeriodical-
dcterms.DCMITypeText-
tuhh.identifier.urnurn:nbn:de:gbv:830-882.034349-
tuhh.abstract.englishAll solutions SAT (All-SAT) is important in applications where we require enumerating all satisfying assignments of a propositional formula, e.g., when reasoning over many or all possible test patterns in Automatic Test Pattern Generation (ATPG). We applied structural analysis starting from primary inputs or primary outputs to generalize a current total assignment to a partial assignment. This speeds up the determination of all satisfying assignments. The experiments were conducted using a large number of random instances and different available All-SAT solvers. We show that structural analysis techniques can significantly speed up enumeration of all satisfying assignments of combinational circuits and yield the the second largest number of total satisfying assignments from all compared All-SAT solvers.de_DE
tuhh.publisher.doi10.1109/DDECS.2018.00028-
tuhh.publication.instituteEingebettete Systeme E-13de_DE
tuhh.type.opusInProceedings (Aufsatz / Paper einer Konferenz etc.)de
tuhh.institute.germanEingebettete Systeme E-13de
tuhh.institute.englishEingebettete Systeme E-13de_DE
tuhh.gvk.hasppnfalse-
dc.type.drivercontributionToPeriodical-
dc.type.casraiConference Paperen
tuhh.container.startpage117de_DE
tuhh.container.endpage122de_DE
item.fulltextNo Fulltext-
item.creatorOrcidTibebu, Abraham Temesgen-
item.creatorOrcidFey, Görschwin-
item.languageiso639-1other-
item.creatorGNDTibebu, Abraham Temesgen-
item.creatorGNDFey, Görschwin-
item.grantfulltextnone-
crisitem.author.deptEingebettete Systeme E-13-
crisitem.author.orcid0000-0001-6433-6265-
crisitem.author.parentorgStudiendekanat Elektrotechnik, Informatik und Mathematik-
Appears in Collections:Publications without fulltext
Show simple item record

Page view(s)

12
Last Week
1
Last month
checked on Jun 16, 2019

Google ScholarTM

Check

Export

Items in TORE are protected by copyright, with all rights reserved, unless otherwise indicated.