PolyCleaner: Clean your Polynomials before Backward Rewriting to verify Million-gate Multipliers

Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized and structurally complex. Therefore, the existing formal verification techniques fail to verify them. In recent years, formal multiplier verif...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) s. 1 - 8
Hlavní autori: Mahzoon, Alireza, Grosse, Daniel, Drechsler, Rolf
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: ACM 01.11.2018
Predmet:
ISSN:1558-2434
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized and structurally complex. Therefore, the existing formal verification techniques fail to verify them. In recent years, formal multiplier verification based on Symbolic Computer Algebra (SCA) has shown superior results in comparison to all other existing proof techniques. However, for non-trivial architectures still a monomial explosion can be observed. A common understanding is that this is caused by redundant monomials also known as vanishing monomials. While several approaches have been proposed to overcome the explosion, the problem itself is still not fully understood. In this paper we present a new theory for the origin of vanishing monomials and how they can be handled to prevent the explosion during backward rewriting. We implement our new approach as the SCA-verifier PolyCleaner. The experimental results show the efficiency of our proposed method in verification of non-trivial million-gate multipliers.
AbstractList Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized and structurally complex. Therefore, the existing formal verification techniques fail to verify them. In recent years, formal multiplier verification based on Symbolic Computer Algebra (SCA) has shown superior results in comparison to all other existing proof techniques. However, for non-trivial architectures still a monomial explosion can be observed. A common understanding is that this is caused by redundant monomials also known as vanishing monomials. While several approaches have been proposed to overcome the explosion, the problem itself is still not fully understood. In this paper we present a new theory for the origin of vanishing monomials and how they can be handled to prevent the explosion during backward rewriting. We implement our new approach as the SCA-verifier PolyCleaner. The experimental results show the efficiency of our proposed method in verification of non-trivial million-gate multipliers.
Author Mahzoon, Alireza
Grosse, Daniel
Drechsler, Rolf
Author_xml – sequence: 1
  givenname: Alireza
  surname: Mahzoon
  fullname: Mahzoon, Alireza
  organization: Institute of Computer Science, University of Bremen, Germany
– sequence: 2
  givenname: Daniel
  surname: Grosse
  fullname: Grosse, Daniel
  organization: Institute of Computer Science, University of Bremen, Germany
– sequence: 3
  givenname: Rolf
  surname: Drechsler
  fullname: Drechsler, Rolf
  organization: Institute of Computer Science, University of Bremen, Germany
BookMark eNotjMtOwzAURA0CibZ0zYKNfyDFju1clx1UvKRWIATrcuPeVAY3rpyUKn9PCqzOaGZ0huykjjUxdiHFREptrlSuBRRmcqBVcMSGfSuUmRoBx2wgjbFZrpU-Y-Om-RRC5BZkPw_Yx0sM3SwQ1pSu-W_gXdwlfujruPEYGl5SFRPxW3Rfe0wr_kr75Ftfr3kb-TclX3V84UPwsc7W2BJf7ELrt8FTas7ZadU7aPzPEXu_v3ubPWbz54en2c08w1xDmynrBDqLUjtpqYSiAgM4tc6KEklVIMocrSNVGlw56O9lBavCCXJIUyrUiF3-eT0RLbfJbzB1S2ssgNbqByUCWDc
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/3240765.3240837
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EISBN 1450359507
9781450359504
EISSN 1558-2434
EndPage 8
ExternalDocumentID 8587744
Genre orig-research
GroupedDBID 123
6IE
6IF
6IH
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-a247t-38c0ac8a14c18eb76f757a98c80bae3f70b2a8ce3b5adc738cbf7d6c0ecae9e63
IEDL.DBID RIE
ISICitedReferencesCount 38
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000494640800127&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:56:50 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a247t-38c0ac8a14c18eb76f757a98c80bae3f70b2a8ce3b5adc738cbf7d6c0ecae9e63
PageCount 8
ParticipantIDs ieee_primary_8587744
PublicationCentury 2000
PublicationDate 2018-Nov.
PublicationDateYYYYMMDD 2018-11-01
PublicationDate_xml – month: 11
  year: 2018
  text: 2018-Nov.
