Demystifying Template-Based Invariant Generation for Bit-Vector Programs
The template-based approach to invariant generation is a parametric and relatively complete methodology for inferring loop invariants. The relative completeness ensures the generated invariants' accuracy up to the template's form and the inductive condition. However, there has been limited...
Gespeichert in:
| Veröffentlicht in: | IEEE/ACM International Conference on Automated Software Engineering : [proceedings] S. 673 - 685 |
|---|---|
| Hauptverfasser: | , , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
IEEE
11.09.2023
|
| Schlagworte: | |
| ISSN: | 2643-1572 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The template-based approach to invariant generation is a parametric and relatively complete methodology for inferring loop invariants. The relative completeness ensures the generated invariants' accuracy up to the template's form and the inductive condition. However, there has been limited in advancing the approach to bit-precise reasoning, which involves modeling integers using bit-vector arithmetic. This is unfortunate because bit-precise reasoning is crucial for faithfully and accurately modeling machine integer semantics and, thus, for ensuring sound and precise program verification. In this experience paper, we present an experimental study of bit-precise, template-based invariant generation on three fronts: the precision of different invariant templates, the performance of different constraint solvers for solving the constraints, and the effectiveness of the template-based approach compared to existing bit-precise verification techniques. Through an extensive experimental evaluation over a wide range of benchmarks, we find that (1) the choices of invariant templates and constraint solvers have varying degrees of impact on the precision and efficiency of invariant generation; (2) the template-based approach can handle benchmarks that other approaches for bit-vectors cannot handle. The results also reveal several guidelines for advancing future research on template-based invariant generation. |
|---|---|
| AbstractList | The template-based approach to invariant generation is a parametric and relatively complete methodology for inferring loop invariants. The relative completeness ensures the generated invariants' accuracy up to the template's form and the inductive condition. However, there has been limited in advancing the approach to bit-precise reasoning, which involves modeling integers using bit-vector arithmetic. This is unfortunate because bit-precise reasoning is crucial for faithfully and accurately modeling machine integer semantics and, thus, for ensuring sound and precise program verification. In this experience paper, we present an experimental study of bit-precise, template-based invariant generation on three fronts: the precision of different invariant templates, the performance of different constraint solvers for solving the constraints, and the effectiveness of the template-based approach compared to existing bit-precise verification techniques. Through an extensive experimental evaluation over a wide range of benchmarks, we find that (1) the choices of invariant templates and constraint solvers have varying degrees of impact on the precision and efficiency of invariant generation; (2) the template-based approach can handle benchmarks that other approaches for bit-vectors cannot handle. The results also reveal several guidelines for advancing future research on template-based invariant generation. |
| Author | Yao, Peisen Ke, Jingyu Fu, Hongfei Wu, Rongxin Ren, Kui Sun, Jiahui |
| Author_xml | – sequence: 1 givenname: Peisen surname: Yao fullname: Yao, Peisen email: pyaoaa@zju.edu.cn organization: Zhejiang University,China – sequence: 2 givenname: Jingyu surname: Ke fullname: Ke, Jingyu email: Windocotber@sjtu.edu.cn organization: Shanghai Jiao Tong University,China – sequence: 3 givenname: Jiahui surname: Sun fullname: Sun, Jiahui email: jasonj@zju.edu.cn organization: Zhejiang University,China – sequence: 4 givenname: Hongfei surname: Fu fullname: Fu, Hongfei email: jt002845@sjtu.edu.cn organization: Shanghai Jiao Tong University,China – sequence: 5 givenname: Rongxin surname: Wu fullname: Wu, Rongxin email: wurongxin@xmu.edu.cn organization: School of Informatics, Xiamen University,China – sequence: 6 givenname: Kui surname: Ren fullname: Ren, Kui email: kuiren@zju.edu.cn organization: Zhejiang University,China |
| BookMark | eNotjlFLwzAUhaMouM39An3oH2hNb5qkedzm3AYDBaev47a9GZE1HWkQ-u9X0PNyvvPycabszneeGHvKeZbn3LwsPtdSAZgMOIiMc67MDZsbbUohuQBjVHHLJqAKkeZSwwOb9v0P53IcesK2r9QOfXR2cP6UHKi9nDFSusSemmTnfzE49DHZkKeA0XU-sV1Ili6m31THET9CdwrY9o_s3uK5p_l_z9jX2_qw2qb7981utdinCGURUyoVt0iEQkttTVloCwU0RstKgai1JaybMTT-NVVTCSgaFIZLJUuVN7WYsec_ryOi4yW4FsNwzDmYUiotrn6dT3Y |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1109/ASE56229.2023.00069 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Xplore POP ALL IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 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 | Computer Science |
| EISBN | 9798350329964 |
| EISSN | 2643-1572 |
| EndPage | 685 |
| ExternalDocumentID | 10298567 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Key R&D Program of China grantid: 2022YFB4501903 funderid: 10.13039/501100012166 – fundername: National Natural Science Foundation of China grantid: 62172271,62272400,62132014 funderid: 10.13039/501100001809 |
| GroupedDBID | 6IE 6IF 6IH 6IK 6IL 6IM 6IN 6J9 AAJGR AAWTH ABLEC ACREN ADYOE ADZIZ AFYQB ALMA_UNASSIGNED_HOLDINGS AMTXH BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO IEGSK IPLJI M43 OCL RIE RIL |
| ID | FETCH-LOGICAL-a284t-e860faeea3757f9847f242d975b623c7feacdddde6439bdb324da390565861dc3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 2 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001103357200054&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:32:41 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a284t-e860faeea3757f9847f242d975b623c7feacdddde6439bdb324da390565861dc3 |
| PageCount | 13 |
| ParticipantIDs | ieee_primary_10298567 |
| PublicationCentury | 2000 |
| PublicationDate | 2023-Sept.-11 |
| PublicationDateYYYYMMDD | 2023-09-11 |
| PublicationDate_xml | – month: 09 year: 2023 text: 2023-Sept.-11 day: 11 |
| PublicationDecade | 2020 |
| PublicationTitle | IEEE/ACM International Conference on Automated Software Engineering : [proceedings] |
| PublicationTitleAbbrev | ASE |
| PublicationYear | 2023 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0051577 ssib057256115 |
| Score | 2.265436 |
| Snippet | The template-based approach to invariant generation is a parametric and relatively complete methodology for inferring loop invariants. The relative... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 673 |
| SubjectTerms | Arithmetic Benchmark testing Cognition comparison and analysis constraint solving Guidelines Invariant generation Semantics Software engineering |
| Title | Demystifying Template-Based Invariant Generation for Bit-Vector Programs |
| URI | https://ieeexplore.ieee.org/document/10298567 |
| WOSCitedRecordID | wos001103357200054&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/eLvHCXMwlV09b8IwELUK6tCJflD1Wx66po1JHNtjaUF0QUilFRuKvySkEhAEpP773jkBpg7NZGWJdfblvTj33hHyqGOsp5A2MrHxUYo2hDlwuCgHupvwTAJimNBsQgyHcjJRo1qsHrQwzrlQfOaecBj-5duF2eBRGWR4R0meiQZpCCEqsdZu83AB4M3YnvsCTgtR2wyxWD2_fPQA6juoTemgqWkcSpwPDVUCnvRb_5zJKWkflHl0tMecM3LkinPS2rVmoHWmXpDBm5v_QPYGFRMdu_nyG0hl1AXMsvS92MIXMoSUVqbTuDYUyCvtzsroKxzj40OwbmvdJp_93vh1ENVNEyC8Mi0jJ7PY587lieDCKwAfDyhsleAamI4RHt60Fi6HVERbDYTK5okCHsRlxqxJLkmzWBTuilCDbnVaWZtrdNnnWmvFTOpjb5lLs-yatDEy02XlizHdBeXmj_u35ASDj9UWjN2RZrnauHtybLblbL16CKv5CzFtn7c |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8JAEN0omugJPzB-uwev1W7b7XaPohCISEhEw410P5qQQCFQSPz3ziwFTh7sqemlzcxO3-t23htCHpWP_RSJ8bSvMy9CG8IUOJyXAt0NeZwAYmg3bEJ0u8lgIHulWN1pYay1rvnMPuGp-5dvpnqJW2VQ4YFMeCz2yQGPooCt5Vqb5cMFwDdjW_YLSC1EaTTEfPn88tkAsA9QnRKgranvmpx3I1UcojSr_3yWE1LbafNob4s6p2TP5mekuhnOQMtaPSetNzv5gfp1Oibat5PZGGilVwfUMrSdr-AbGYJK17bTmB0K9JXWR4X37Tby8SbYubWoka9mo__a8sqxCRDgJCo8m8R-llqbhoKLTAL8ZIDDRgqugOtokcG71sBhkYwoo4BSmTSUwIR4EjOjwwtSyae5vSRUo1-dksakCn32uVJKMh1lfmaYjeL4itQwMsPZ2hljuAnK9R_XH8hRq__RGXba3fcbcoyJwN4Lxm5JpZgv7R051KtitJjfu8z-Aq8nov4 |
| 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=IEEE%2FACM+International+Conference+on+Automated+Software+Engineering+%3A+%5Bproceedings%5D&rft.atitle=Demystifying+Template-Based+Invariant+Generation+for+Bit-Vector+Programs&rft.au=Yao%2C+Peisen&rft.au=Ke%2C+Jingyu&rft.au=Sun%2C+Jiahui&rft.au=Fu%2C+Hongfei&rft.date=2023-09-11&rft.pub=IEEE&rft.eissn=2643-1572&rft.spage=673&rft.epage=685&rft_id=info:doi/10.1109%2FASE56229.2023.00069&rft.externalDocID=10298567 |