Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding

Bounded Model Checking (BMC) is so far considered as the best engine for bug-finding in hardware model checking. Given a bound K, BMC can detect if there is a counterexample to a given temporal property within K steps from the initial state, thus performing a global-style search. Recently, a SAT-bas...

Full description

Saved in:
Bibliographic Details
Published in:2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) pp. 1 - 9
Main Authors: Zhang, Xiaoyu, Xiao, Shengping, Li, Jianwen, Pu, Geguang, Strichman, Ofer
Format: Conference Proceeding
Language:English
Published: ACM 29.10.2022
Subjects:
Adaptation models
Automobiles
Benchmark testing
Computational modeling
Design automation
Hardware
Model checking
ISSN:1558-2434
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Bounded Model Checking (BMC) is so far considered as the best engine for bug-finding in hardware model checking. Given a bound K, BMC can detect if there is a counterexample to a given temporal property within K steps from the initial state, thus performing a global-style search. Recently, a SAT-based model-checking technique called Complementary Approximate Reachability (CAR) was shown to be complementary to BMC, in the sense that frequently they can solve instances that the other technique cannot, within the same time limit. CAR detects a counterexample gradually with the guidance of an over-approximating state sequence, and performs a local-style search. In this paper, we consider three different ways to combine BMC and CAR. Our experiments show that they all outperform BMC and CAR on their own, and solve instances that cannot be solved by these two techniques. Our findings are based on a comprehensive experimental evaluation using the benchmarks of two hardware model checking competitions.
AbstractList Bounded Model Checking (BMC) is so far considered as the best engine for bug-finding in hardware model checking. Given a bound K, BMC can detect if there is a counterexample to a given temporal property within K steps from the initial state, thus performing a global-style search. Recently, a SAT-based model-checking technique called Complementary Approximate Reachability (CAR) was shown to be complementary to BMC, in the sense that frequently they can solve instances that the other technique cannot, within the same time limit. CAR detects a counterexample gradually with the guidance of an over-approximating state sequence, and performs a local-style search. In this paper, we consider three different ways to combine BMC and CAR. Our experiments show that they all outperform BMC and CAR on their own, and solve instances that cannot be solved by these two techniques. Our findings are based on a comprehensive experimental evaluation using the benchmarks of two hardware model checking competitions.
Author Xiao, Shengping
Li, Jianwen
Pu, Geguang
Strichman, Ofer
Zhang, Xiaoyu
Author_xml – sequence: 1
  givenname: Xiaoyu
  surname: Zhang
  fullname: Zhang, Xiaoyu
  organization: East China Normal University,Software Engineering Institute
– sequence: 2
  givenname: Shengping
  surname: Xiao
  fullname: Xiao, Shengping
  organization: East China Normal University,Software Engineering Institute
– sequence: 3
  givenname: Jianwen
  surname: Li
  fullname: Li, Jianwen
  email: lijwen2748@gmail.com
  organization: East China Normal University,Software Engineering Institute
– sequence: 4
  givenname: Geguang
  surname: Pu
  fullname: Pu, Geguang
  organization: East China Normal University,Software Engineering Institute
– sequence: 5
  givenname: Ofer
  surname: Strichman
  fullname: Strichman, Ofer
  organization: Information System Engineering, IE, Technion
BookMark eNotjsFKw0AURUdRsNau3biYH0id995MJrNsg1WhIhRdl0nyUkfSSUgjmL83oqsL58DhXouL2EYW4hbUEkCbezIqI4NLMtqRozOxcDabhCKHYPW5mIExWYKa9JVYnE6fSinMLFirZmKXt8cixBAPcv2SSx8rOZGu4SPHwfejXHVd336Hox9Y7tiXH74ITRhGObRyVZbccP-r1l-HZBNiNYVuxGXtmxMv_ncu3jcPb_lTsn19fM5X28SjzoYETGWo1rUpsUAsUgSoSZWMzln0mLH3BXjNVJestbXgrSVNVCm2Slukubj76wZm3nf99LEf96BU6iBN6Qf9HFEI
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/3508352.3549393
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 Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 9781450392174
1450392172
EISSN 1558-2434
EndPage 9
ExternalDocumentID 10069166
Genre orig-research
GrantInformation_xml – fundername: National Natural Science Foundation of China
  funderid: 10.13039/501100001809
