{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,27]],"date-time":"2026-05-27T10:49:19Z","timestamp":1779878959666,"version":"3.53.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,6,13]]},"DOI":"10.1145\/3735544.3735585","type":"proceedings-article","created":{"date-parts":[[2025,6,13]],"date-time":"2025-06-13T17:54:44Z","timestamp":1749837284000},"page":"28-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Universal High-Performance CFL-Reachability via Matrix Multiplication"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-2692-7713","authenticated-orcid":false,"given":"Ilia","family":"Muravev","sequence":"first","affiliation":[{"name":"Saint Petersburg State University, St. Petersburg, Russian Federation"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7966-0698","authenticated-orcid":false,"given":"Semyon","family":"Grigorev","sequence":"additional","affiliation":[{"name":"Saint Petersburg State University, St. Petersburg, Russian Federation"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,6,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3461837.3464513"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3210259.3210264"},{"key":"e_1_3_2_2_3_1","unstructured":"Pan Chuang and Zhiqiang Zuo. 2020. Graspan-C: A Disk-based Highly Parallel Interprocedural Static Analysis Engine. https:\/\/github.com\/Graspan\/Graspan-C"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3652588.3663318"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3322125"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3577195"},{"key":"e_1_3_2_2_7_1","unstructured":"Timothy A. Davis Corey J. Nolet Joe Eaton Christoph Gr\u00fcninger Gabor Szarnyas Markus M\u00fctzel and Erik Welch. 2024. SuiteSparse:GraphBLAS the official SuiteSparse library. https:\/\/github.com\/DrTimothyAldenDavis\/GraphBLAS"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2814270.2814307"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"crossref","unstructured":"Jens Dietrich Nicholas Hollingum and Bernhard Scholz. 2015. Implementation of Giga-Scale Exhaustive Points-To Analysis for Java in Under a Minute. https:\/\/bitbucket.org\/jensdietrich\/gigascale-pointsto-oopsla2015\/src\/master\/","DOI":"10.1145\/2814270.2814307"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","unstructured":"Shuo Ding and Qirun Zhang. 2023. Mutual Refinements of\u00a0Context-Free Language Reachability. In Static Analysis Manuel V. Hermenegildo and Jos\u00e9 F. Morales (Eds.). Springer Nature Switzerland Cham. 231\u2013258. isbn:978-3-031-44245-2 https:\/\/doi.org\/10.1007\/978-3-031-44245-2_12 10.1007\/978-3-031-44245-2_12","DOI":"10.1007\/978-3-031-44245-2_12"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286186"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3571157"},{"key":"e_1_3_2_2_13_1","unstructured":"Nikita Kovalev and Vadim Abzalov. 2022. CFPQ_Data: Graphs and Grammars for Context-Free Path Querying Algorithms evaluation. https:\/\/github.com\/FormalLanguageConstrainedPathQuerying\/CFPQ_Data"},{"key":"e_1_3_2_2_14_1","unstructured":"Yuxiang Lei. 2024. CPU17-graphs: SPEC 2017 C\/C++ Program Graphs for Context-Free Language Reachability (CFL-r) Evaluation. https:\/\/github.com\/kisslune\/CPU17-graphs"},{"key":"e_1_3_2_2_15_1","volume-title":"POCR: CFL-reachability tool. https:\/\/github.com\/kisslune\/POCR","author":"Lei Yuxiang","year":"2024","unstructured":"Yuxiang Lei. 2024. POCR: CFL-reachability tool. https:\/\/github.com\/kisslune\/POCR"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3563343"},{"key":"e_1_3_2_2_17_1","unstructured":"Ilia Muravev. 2024. CFPQ_JavaGraphMiner: Java Graph Miner And Dataset for CFL-reachability-based analyses. https:\/\/github.com\/FormalLanguageConstrainedPathQuerying\/CFPQ_JavaGraphMiner"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","unstructured":"Ilia Muravev and Semyon Grigorev. 2025. Artifact of \"Universal High Performance CFL-reachability via Matrix Multiplication\". https:\/\/doi.org\/10.5281\/zenodo.15324265 10.5281\/zenodo.15324265","DOI":"10.5281\/zenodo.15324265"},{"key":"e_1_3_2_2_19_1","unstructured":"Ilia Muravev Semyon Grigorev Vladimir Kutuev and Rustam Azimov. 2024. CFPQ_PyAlgo: The collection of Context-Free Path Querying algorithms. https:\/\/github.com\/FormalLanguageConstrainedPathQuerying\/CFPQ_PyAlgo\/tree\/fast-matrix-cfpq"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0950-5849(98)00093-7"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/345099.345137"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/358438.349310"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","unstructured":"Chenghang Shi Haofeng Li Yulei Sui Jie Lu Lian Li and Jingling Xue. 2024. Artifact of \"Pearl: A Multi-Derivation Approach to Efficient CFL-Reachability Solving\". https:\/\/doi.org\/10.6084\/m9.figshare.23702271 10.6084\/m9.figshare.23702271","DOI":"10.6084\/m9.figshare.23702271"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2024.3437684"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290361"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1103845.1094817"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2014.2302311"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/SWAT.1971.10"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5441\/002\/edbt.2021.56"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(75)80046-8"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3093336.3037744"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-46523-4_38"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328897.1328464"}],"event":{"name":"SOAP '25: 14th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis","location":"Seoul Republic of Korea","acronym":"SOAP '25","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 14th ACM SIGPLAN International Workshop on the State Of the Art in Program Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3735544.3735585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,16]],"date-time":"2025-07-16T07:06:00Z","timestamp":1752649560000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3735544.3735585"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,6,13]]},"references-count":34,"alternative-id":["10.1145\/3735544.3735585","10.1145\/3735544"],"URL":"https:\/\/doi.org\/10.1145\/3735544.3735585","relation":{},"subject":[],"published":{"date-parts":[[2025,6,13]]},"assertion":[{"value":"2025-06-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}