A Faster Counterexample Minimization Algorithm Based on Refutation Analysis

It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimization algorithm compared to all other approaches. But its time overhead is very large due to one call to SAT solver for...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Design, Automation and Test in Europe s. 672 - 677
Hlavní autori: Shen, ShengYu, Qin, Ying, Li, SiKun
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: Washington, DC, USA IEEE Computer Society 07.03.2005
IEEE
Edícia:ACM Conferences
Predmet:
Algorithm design and analysis
Computer science
Computing methodologies > Modeling and simulation > Model development and analysis
Computing methodologies > Modeling and simulation > Model development and analysis > Model verification and validation
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms
Computing methodologies > Symbolic and algebraic manipulation > Symbolic and algebraic algorithms > Algebraic algorithms
Data mining
Design automation
Hardware
Minimization methods
Performance analysis
Production systems
Software systems
Sufficient conditions
Theory of computation > Design and analysis of algorithms
Theory of computation > Logic
ISBN:9780769522883, 0769522882
ISSN:1530-1591
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimization algorithm compared to all other approaches. But its time overhead is very large due to one call to SAT solver for each candidate variable to be eliminated. The key to reduce time overhead is to eliminate multiple variables simultaneously. Therefore, we propose a faster counterexample minimization algorithm based on refutation analysis in this paper. We perform refutation analysis on those UNSAT instances of BFL, to extract the set of variables that lead to UNSAT. All variables not belong to this set can be eliminated simultaneously as irrelevant variables. Thus we can eliminate multiple variables with only one call to SAT solver. Theoretical analysis and experiment result shows that, our algorithm can be 2 to 3 orders of magnitude faster than existing BFL algorithm, and with only minor lost in counterexample minimization ability.
AbstractList It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective counterexample minimization algorithm compared to all other approaches. But its time overhead is very large due to one call to SAT solver for each candidate variable to be eliminated. The key to reduce time overhead is to eliminate multiple variables simultaneously. Therefore, we propose a faster counterexample minimization algorithm based on refutation analysis in this paper. We perform refutation analysis on those UNSAT instances of BFL, to extract the set of variables that lead to UNSAT. All variables not belong to this set can be eliminated simultaneously as irrelevant variables. Thus we can eliminate multiple variables with only one call to SAT solver. Theoretical analysis and experiment result shows that, our algorithm can be 2 to 3 orders of magnitude faster than existing BFL algorithm, and with only minor lost in counterexample minimization ability.
A hot research topic is the elimination of irrelevant variables from a counterexample, to make it more easily understood. The BFL (brute force lifting) algorithm is the most effective counterexample minimization algorithm compared to all other approaches. But its time overhead is very large due to one call to the SAT (satisfiability) solver for each candidate variable to be eliminated. The key to reducing time overhead is to eliminate multiple variables simultaneously. Therefore, we propose a faster counterexample minimization algorithm based on refutation analysis. We perform refutation analysis on those UNSAT instances of BFL, to extract the set of variables that lead to UNSAT. All variables not belonging to this set can be eliminated simultaneously as irrelevant variables. Thus we can eliminate multiple variables with only one call to the SAT solver. Theoretical analysis and experimental results show that our algorithm can be 2 to 3 orders of magnitude faster than the existing BFL algorithm, and with only minor loss in counterexample minimization ability.
Author Qin, Ying
Li, SiKun
Shen, ShengYu
Author_xml – sequence: 1
  givenname: ShengYu
  surname: Shen
  fullname: Shen, ShengYu
  organization: National University of Defence Technology
– sequence: 2
  givenname: Ying
  surname: Qin
  fullname: Qin, Ying
  organization: National University of Defence Technology
– sequence: 3
  givenname: SiKun
  surname: Li
  fullname: Li, SiKun
  organization: National University of Defence Technology