– fundername: Research and Development
  funderid: 10.13039/100006190
GroupedDBID 6IE
6IF
6IH
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-a248t-15d53f4f5c2b22b6211f30ce29972a28eaab1a4e3fce44771a773433d0e704723
IEDL.DBID RIE
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981574300125&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:46:16 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a248t-15d53f4f5c2b22b6211f30ce29972a28eaab1a4e3fce44771a773433d0e704723
PageCount 9
ParticipantIDs ieee_primary_10069166
PublicationCentury 2000
PublicationDate 2022-Oct.-29
PublicationDateYYYYMMDD 2022-10-29
PublicationDate_xml – month: 10
  year: 2022
  text: 2022-Oct.-29
  day: 29
PublicationDecade 2020
PublicationTitle 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD)
PublicationTitleAbbrev ICCAD
PublicationYear 2022
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002871770
ssj0020286
Score 2.2137775
Snippet Bounded Model Checking (BMC) is so far considered as the best engine for bug-finding in hardware model checking. Given a bound K, BMC can detect if there is a...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Adaptation models
Automobiles
Benchmark testing
Computational modeling
Design automation
Hardware
Model checking
Title Combining BMC and Complementary Approximate Reachability to Accelerate Bug-Finding
URI https://ieeexplore.ieee.org/document/10069166
WOSCitedRecordID wos000981574300125&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/eLvHCXMwlV1LTwIxEG6EeNCLL4zv9OC1yPa9RyASD0oI0YQb6XZnDZfFwGLk39spK3Lx4K1p0qaZdjoz7XzfEHKf5Epw42w4vMoxaWTBnEwssx7J6ISCAiLP7LMZDu1kko5qsHrEwgBATD6DNjbjX34-9yt8Kgsa3tHBndEN0jBGb8Ba2wcVdP0NHr462goduubySaR6ECo6G20RAiKB38w7xVSiLRkc_XMVx6T1i8qjo629OSF7UJ6Swx1CwTMyDuqdxZIPtPfSp67MKSp8nSK-WNMuUoh_zYKbCnSMiZQbmu41rea0632wQUgdQXurdzaYRcBLi7wNHl_7T6yumsAcl7ZiiQriL2ShPM84z3SI8ArR8cARIuu4BeeyxEkQhQcpjUmcMUIKkXfAIHWkOCfNcl7CBaGpzpT1YaLUgESamqxIpbZhXJhDenlJWiie6ceGGGP6I5mrP_qvyQFH9EC4-nl6Q5rVYgW3ZN9_VrPl4i5u5zc7cZ6Z
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlZ3PT8IwFMcbRRP14i-Mv-3B63BrX9fuKESCEQghmHAjXfdmuAyDw8h_b1smcvHgbWmypmn78t5r-_08Qu6jTHAmtbKbV-gAJOSBhkgFyjgYHReYo-fMdmW_r8bjZFCJ1b0WBhH94zNsuE9_l5_NzMIdlVkLD2MbzsTbZEcAsHAl11ofqbjgX7rtV-VbtiGuaD4RiAcufLjR4DYl4u6ieaOcivcm7cN_juOI1H91eXSw9jjHZAuLE3KwgRQ8JUNr4Kkv-kCbvRbVRUadyVePxOdL-ugg4l9TG6giHbqnlCtQ95KWM_pojPVCDh5Bm4u3oD31kpc6eW0_jVqdoKqbEGgGqgwiYRcgh1wYljKWxjbHy3lokDmRrGYKtU4jDchzgwBSRlpKDpxnIUoHj-RnpFbMCjwnNIlToYztKJEIDlST5gnEyv5n-wADF6TupmfyvkJjTH5m5vKP9juy1xn1upPuc__liuwzpyWwjoAl16RWzhd4Q3bNZzn9mN_6pf0GrJah4A
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=2022+IEEE%2FACM+International+Conference+On+Computer+Aided+Design+%28ICCAD%29&rft.atitle=Combining+BMC+and+Complementary+Approximate+Reachability+to+Accelerate+Bug-Finding&rft.au=Zhang%2C+Xiaoyu&rft.au=Xiao%2C+Shengping&rft.au=Li%2C+Jianwen&rft.au=Pu%2C+Geguang&rft.date=2022-10-29&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F3508352.3549393&rft.externalDocID=10069166