Property-driven Parallel Symbolic Model Checking of LTL
Model checking is an automated method used to formally verify systems by checking them against properties. However, a major problem in model checking is the state explosion. To overcome this challenge, one approach is to utilize parallel processing capabilities to either speed up computations or han...
Uložené v:
| Vydané v: | 2025 62nd ACM/IEEE Design Automation Conference (DAC) s. 1 - 7 |
|---|---|
| Hlavní autori: | , , , , |
| Médium: | Konferenčný príspevok.. |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
22.06.2025
|
| Predmet: | |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | Model checking is an automated method used to formally verify systems by checking them against properties. However, a major problem in model checking is the state explosion. To overcome this challenge, one approach is to utilize parallel processing capabilities to either speed up computations or handle larger-scale problems. Explicit model checking has lower computational complexity and can be easily parallelized. There are numerous parallel explicit model checking algorithms available in the literature. Symbolic model checking offers significant advantages over explicit model checking in terms of problem scalability and verification speed. However, treating states encountered during the search as sets poses a challenge in devising efficient parallel algorithms. As a result, current research on parallelizing symbolic model checking has primarily focused on reachability analysis or safety properties, rather than attempting to parallelize the nested fixpoint calculations. In this paper, we propose a novel property-driven approach for parallel symbolic model checking of full LTL. Our algorithm introduces a fair model state labelling function that forms a partition of the nested fixpoint across the product combining the model and the property Büchi automaton. The experimental results demonstrate significant speedup, ranging from 2.81 to 17.19 times compared to sequential approaches on a 32-core machine. Moreover, in comparison to existing parallel model checking methods, our approach not only surpasses those relying on BDD libraries with a maximum improvement of up to 134% and an average improvement of 33.1% but also demonstrates significant superiority over the state-of-theart parallel explicit model checker. |
|---|---|
| AbstractList | Model checking is an automated method used to formally verify systems by checking them against properties. However, a major problem in model checking is the state explosion. To overcome this challenge, one approach is to utilize parallel processing capabilities to either speed up computations or handle larger-scale problems. Explicit model checking has lower computational complexity and can be easily parallelized. There are numerous parallel explicit model checking algorithms available in the literature. Symbolic model checking offers significant advantages over explicit model checking in terms of problem scalability and verification speed. However, treating states encountered during the search as sets poses a challenge in devising efficient parallel algorithms. As a result, current research on parallelizing symbolic model checking has primarily focused on reachability analysis or safety properties, rather than attempting to parallelize the nested fixpoint calculations. In this paper, we propose a novel property-driven approach for parallel symbolic model checking of full LTL. Our algorithm introduces a fair model state labelling function that forms a partition of the nested fixpoint across the product combining the model and the property Büchi automaton. The experimental results demonstrate significant speedup, ranging from 2.81 to 17.19 times compared to sequential approaches on a 32-core machine. Moreover, in comparison to existing parallel model checking methods, our approach not only surpasses those relying on BDD libraries with a maximum improvement of up to 134% and an average improvement of 33.1% but also demonstrates significant superiority over the state-of-theart parallel explicit model checker. |
| Author | Ci, Yiwei Su, Yuheng Huang, Ziyu Li, Yingcheng Yang, Qiusong |
| Author_xml | – sequence: 1 givenname: Yuheng surname: Su fullname: Su, Yuheng organization: University of Chinese Academy of Sciences – sequence: 2 givenname: Yingcheng surname: Li fullname: Li, Yingcheng organization: University of Chinese Academy of Sciences – sequence: 3 givenname: Qiusong surname: Yang fullname: Yang, Qiusong organization: Institute of Software, Chinese Academy of Sciences – sequence: 4 givenname: Yiwei surname: Ci fullname: Ci, Yiwei organization: University of Chinese Academy of Sciences – sequence: 5 givenname: Ziyu surname: Huang fullname: Huang, Ziyu organization: Beijing Forestry University |
| BookMark | eNo1T8tKxDAUjaALHecPRPIDHZPm0dzlUJ9QccBxPdy0N1rMNEMchP69AXV1nhw4F-x0ShMxdi3FSkoBN7fr1iqnYVWL2hRLKiXBnLAlNOAKN0IJ7c5Zs8npQPk4V0Mev2niG8wYI0X-Ou99imPPn9NQZPtB_ec4vfMUeLftLtlZwPhFyz9csLf7u237WHUvD0_tuqtQNnCspEbnQRsVrLDg0QQdrCYrCLwMwilXWzQ6BALj-qZ0DSKoEnltwwBqwa5-d0ci2h3yuMc87_7_qB_EBEOR |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/DAC63849.2025.11133195 |
| 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/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798331503048 |
| EndPage | 7 |
| ExternalDocumentID | 11133195 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Beijing Municipal Natural Science Foundation funderid: 10.13039/501100005089 – fundername: National Natural Science Foundation of China funderid: 10.13039/501100001809 – fundername: Chinese Academy of Sciences funderid: 10.13039/501100002367 |
| GroupedDBID | 6IE 6IH CBEJK RIE RIO |
| ID | FETCH-LOGICAL-a179t-14a8b9453f6069ba5f4f64e60e9b1f083826a54ffe958c78b95aa931f0b46fd93 |
| IEDL.DBID | RIE |
| IngestDate | Wed Oct 01 07:05:15 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a179t-14a8b9453f6069ba5f4f64e60e9b1f083826a54ffe958c78b95aa931f0b46fd93 |
| PageCount | 7 |
| ParticipantIDs | ieee_primary_11133195 |
| PublicationCentury | 2000 |
| PublicationDate | 2025-June-22 |
| PublicationDateYYYYMMDD | 2025-06-22 |
| PublicationDate_xml | – month: 06 year: 2025 text: 2025-June-22 day: 22 |
| PublicationDecade | 2020 |
| PublicationTitle | 2025 62nd ACM/IEEE Design Automation Conference (DAC) |
| PublicationTitleAbbrev | DAC |
| PublicationYear | 2025 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| Score | 2.2949655 |
| Snippet | Model checking is an automated method used to formally verify systems by checking them against properties. However, a major problem in model checking is the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Automata Computational modeling Labeling Libraries Model checking Parallel algorithms Partitioning algorithms Reachability analysis Safety Scalability |
| Title | Property-driven Parallel Symbolic Model Checking of LTL |
| URI | https://ieeexplore.ieee.org/document/11133195 |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA62ePCkYsU3OXhNu92dbDZHqRYPpSxYobeSxwSF2sq6FfrvzWxbxYMHbyEJhMlrMpP55mPsNgWjE6NAGHLfQ7BGRDPIC1Cu8MqnSYZNntmRGo-L6VSXW7B6g4VBxCb4DLtUbP7y_dKtyFXWI1r0uGVki7WUUhuw1hb120907_5uEHcTEPwkld1d51-0KY3WGB7-c7wj1vnB3_HyW7Mcsz1cnDBVkt-8qtfCV3RF8dJURIQy50_rN0vpfTkRm8354AUdOcD5MvDRZNRhz8OHyeBRbGkPhImnoxZ9MIXVILMQjQttjQwQcsA8QW37IT6ZokVgJISAWhZOxb7SGJ3FJgt58Do7Ze3FcoFnjCMWANJJ1MGCTtE60C54k-cmBe_sOeuQ1LP3TWaL2U7giz_qL9kBzS2FSqXpFWvX1Qqv2b77rF8_qptmPb4AKGqM3w |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5aBT2pWPFtDl633c1OdjdHqZaKa1mwQm8ljwkKdSvrVui_N9m2igcP3kISCJPXZCbzzUfINQMpQplCIL37HqySgTODTACpzkxqWBhjk2c2T4fDbDwWxQqs3mBhELEJPsOOLzZ_-Wam595V1vW06G7L8E2yxQFYtIRrrXC_USi6tzc9t5_AA1AY76y7_yJOafRGf--fI-6T9g8CjxbfuuWAbGB5SNLCe86rehGYyl9StJCVp0KZ0qfFm_IJfqmnNpvS3gtq7wKnM0vzUd4mz_27UW8QrIgPAunORx1EIDMlgMfWmRdCSW7BJoBJiEJF1j2anE0gOViLgmc6dX25lCJ2TQoSa0R8RFrlrMRjQhEzAK45CqtAMFQahLZGJolkYLQ6IW0v9eR9mdtishb49I_6K7IzGD3mk_x--HBGdv08-8Apxs5Jq67meEG29Wf9-lFdNmvzBa6DkCY |
| 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=2025+62nd+ACM%2FIEEE+Design+Automation+Conference+%28DAC%29&rft.atitle=Property-driven+Parallel+Symbolic+Model+Checking+of+LTL&rft.au=Su%2C+Yuheng&rft.au=Li%2C+Yingcheng&rft.au=Yang%2C+Qiusong&rft.au=Ci%2C+Yiwei&rft.date=2025-06-22&rft.pub=IEEE&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1109%2FDAC63849.2025.11133195&rft.externalDocID=11133195 |