PublicationDecade 2010
PublicationTitle 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
PublicationTitleAbbrev ICCAD
PublicationYear 2018
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002871359
ssj0020286
Score 2.3142383
Snippet Nowadays, a variety of multipliers are used in different computationally intensive industrial applications. Most of these multipliers are highly parallelized...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Adders
Algebra
Computer architecture
Computer science
Explosions
Logic gates
Title PolyCleaner: Clean your Polynomials before Backward Rewriting to verify Million-gate Multipliers
URI https://ieeexplore.ieee.org/document/8587744
WOSCitedRecordID wos000494640800127&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/eLvHCXMwlV07T8MwELbaigGWQlvEWx4YSZvEzzBSUTFAVSFA3YrtnFGlKkElBfXfYyehgMTCZOvkwfKdfeezv-8QOgcCMuEpDWIGcUCZpYFSFgKljQ0hActKLMzTrRiP5XSaTBroYoOFAYDy8xn0fbd8y09zs_KpsoFk0kUrtImaQvAKq7XJp_jIn3jXXF-2nIDXVD4RZQPPOyc46_tWkt-1VEpXMmr_bxK7qPeNycOTjbfZQw3IOqj9VZQB13u0g3Z-MAx20fMkX6yHC1AZLC9x2cFrZz7Yyz0i2Vkf1uAiV8BXPpXnDAbfw4enOspecJFjZ-pzu8YeM-hUWKbj8F31C9FX0e6hx9H1w_AmqIsqBCqmogiINKEyUkXURBK04FYwoRJpZKgVECtCHStpgGimUiPccG1Fyk0IRjndcbKPWlmewQHCVAvjti_jACElyqjIHX9SJamOpA11dIi6fvlmrxVvxqxeuaO_xcdo2wUjssL5naBWsVzBKdoy78X8bXlWKvsTXT6tgA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwIxEJ0gmqgXFDB-24NHF3bZdtv1KJFgBEIMGm7YdqeGhCwGQcO_t11W1MSLpzaTHprOtDOd9r0BuMQQRRwl1GswbHiUGepJadCTShsfYzQsw8I8dXivJ4bDuF-AqzUWBhGzz2dYc93sLT-Z6oVLldUFEzZaoRuwyai996zQWuuMiov9Q-ec8-uWFUQ5mU9AWd0xz_GI1Vwrwt_VVDJn0ir9bxp7UP1G5ZH-2t_sQwHTMpS-yjKQfJeWYfcHx2AFnvvTybI5QZni7JpkHbK0BkSc3GGSrf0RhTZ2RXLjknnWZMgDfjiyo_SFzKfEGvvYLIlDDVolZgk50l39Q3R1tKvw2LodNNteXlbBkw3K514otC-1kAHVgUDFI8MZl7HQwlcSQ8N91ZBCY6iYTDS3w5XhSaR91NJqLwoPoJhOUzwEQhXXdgOzCNGnodQysAegkHGiAmF8FRxBxS3f6HXFnDHKV-74b_EFbLcH3c6oc9e7P4EdG5qIFervFIrz2QLPYEu_z8dvs_NM8Z-OwLDH
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%3Ajournal&rft.genre=proceeding&rft.title=2018+IEEE%2FACM+International+Conference+on+Computer-Aided+Design+%28ICCAD%29&rft.atitle=PolyCleaner%3A+Clean+your+Polynomials+before+Backward+Rewriting+to+verify+Million-gate+Multipliers&rft.au=Mahzoon%2C+Alireza&rft.au=Grosse%2C+Daniel&rft.au=Drechsler%2C+Rolf&rft.date=2018-11-01&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=8&rft_id=info:doi/10.1145%2F3240765.3240837&rft.externalDocID=8587744