BookMark eNqNkD1PwzAURS1RJErpxsaSBRaU4o84scdSWkAUIaEyW7b7DIYkLnEiUX49qdofwFuu9M7RHe4pGtShBoTOCZ4QguXN3XQ1n1CM-YRkR2gsC4GLXHJKhWADNCSc4ZRwSU7QOMZP3B-TGcmLIXqaJgsdW2iSWejqPuFHV5sSkmdf-8r_6taHOpmW76Hx7UeV3OoI66R_vYLr2gOtdbmNPp6hY6fLCONDjtDbYr6aPaTLl_vH2XSZakZwm1pbaC4cZExQBgV3TmSYWSKcpjjn3JqcutwIaxh10hgrGKXAhCnEmmts2Ahd7Xs3TfjuILaq8tFCWeoaQhcVI0TITLJevNiLHgDUpvGVbraKMMlzTnt6vafaVsqE8BUVwWq3p9rtqXZ7KpIp03hwvX35H5v9AXSkdQE
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
7SC
8FD
JQ2
L7M
L~C
L~D
DOI 10.1109/DATE.2005.14
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP All) 1998-Present
Computer and Information Systems Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle Computer and Information Systems Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Advanced Technologies Database with Aerospace
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 677
ExternalDocumentID 1395652
Genre orig-research
Conference Paper
GroupedDBID 6IE
6IF
6IK
6IL
6IN
AAJGR
AARBI
ACM
ADPZR
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
GUFHI
OCL
RIB
RIC
RIE
RIL
123
29F
29O
6IH
AAWTH
ABLEC
ADZIZ
CHZPO
FEDTE
IEGSK
IPLJI
KZ1
LMP
M43
RNS
7SC
8FD
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-a310t-cc7a58fe43823e75ff8403c18fa20655cb62f6b8cb32f9bbc8322e38b78d5a0b3
IEDL.DBID RIE
ISBN 9780769522883
0769522882
ISICitedReferencesCount 6
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000228086900130&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1530-1591
IngestDate Fri Jul 11 16:13:21 EDT 2025
Wed Aug 27 02:14:01 EDT 2025
Wed Jan 31 06:46:56 EST 2024
IsDoiOpenAccess false
IsOpenAccess true
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MeetingName DATE05: Design, Automation and Test in Europe
MergedId FETCHMERGED-LOGICAL-a310t-cc7a58fe43823e75ff8403c18fa20655cb62f6b8cb32f9bbc8322e38b78d5a0b3
Notes SourceType-Conference Papers & Proceedings-1
ObjectType-Conference Paper-1
content type line 25
OpenAccessLink https://hal.archives-ouvertes.fr/hal-00181185
PQID 31189493
PQPubID 23500
PageCount 6
ParticipantIDs acm_books_10_1109_DATE_2005_14_brief
proquest_miscellaneous_31189493
acm_books_10_1109_DATE_2005_14
ieee_primary_1395652
PublicationCentury 2000
PublicationDate 20050307
20050000
PublicationDateYYYYMMDD 2005-03-07
2005-01-01
PublicationDate_xml – month: 03
  year: 2005
  text: 20050307
  day: 07
