{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T05:54:29Z","timestamp":1769752469103,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":42,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:00:00Z","timestamp":1653091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,5,21]]},"DOI":"10.1145\/3510003.3510227","type":"proceedings-article","created":{"date-parts":[[2022,7,5]],"date-time":"2022-07-05T22:42:59Z","timestamp":1657060979000},"page":"1706-1717","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["PReach"],"prefix":"10.1145","author":[{"given":"Seemanta","family":"Saha","sequence":"first","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mara","family":"Downing","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tegan","family":"Brennan","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tevfik","family":"Bultan","sequence":"additional","affiliation":[{"name":"University of California"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,7,5]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Apache Commons Lang. 2020. https:\/\/commons.apache.org\/proper\/commons-lang\/."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21690-4_15"},{"key":"e_1_3_2_1_3_1","volume-title":"Automatic Discovery and Quantification of Information Leaks. In 30th IEEE Symposium on Security and Privacy (S&P 2009","author":"Backes Michael","year":"2009","unstructured":"Michael Backes, Boris K\u00f6pf, and Andrey Rybalchenko. 2009. Automatic Discovery and Quantification of Information Leaks. In 30th IEEE Symposium on Security and Privacy (S&P 2009), 17--20 May 2009, Oakland, California, USA. 141--153."},{"key":"e_1_3_2_1_4_1","volume-title":"ISSTAC: Integrated Symbolic Execution for Space-Time Analysis of Code.","author":"Balasubramanian Daniel","year":"2017","unstructured":"Daniel Balasubramanian, Kasper Luckow, Corina P\u0103s\u0103reanu, Abdulbaki Aydin, Lucas Bang, Tevfik Bultan, Miroslav Gavrilov, Temesghen Kahsai, Rody Kersten, Dmitriy Kostyuchenko, Quoc-Sang Phan, Zhenkai Zhang, and Gabor Karsai. 2017. ISSTAC: Integrated Symbolic Execution for Space-Time Analysis of Code."},{"key":"e_1_3_2_1_5_1","first-page":"104","article-title":"Janalyzer: A Static Analysis Tool for Java Bytecode","volume":"17","author":"Balasubramanian Daniel","year":"2017","unstructured":"Daniel Balasubramanian, Zhenkai Zhang, Dan McDermet, and Gabor Karsai. 2017. Janalyzer: A Static Analysis Tool for Java Bytecode. ISIS 17 (2017), 104.","journal-title":"ISIS"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950362"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2018.00029"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-72013-1_24"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-71500-7_17"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786832"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 9th International NASA Formal Methods Symposium. 131--138","author":"Borges Mateus","unstructured":"Mateus Borges, Quoc-Sang Phan, Antonio Filieri, and Corina S. P\u0103s\u0103reanu. 2017. Model-Counting Approaches for Nonlinear Numerical Constraints. In Proceedings of the 9th International NASA Formal Methods Symposium. 131--138."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2408776.2408795"},{"key":"e_1_3_2_1_13_1","volume-title":"Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. 1722--1730","author":"Chakraborty Supratik","unstructured":"Supratik Chakraborty, Daniel J. Fremont, Kuldeep S. Meel, Sanjit A. Seshia, and Moshe Y. Vardi. 2014. Distribution-Aware Sampling and Weighted Model Counting for SAT. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence. 1722--1730."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. 3218--3224","author":"Chakraborty Supratik","unstructured":"Supratik Chakraborty, Kuldeep S. Meel, Rakesh Mistry, and Moshe Y. Vardi. 2016. Approximate Probabilistic Inference via Word-Level Counting. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence. 3218--3224."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884794"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98938-9_6"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486870"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635899"},{"key":"e_1_3_2_1_19_1","volume-title":"Speeding Up SMT-Based Quantitative Program Analysis. In In 12th International Workshop on Satisfiability Modulo Theories (SMT).","author":"Daniel","unstructured":"Daniel J. Fremont and Sanjit A. Seshia. 2014. Speeding Up SMT-Based Quantitative Program Analysis. In In 12th International Workshop on Satisfiability Modulo Theories (SMT)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2338965.2336773"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02658-4_52"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10009-004-0140-2"},{"key":"e_1_3_2_1_23_1","volume-title":"International School on Formal Methods for the Design of Computer, Communication and Software Systems","author":"Kwiatkowska Marta","unstructured":"Marta Kwiatkowska, Gethin Norman, and David Parker. 2007. Stochastic model checking. In International School on Formal Methods for the Design of Computer, Communication and Software Systems. Springer, 220--270."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2003.04.003"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2594291.2594331"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSE.2007.41"},{"key":"e_1_3_2_1_27_1","volume-title":"Randoop: Feedback-directed Random Testing for Java. In OOPSLA 2007 Companion","author":"Pacheco Carlos","unstructured":"Carlos Pacheco and Michael D. Ernst. 2007. Randoop: Feedback-directed Random Testing for Java. In OOPSLA 2007 Companion, Montreal, Canada. ACM."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3339002"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3293882.3330576"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1858996.1859035"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2346"},{"key":"e_1_3_2_1_32_1","volume-title":"Synthesis of Adaptive Side-Channel Attacks. In 30th IEEE Computer Security Foundations Symposium, CSF 2017","author":"Phan Quoc-Sang","year":"2017","unstructured":"Quoc-Sang Phan, Lucas Bang, Corina S. Pasareanu, Pasquale Malacaria, and Tevfik Bultan. 2017. Synthesis of Adaptive Side-Channel Attacks. In 30th IEEE Computer Security Foundations Symposium, CSF 2017, Santa Barbara, CA, USA, August 21--25, 2017. 328--342."},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2632362.2632367"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2382756.2382791"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"crossref","unstructured":"Seemanta Saha. 2022. PReach: A probabilistic reachability analyzer to identify hard to reach program statements. https:\/\/zenodo.org\/record\/5915206.","DOI":"10.1145\/3510003.3510227"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3364452.336445759"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3009837.3009885"},{"key":"e_1_3_2_1_38_1","volume-title":"Driller: Augmenting Fuzzing Through Selective Symbolic Execution. In 23rd Annual Network and Distributed System Security Symposium, NDSS 2016","author":"Stephens Nick","year":"2016","unstructured":"Nick Stephens, John Grosen, Christopher Salls, Andrew Dutcher, Ruoyu Wang, Jacopo Corbetta, Yan Shoshitaishvili, Christopher Kruegel, and Giovanni Vigna. 2016. Driller: Augmenting Fuzzing Through Selective Symbolic Execution. In 23rd Annual Network and Distributed System Security Symposium, NDSS 2016, San Diego, California, USA, February 21--24, 2016."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3180155.3180177"},{"key":"e_1_3_2_1_40_1","volume-title":"Watson libraries for analysis. wala. sourceforge. net\/wiki\/index. php. Main Page","author":"Watson IBM","year":"2006","unstructured":"IBM Watson. 2006. Watson libraries for analysis. wala. sourceforge. net\/wiki\/index. php. Main Page (2006)."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-89884-1_23"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Lei Zhao Yue Duan Heng Yin and Jifeng Xuan. 2019. Send Hardest Problems My Way: Probabilistic Path Prioritization for Hybrid Fuzzing.. In NDSS.","DOI":"10.14722\/ndss.2019.23504"}],"event":{"name":"ICSE '22: 44th International Conference on Software Engineering","location":"Pittsburgh Pennsylvania","acronym":"ICSE '22","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering","IEEE CS"]},"container-title":["Proceedings of the 44th International Conference on Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510227","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3510003.3510227","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:12:24Z","timestamp":1750191144000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3510003.3510227"}},"subtitle":["a heuristic for probabilistic reachability to identify hard to reach statements"],"short-title":[],"issued":{"date-parts":[[2022,5,21]]},"references-count":42,"alternative-id":["10.1145\/3510003.3510227","10.1145\/3510003"],"URL":"https:\/\/doi.org\/10.1145\/3510003.3510227","relation":{},"subject":[],"published":{"date-parts":[[2022,5,21]]},"assertion":[{"value":"2022-07-05","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}