{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:56:50Z","timestamp":1762102610819,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,12,21]],"date-time":"2020-12-21T00:00:00Z","timestamp":1608508800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"HUAWEI Technologies Co., LTD"},{"name":"NSFC","award":["61632005, 61532019"],"award-info":[{"award-number":["61632005, 61532019"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,12,21]]},"DOI":"10.1145\/3324884.3416569","type":"proceedings-article","created":{"date-parts":[[2021,1,27]],"date-time":"2021-01-27T23:39:02Z","timestamp":1611790742000},"page":"6-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Accelerating all-SAT computation with short blocking clauses"],"prefix":"10.1145","author":[{"given":"Yueling","family":"Zhang","sequence":"first","affiliation":[{"name":"Singapore Management University and East China Normal University"}]},{"given":"Geguang","family":"Pu","sequence":"additional","affiliation":[{"name":"East China Normal University"}]},{"given":"Jun","family":"Sun","sequence":"additional","affiliation":[{"name":"Singapore Management University"}]}],"member":"320","published-online":{"date-parts":[[2021,1,27]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Roberto J Bayardo Jr and Joseph Daniel Pehoushek. 2000. Counting models using connected components. In AAAI\/IAAI. 157--162."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_16"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(03)58003-2"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31612-8_1"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_17"},{"key":"e_1_3_2_1_6_1","volume-title":"International Conference on Operating Systems Design and Implementation. 209--224","author":"Cadar Cristian","year":"2008","unstructured":"Cristian Cadar, Daniel Dunbar, and Dawson Engler. 2008. KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In International Conference on Operating Systems Design and Implementation. 209--224."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:FORM.0000040025.89719.f3"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1613\/jair.989"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/368273.368557"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/321033.321034"},{"key":"e_1_3_2_1_11_1","volume-title":"International conference on theory and applications of satisfiability testing. Springer, 502--518","author":"E\u00e9n Niklas","year":"2003","unstructured":"Niklas E\u00e9n and Niklas S\u00f6rensson. 2003. An extensible SAT-solver. In International conference on theory and applications of satisfiability testing. Springer, 502--518."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1055024"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2004.1382631"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72200-7_13"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-01929-6_7"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30494-4_20"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-40922-X_22"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622606.1622613"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/IRI.2014.7051971"},{"key":"e_1_3_2_1_20_1","volume-title":"Automated analysis and debugging of network connectivity policies. Microsoft Research","author":"Jayaraman Karthick","year":"2014","unstructured":"Karthick Jayaraman, Nikolaj Bj\u00f8rner, Geoff Outhred, and Charlie Kaufman. 2014. Automated analysis and debugging of network connectivity policies. Microsoft Research (2014), 1--11."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065579.1065775"},{"key":"e_1_3_2_1_22_1","volume-title":"CBMC - C Bounded Model Checker. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. 389--391","author":"Kroening Daniel","year":"2014","unstructured":"Daniel Kroening and Michael Tautschnig. 2014. CBMC - C Bounded Model Checker. In International Conference on Tools and Algorithms for the Construction and Analysis of Systems. 389--391."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45069-6_15"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/11817963_39"},{"key":"e_1_3_2_1_25_1","volume-title":"Proceedings Design, Automation and Test in Europe Conference and Exhibition","volume":"1","author":"Li Bin","year":"2004","unstructured":"Bin Li, Michael S Hsiao, and Shuo Sheng. 2004. A novel SAT all-solutions solver for efficient preimage computation. In Proceedings Design, Automation and Test in Europe Conference and Exhibition, Vol. 1. IEEE, 272--277."},{"volume-title":"SAT-Based Explicit LTLf Satisfiability Checking. In The Thirty-Third AAAI Conference on Artificial Intelligence. 2946--2953","author":"Li Jianwen","key":"e_1_3_2_1_26_1","unstructured":"Jianwen Li, Kristin Y. Rozier, Geguang Pu, Yueling Zhang, and Moshe Y. Vardi. 2019. SAT-Based Explicit LTLf Satisfiability Checking. In The Thirty-Third AAAI Conference on Artificial Intelligence. 2946--2953."},{"volume-title":"2017 IEEE\/ACM International Conference on Computer-Aided Design. 95--100","author":"Li Jianwen","key":"e_1_3_2_1_27_1","unstructured":"Jianwen Li, Shufang Zhu, Yueling Zhang, Geguang Pu, and Moshe Y. Vardi. 2017. Safety model checking with complementary approximations. In 2017 IEEE\/ACM International Conference on Computer-Aided Design. 95--100."},{"volume-title":"12th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 15). 499--512.","author":"Lopes Nuno P","key":"e_1_3_2_1_28_1","unstructured":"Nuno P Lopes, Nikolaj Bj\u00f8rner, Patrice Godefroid, Karthick Jayaraman, and George Varghese. 2015. Checking beliefs in dynamic networks. In 12th {USENIX} Symposium on Networked Systems Design and Implementation ({NSDI} 15). 499--512."},{"key":"e_1_3_2_1_29_1","volume-title":"Rep","author":"Lopes Nuno P","year":"2013","unstructured":"Nuno P Lopes, Nikolaj Bj\u00f8rner, Patrice Godefroid, and George Varghese. 2013. Network verification in the light of program verification. MSR, Rep (2013)."},{"key":"e_1_3_2_1_30_1","volume-title":"Sai Deep Tetali, and Zilong Wang","author":"Majumdar Rupak","year":"2014","unstructured":"Rupak Majumdar, Sai Deep Tetali, and Zilong Wang. 2014. Kuai: A model checker for software-defined networks. In 2014 Formal Methods in Computer-Aided Design (FMCAD). IEEE, 163--170."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45657-0_19"},{"key":"e_1_3_2_1_32_1","volume-title":"Workshops at the thirtieth AAAI conference on artificial intelligence.","author":"Meel Kuldeep S","year":"2016","unstructured":"Kuldeep S Meel, Moshe Y Vardi, Supratik Chakraborty, Daniel J Fremont, Sanjit A Seshia, Dror Fried, Alexander Ivrii, and Sharad Malik. 2016. Constrained sampling and counting: Universal hashing meets SAT solving. In Workshops at the thirtieth AAAI conference on artificial intelligence."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.5555\/1105924.1106049"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972931.1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2345792"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCD.2003.1240948"},{"key":"e_1_3_2_1_37_1","volume-title":"Automation and Test in Europe Conference and Exhibition. IEEE, 822--827","author":"Sheng Shuo","year":"2003","unstructured":"Shuo Sheng and Michael Hsiao. 2003. Efficient preimage computation using a novel success-driven atpg. In 2003 Design, Automation and Test in Europe Conference and Exhibition. IEEE, 822--827."},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38527-8_10"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2975585"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2695664.2695941"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/VLSID.2014.22"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33386-6_1"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2019.102374"}],"event":{"name":"ASE '20: 35th IEEE\/ACM International Conference on Automated Software Engineering","sponsor":["SIGAI ACM Special Interest Group on Artificial Intelligence","SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"],"location":"Virtual Event Australia","acronym":"ASE '20"},"container-title":["Proceedings of the 35th IEEE\/ACM International Conference on Automated Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3324884.3416569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3324884.3416569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:01:38Z","timestamp":1750197698000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3324884.3416569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,21]]},"references-count":43,"alternative-id":["10.1145\/3324884.3416569","10.1145\/3324884"],"URL":"https:\/\/doi.org\/10.1145\/3324884.3416569","relation":{},"subject":[],"published":{"date-parts":[[2020,12,21]]},"assertion":[{"value":"2021-01-27","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}