PublicationDecade 2000
PublicationPlace Washington, DC, USA
PublicationPlace_xml – name: Washington, DC, USA
PublicationSeriesTitle ACM Conferences
PublicationTitle Design, Automation and Test in Europe
PublicationTitleAbbrev DATE
PublicationYear 2005
Publisher IEEE Computer Society
IEEE
Publisher_xml – name: IEEE Computer Society
– name: IEEE
SSID ssj0000394167
ssj0005329
Score 1.6195914
Snippet It is a hot research topic to eliminate irrelevant variables from counterexample, to make it easier to be understood. The BFL algorithm is the most effective...
A hot research topic is the elimination of irrelevant variables from a counterexample, to make it more easily understood. The BFL (brute force lifting)...
SourceID proquest
ieee
acm
SourceType Aggregation Database
Publisher
StartPage 672
SubjectTerms Algorithm design and analysis
Computer science
Computing methodologies -- Modeling and simulation -- Model development and analysis
Computing methodologies -- Modeling and simulation -- Model development and analysis -- Model verification and validation
Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms
Computing methodologies -- Symbolic and algebraic manipulation -- Symbolic and algebraic algorithms -- Algebraic algorithms
Data mining
Design automation
Hardware
Minimization methods
Performance analysis
Production systems
Software systems
Sufficient conditions
Theory of computation -- Design and analysis of algorithms
Theory of computation -- Logic
Title A Faster Counterexample Minimization Algorithm Based on Refutation Analysis
URI https://ieeexplore.ieee.org/document/1395652
https://www.proquest.com/docview/31189493
WOSCitedRecordID wos000228086900130&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5UPOhFrRXrMwePrk2bzWZzFB8IivSg4G1JshMt2FbarfjznaTbKiiCt30Tkk3m-yYz3wCc8MwKmXqTSMxEkvpSJEaWmGTSER_KecYxSubfqfv7_OlJ95bgdJELg4gx-AzPwmHcyy9HbhpcZW1CK4Q_aMFdVkrNcrUW_hQudBqTuufhHSJWKKMJzRMy2Z0ZZdcENwhT1so783OxiIjX7cvzh6uZqyUk9iwbN6jrrvxYrKMFut74X9s3ofmVysd6CyO1BUs4bMDGvJYDq6d2A9a_CRNuw-058yZIKLBYS4K-82GCjDALSiSDOnWTmdfn0bhfvQxYsIUlo0tkb6dVfbeWO2nC4_XVw8VNUpddSAxhvSpxThmZe4xbhKik90QChevk3nQJsEhns67PbO6s6HptrQuLAorcqryUhluxAyvD0RB3gZXeovRcEYwRqZFo0tLnmtuO6ninlWvBEXVwEfjEpIh0hOsijECojimJlrTg5O8HCjvuo2_Bdujx4m2m0FHUnd2C4_mQFTRrwlaIGeJoOikE8SqdarH3-4v7sBYlWqOr5QBWqvEUD2HVvVf9yfgo_nif42vQDg
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTxsxEB2lAalw4bMi0AYfOHaLN17vro-oBVERIg6pxM2yveM2UpNUyQbx8xk7m4BUhMRtv2XZa89745k3AGc8t0Jm3iQSc5FkvhKJkRUmuXTEh0qec4yS-f1iMCjv79VdC76uc2EQMQaf4bdwGPfyq6lbBFfZOaEVwh-04G7ILOuly2yttUeFC5XFtO5VgIeINcpoSvOEjHa6JO2KAAehykZ7Z3Uu1jHx6vzHxfBy6WwJqT0fjBs3lVf-W66jDbraeV_rd-HwOZmP3a3N1B60cLIPO6tqDqyZ3Puw_UKa8ABuLpg3QUSBxWoS9J1HE4SEWdAiGTfJm8z8_T2djeo_YxasYcXoElncRd3cbQRPDuHX1eXw-3XSFF5IDKG9OnGuMLL0GDcJsZDeEw0ULi296RFkkc7mPZ_b0lnR88paF5YFFKUtykoabsUnaE-mEzwCVnmL0vOCgIzIjESTVb5U3KZF6p0qXAe61ME6MIq5joSEKx1GINTHlERMOnD29gPazkboO3AQelz_W2p06KazO3C6GjJN8yZshpgJThdzLYhZqUyJ49dfPIWP18Pbvu7_HNycwFYUbI2Ol8_QrmcL_AKb7qEezWfd-BM-AeS501U
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Design%2C+Automation%2C+and+Test+in+Europe%3A+Proceedings+of+the+conference+on+Design%2C+Automation+and+Test+in+Europe+-+Volume+2%3B+07-11+Mar.+2005&rft.atitle=A+Faster+Counterexample+Minimization+Algorithm+Based+on+Refutation+Analysis&rft.au=Shen%2C+Shengyu&rft.au=Qin%2C+Ying&rft.au=Li%2C+Sikun&rft.date=2005-03-07&rft.isbn=9780769522883&rft.issn=1530-1591&rft.spage=672&rft.epage=677&rft_id=info:doi/10.1109%2FDATE.2005.14&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-1591&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-1591&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-1591&client=summon