{"id":"https://openalex.org/W4414197294","doi":"https://doi.org/10.1109/dac63849.2025.11133195","title":"Property-driven Parallel Symbolic Model Checking of LTL","display_name":"Property-driven Parallel Symbolic Model Checking of LTL","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4414197294","doi":"https://doi.org/10.1109/dac63849.2025.11133195"},"language":"en","primary_location":{"id":"doi:10.1109/dac63849.2025.11133195","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133195","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037288950","display_name":"Yi Su","orcid":"https://orcid.org/0009-0001-5784-6272"},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yuheng Su","raw_affiliation_strings":["University of Chinese Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chinese Academy of Sciences","institution_ids":["https://openalex.org/I4210165038"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046771809","display_name":"Yingcheng Li","orcid":"https://orcid.org/0000-0002-0894-6461"},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yingcheng Li","raw_affiliation_strings":["University of Chinese Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chinese Academy of Sciences","institution_ids":["https://openalex.org/I4210165038"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5011785079","display_name":"Qiusong Yang","orcid":"https://orcid.org/0000-0001-8099-2035"},"institutions":[{"id":"https://openalex.org/I19820366","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35","country_code":"CN","type":"government","lineage":["https://openalex.org/I19820366"]},{"id":"https://openalex.org/I4210128818","display_name":"Institute of Software","ror":"https://ror.org/033dfsn42","country_code":"CN","type":"facility","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210128818"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Qiusong Yang","raw_affiliation_strings":["Institute of Software, Chinese Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Software, Chinese Academy of Sciences","institution_ids":["https://openalex.org/I4210128818","https://openalex.org/I19820366"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090276200","display_name":"Yiwei Ci","orcid":"https://orcid.org/0000-0002-1897-7536"},"institutions":[{"id":"https://openalex.org/I4210165038","display_name":"University of Chinese Academy of Sciences","ror":"https://ror.org/05qbk4x57","country_code":"CN","type":"education","lineage":["https://openalex.org/I19820366","https://openalex.org/I4210165038"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Yiwei Ci","raw_affiliation_strings":["University of Chinese Academy of Sciences"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Chinese Academy of Sciences","institution_ids":["https://openalex.org/I4210165038"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101636891","display_name":"Ziyu Huang","orcid":"https://orcid.org/0000-0002-4039-0491"},"institutions":[{"id":"https://openalex.org/I31683504","display_name":"Beijing Forestry University","ror":"https://ror.org/04xv2pc41","country_code":"CN","type":"education","lineage":["https://openalex.org/I1327237609","https://openalex.org/I31683504","https://openalex.org/I4210127390"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ziyu Huang","raw_affiliation_strings":["Beijing Forestry University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Beijing Forestry University","institution_ids":["https://openalex.org/I31683504"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.23422028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"7"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9952999949455261,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11450","display_name":"Model-Driven Software Engineering Techniques","score":0.9940999746322632,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10904","display_name":"Embedded Systems Design Techniques","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.9150999784469604},{"id":"https://openalex.org/keywords/symbolic-trajectory-evaluation","display_name":"Symbolic trajectory evaluation","score":0.8102999925613403},{"id":"https://openalex.org/keywords/abstraction-model-checking","display_name":"Abstraction model checking","score":0.7825999855995178},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7081999778747559},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.572700023651123},{"id":"https://openalex.org/keywords/symbolic-data-analysis","display_name":"Symbolic data analysis","score":0.39250001311302185},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.38530001044273376},{"id":"https://openalex.org/keywords/fixed-point","display_name":"Fixed point","score":0.37560001015663147},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.3749000132083893}],"concepts":[{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.9150999784469604},{"id":"https://openalex.org/C23123167","wikidata":"https://www.wikidata.org/wiki/Q7661193","display_name":"Symbolic trajectory evaluation","level":3,"score":0.8102999925613403},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8011000156402588},{"id":"https://openalex.org/C30888246","wikidata":"https://www.wikidata.org/wiki/Q4669969","display_name":"Abstraction model checking","level":3,"score":0.7825999855995178},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7081999778747559},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.572700023651123},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5144000053405762},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.451200008392334},{"id":"https://openalex.org/C65620979","wikidata":"https://www.wikidata.org/wiki/Q7661176","display_name":"Symbolic data analysis","level":2,"score":0.39250001311302185},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.38530001044273376},{"id":"https://openalex.org/C61445026","wikidata":"https://www.wikidata.org/wiki/Q217608","display_name":"Fixed point","level":2,"score":0.37560001015663147},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.3749000132083893},{"id":"https://openalex.org/C198008173","wikidata":"https://www.wikidata.org/wiki/Q1040040","display_name":"Computation tree logic","level":3,"score":0.3630000054836273},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.358599990606308},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.3515999913215637},{"id":"https://openalex.org/C2779639559","wikidata":"https://www.wikidata.org/wiki/Q7661178","display_name":"Symbolic execution","level":3,"score":0.33799999952316284},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3264000117778778},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.32409998774528503},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.3082999885082245},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.30379998683929443},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2946000099182129},{"id":"https://openalex.org/C13766981","wikidata":"https://www.wikidata.org/wiki/Q11387554","display_name":"Automated proof checking","level":3,"score":0.2858999967575073},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.2831999957561493},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.28200000524520874},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.2786000072956085},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.2759999930858612},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.2743000090122223},{"id":"https://openalex.org/C25016198","wikidata":"https://www.wikidata.org/wiki/Q781833","display_name":"Temporal logic","level":2,"score":0.27079999446868896},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2556000053882599}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dac63849.2025.11133195","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dac63849.2025.11133195","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 62nd ACM/IEEE Design Automation Conference (DAC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320321133","display_name":"Chinese Academy of Sciences","ror":"https://ror.org/034t30j35"},{"id":"https://openalex.org/F4320334977","display_name":"Beijing Municipal Natural Science Foundation","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W233122475","https://openalex.org/W1007052380","https://openalex.org/W1465777884","https://openalex.org/W1483535050","https://openalex.org/W1516771753","https://openalex.org/W1568683624","https://openalex.org/W1607782211","https://openalex.org/W1629693692","https://openalex.org/W1839466040","https://openalex.org/W1864649459","https://openalex.org/W1965690669","https://openalex.org/W2012935476","https://openalex.org/W2023372037","https://openalex.org/W2026436310","https://openalex.org/W2046612382","https://openalex.org/W2061438988","https://openalex.org/W2080267935","https://openalex.org/W2086845443","https://openalex.org/W2127574686","https://openalex.org/W2534303543","https://openalex.org/W2795417873","https://openalex.org/W3157585079","https://openalex.org/W4242741415","https://openalex.org/W4312253334"],"related_works":[],"abstract_inverted_index":{"Model":[0],"checking":[1,12,22,50,66,74,81,116,148,207],"is":[2,23,33],"an":[3,228],"automated":[4],"method":[5],"used":[6],"to":[7,34,39,129,189,193,203,225],"formally":[8],"verify":[9],"systems":[10],"by":[11],"them":[13],"against":[14],"properties.":[15],"However,":[16,90],"a":[17,100,108,140,155,163,197,220],"major":[18],"problem":[19,85],"in":[20,69,82,102,201],"model":[21,49,65,73,80,115,147,157,174,206,243],"the":[24,70,95,131,166,170,173,176,239],"state":[25,158],"explosion.":[26],"To":[27],"overcome":[28],"this":[29,136],"challenge,":[30],"one":[31],"approach":[32,143,210],"utilize":[35],"parallel":[36,63,105,145,205,241],"processing":[37],"capabilities":[38],"either":[40],"speed":[41],"up":[42,224],"computations":[43],"or":[44,123],"handle":[45],"larger-scale":[46],"problems.":[47],"Explicit":[48],"has":[51,117],"lower":[52],"computational":[53],"complexity":[54],"and":[55,87,175,227],"can":[56],"be":[57],"easily":[58],"parallelized.":[59],"There":[60],"are":[61],"numerous":[62],"explicit":[64,79,242],"algorithms":[67],"available":[68],"literature.":[71],"Symbolic":[72],"offers":[75],"significant":[76,184,236],"advantages":[77],"over":[78,238],"terms":[83],"of":[84,149,165,223,231],"scalability":[86],"verification":[88],"speed.":[89],"treating":[91],"states":[92],"encountered":[93],"during":[94],"search":[96],"as":[97],"sets":[98],"poses":[99],"challenge":[101],"devising":[103],"efficient":[104],"algorithms.":[106],"As":[107],"result,":[109],"current":[110],"research":[111],"on":[112,120,196,216],"parallelizing":[113],"symbolic":[114,146],"primarily":[118],"focused":[119],"reachability":[121],"analysis":[122],"safety":[124],"properties,":[125],"rather":[126],"than":[127],"attempting":[128],"parallelize":[130],"nested":[132,167],"fixpoint":[133,168],"calculations.":[134],"In":[135],"paper,":[137],"we":[138],"propose":[139],"novel":[141],"property-driven":[142],"for":[144],"full":[150],"LTL.":[151],"Our":[152],"algorithm":[153],"introduces":[154],"fair":[156],"labelling":[159],"function":[160],"that":[161],"forms":[162],"partition":[164],"across":[169],"product":[171],"combining":[172],"property":[177],"B\u00fcchi":[178],"automaton.":[179],"The":[180],"experimental":[181],"results":[182],"demonstrate":[183],"speedup,":[185],"ranging":[186],"from":[187],"2.81":[188],"17.19":[190],"times":[191],"compared":[192],"sequential":[194],"approaches":[195],"32-core":[198],"machine.":[199],"Moreover,":[200],"comparison":[202],"existing":[204],"methods,":[208],"our":[209],"not":[211],"only":[212],"surpasses":[213],"those":[214],"relying":[215],"BDD":[217],"libraries":[218],"with":[219],"maximum":[221],"improvement":[222,230],"134%":[226],"average":[229],"33.1%":[232],"but":[233],"also":[234],"demonstrates":[235],"superiority":[237],"state-of-theart":[240],"checker.":[244]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}