{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,12]],"date-time":"2026-09-12T02:21:24Z","timestamp":1789179684707,"version":"build-2803163510"},"reference-count":110,"publisher":"Association for Computing Machinery (ACM)","issue":"OOPSLA2","funder":[{"name":"FWF","award":["10.55776\/PIN3275223"],"award-info":[{"award-number":["10.55776\/PIN3275223"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Program. Lang."],"published-print":{"date-parts":[[2025,10,9]]},"abstract":"<jats:p>\n                    Parsing\u2014the process of structuring a linear representation according to a given grammar\u2014is a fundamental activity in software engineering. While formal language theory has provided theoretical foundations for parsing, the most common kind of parsers used in practice are written\n                    <jats:italic toggle=\"yes\">ad hoc.<\/jats:italic>\n                    They use common string operations without explicitly defining an input grammar. These ad hoc parsers are often intertwined with application logic and can result in subtle semantic bugs. Grammars, which are complete formal descriptions of input languages, can enhance program comprehension, facilitate testing and debugging, and provide formal guarantees for parsing code. But writing grammars\u2014e.g., in the form of regular expressions\u2014can be tedious and error-prone. Inspired by the success of type inference in programming languages, we propose a general approach for static inference of regular input string grammars from unannotated ad hoc parser source code. We use refinement type inference to synthesize logical and string constraints that represent regular parsing operations, which we then interpret with an abstract semantics into regular expressions. Our contributions include a core calculus ??\n                    <jats:sub>\u03a3<\/jats:sub>\n                    for representing ad hoc parsers, a formulation of (regular) grammar inference as refinement inference, an abstract interpretation framework for solving string refinement variables, and a set of abstract domains for efficiently representing the constraints encountered during regular ad hoc parsing. We implement our approach in the\n                    <jats:monospace>Panini<\/jats:monospace>\n                    system and evaluate its efficacy on a benchmark of 204 Python ad hoc parsers. Compared with state-of-the-art approaches,\n                    <jats:monospace>Panini<\/jats:monospace>\n                    produces better grammars (100 % precision, 93 % average recall) in less time (0.82 \u00b1 2.85 s) without prior knowledge of the input space.\n                  <\/jats:p>","DOI":"10.1145\/3763054","type":"journal-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T08:49:50Z","timestamp":1759999790000},"page":"113-143","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Static Inference of Regular Grammars for Ad Hoc Parsers"],"prefix":"10.1145","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1496-0531","authenticated-orcid":false,"given":"Michael","family":"Schr\u00f6der","sequence":"first","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8619-1271","authenticated-orcid":false,"given":"J\u00fcrgen","family":"Cito","sequence":"additional","affiliation":[{"name":"TU Wien, Vienna, Austria"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2025,10,9]]},"reference":[{"key":"e_1_3_1_2_1","unstructured":"Cosku Acay. 2018. A Regular Expression Library for Haskell. Unpublished manuscript and source code (May 22 2018). [https:\/\/github.com\/cacay\/regexp](https:\/\/github.com\/cacay\/regexp)"},{"key":"e_1_3_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3605360"},{"key":"e_1_3_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/182.358434"},{"key":"e_1_3_1_5_1","unstructured":"Marco Almeida Nelma Moreiara and Rog\u00e9rio Reis. 2008. Testing the equivalence of regular expressions. Tech. rep. DCC-2007-07 Version 1.1 Universidade do Porto. https:\/\/www.dcc.fc.up.pt\/Pubs\/TR07\/dcc-2007-07.pdf"},{"key":"e_1_3_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3484198"},{"key":"e_1_3_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103368"},{"key":"e_1_3_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-54577-5_3"},{"key":"e_1_3_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(87)90052-6"},{"key":"e_1_3_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)00182-4"},{"key":"e_1_3_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(95)80024-4"},{"key":"e_1_3_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-94583-1_2"},{"key":"e_1_3_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.1961.13"},{"key":"e_1_3_1_14_1","doi-asserted-by":"publisher","unstructured":"Mohammad Rifat Arefin Suraj Shetiya Zili Wang and Christopher Csallner. 2024. Fast Deterministic Black-box Context-free Grammar Inference. ICSE \u201924: Proceedings of the IEEE\/ACM 46th International Conference on Software Engineering. Article 117 (Lisbon Portugal Apr. 14\u201320 2024). doi:10.1145\/3597503.3632914","DOI":"10.1145\/3597503.3632914"},{"key":"e_1_3_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1108792.1108813"},{"key":"e_1_3_1_16_1","unstructured":"Clark Barret Pascal Fontaine and Cesare Tinelli. 2016. The Satisfiability Modulo Theories Library (SMT-LIB). [https:\/\/www.smt-lib.org](https:\/\/www.smt-lib.org)"},{"key":"e_1_3_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3062341.3062349"},{"key":"e_1_3_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3519939.3523716"},{"key":"e_1_3_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-81688-3_14"},{"key":"e_1_3_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3635296.3635790"},{"key":"e_1_3_1_21_1","first-page":"1","volume-title":"Panini\u2019s Grammar and Computer Science","author":"Bhate Saroja","year":"1991","unstructured":"Saroja Bhate and Subhash Kak. 1991\u20131992. Panini\u2019s Grammar and Computer Science. Annals of the Bhandarkar Oriental Research Institute, 72, 1\u20137, 94. https:\/\/www.jstor.org\/stable\/41694883"},{"key":"e_1_3_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-23534-9_2"},{"key":"e_1_3_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00768-2_27"},{"key":"e_1_3_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-27481-7_23"},{"key":"e_1_3_1_25_1","unstructured":"William J. Bowman. 2022. The A means A. https:\/\/www.williamjbowman.com\/blog\/2022\/06\/30\/the-a-means-a\/"},{"key":"e_1_3_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-37051-9_6"},{"key":"e_1_3_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/321239.321249"},{"key":"e_1_3_1_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-68670-7"},{"key":"e_1_3_1_29_1","first-page":"209","volume-title":"Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation (San Diego, CA, USA, Dec. 8\u201310, 2008) (OSDI \u201908)","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 Proceedings of the 8th USENIX Symposium on Operating Systems Design and Implementation (San Diego, CA, USA, Dec. 8\u201310, 2008) (OSDI \u201908). USENIX Association, 209\u2013224. [http:\/\/usenix.org\/events\/osdi08\/tech\/full_papers\/cadar\/cadar.pdf](http:\/\/usenix.org\/events\/osdi08\/tech\/full_papers\/cadar\/cadar.pdf)"},{"key":"e_1_3_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1455518.1455522"},{"key":"e_1_3_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1571-0661(05)82596-4"},{"key":"e_1_3_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/3729273"},{"key":"e_1_3_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64437-6_18"},{"key":"e_1_3_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3290362"},{"key":"e_1_3_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2018.00009"},{"key":"e_1_3_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3110270"},{"key":"e_1_3_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.2218"},{"key":"e_1_3_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/263699.263744"},{"key":"e_1_3_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/512950.512973"},{"key":"e_1_3_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/567752.567778"},{"key":"e_1_3_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-35873-9_10"},{"key":"e_1_3_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1926385.1926399"},{"key":"e_1_3_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/512760.512770"},{"key":"e_1_3_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/582153.582176"},{"key":"e_1_3_1_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-30806-3_8"},{"key":"e_1_3_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/3372020.3391556"},{"key":"e_1_3_1_47_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_1_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/2509136.2509511"},{"key":"e_1_3_1_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3324884.3367576"},{"key":"e_1_3_1_50_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(79)80019-X"},{"key":"e_1_3_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/155090.155113"},{"key":"e_1_3_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44798-0_20"},{"key":"e_1_3_1_53_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-7373(84)80037-1"},{"key":"e_1_3_1_54_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(67)91115-6"},{"key":"e_1_3_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3368089.3409679"},{"key":"e_1_3_1_56_1","unstructured":"Rahul Gopinath Bjorn Matis and Andreas Zeller. 2020. Replication package for Mining Input Grammars from Dynamic Control Flow. [https:\/\/doi.org\/10.5281\/zenodo.3876969](https:\/\/doi.org\/10.5281\/zenodo.3876969)"},{"key":"e_1_3_1_57_1","doi-asserted-by":"publisher","unstructured":"Matthias Hague Denghang Hu Artur Je\u017c Anthony W. Lin Oliver Markgraf Philipp R\u00fcmmer and Zhilin Wu. 2025. OSTRICH: Solver for Complex String Constraints. arXiv preprint (Aug. 15 2025). doi:10.48550\/arXiv.2506.14363","DOI":"10.48550\/arXiv.2506.14363"},{"key":"e_1_3_1_58_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9947-1969-0253905-6"},{"key":"e_1_3_1_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278168.3278193"},{"key":"e_1_3_1_60_1","doi-asserted-by":"publisher","DOI":"10.1145\/3158092"},{"key":"e_1_3_1_61_1","first-page":"445","volume-title":"Proceedings of the 21st USENIX Security Symposium (Bellevue, WA, USA, Aug. 8\u201310, 2012)","author":"Holler Christian","year":"2012","unstructured":"Christian Holler, Kim Herzig, and Andreas Zeller. 2012. Fuzzing with Code Fragments. In Proceedings of the 21st USENIX Security Symposium (Bellevue, WA, USA, Aug. 8\u201310, 2012). USENIX Association, 445\u2013458. [https:\/\/www.usenix.org\/system\/files\/conference\/usenixsecurity12\/sec12-final73.pdf](https:\/\/www.usenix.org\/system\/files\/conference\/usenixsecurity12\/sec12-final73.pdf)"},{"key":"e_1_3_1_62_1","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft John E.","year":"1979","unstructured":"John E. Hopcroft and Jeffrey D. Ullman. 1979. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley. ISBN: 0-201-02988-X"},{"key":"e_1_3_1_63_1","doi-asserted-by":"publisher","DOI":"10.1145\/2970276.2970321"},{"key":"e_1_3_1_64_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2011.12.003"},{"key":"e_1_3_1_65_1","doi-asserted-by":"publisher","unstructured":"Malte Isberner. 2015. Foundations of Active Automata Learning: An Algorithmic Perspective. Ph.D. Dissertation TU Dortmund. doi:10.17877\/DE290R-16359","DOI":"10.17877\/DE290R-16359"},{"key":"e_1_3_1_66_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-11164-3_26"},{"key":"e_1_3_1_67_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03237-0_17"},{"key":"e_1_3_1_68_1","doi-asserted-by":"publisher","unstructured":"Ranjit Jhala and Niki Vazou. 2020. Refinement Types: A Tutorial. arXiv preprint (Oct. 15 2020). doi:10.48550\/arXiv.2010.07763","DOI":"10.48550\/arXiv.2010.07763"},{"key":"e_1_3_1_69_1","volume-title":"Yacc: A Parser Generator","author":"Hume Andrew","unstructured":"Andrew Hume and Doug McIlroy. Yacc: A Parser Generator. AT&T Bell Labs. UNIX Research System Papers, Vol. 2 (10th ed.). ISBN: 0-03-047529-5"},{"key":"e_1_3_1_70_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jsc.2021.08.003"},{"key":"e_1_3_1_71_1","doi-asserted-by":"publisher","DOI":"10.1145\/3497775.3503691"},{"key":"e_1_3_1_72_1","doi-asserted-by":"publisher","DOI":"10.1145\/3533767.3534406"},{"key":"e_1_3_1_73_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635904"},{"key":"e_1_3_1_74_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643003"},{"key":"e_1_3_1_75_1","doi-asserted-by":"publisher","DOI":"10.4230\/LIPIcs.FSTTCS.2014.175"},{"key":"e_1_3_1_76_1","unstructured":"Edward Kmett. 2012. charset: Fast unicode character sets based on complemented PATRICIA tries. source code (2012). [https:\/\/hackage.haskell.org\/package\/charset](https:\/\/hackage.haskell.org\/package\/charset)"},{"key":"e_1_3_1_77_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-50777-8"},{"key":"e_1_3_1_78_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE51524.2021.9678879"},{"key":"e_1_3_1_79_1","unstructured":"Kevin J. Lang. 1999. Faster Algorithms for Finding Minimal Consistent DFAs. NEC Research Institute. Tech. rep. (Dec. 12 1999). https:\/\/citeseerx.ist.psu.edu\/document?doi=f74c5462cec67439490bf73f652ecd7d5f3f2679"},{"key":"e_1_3_1_80_1","unstructured":"Daan Leijen and Erik Meijer. 2001. Parsec: Direct Style Monadic Parser Combinators for the Real World. Utrecht University. Tech. rep. UU-CS-2001-35. https:\/\/ics-archive.science.uu.nl\/research\/techreps\/repo\/CS-2001\/2001-35.pdf"},{"key":"e_1_3_1_81_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22110-1_49"},{"key":"e_1_3_1_82_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.scico.2009.04.004"},{"key":"e_1_3_1_83_1","doi-asserted-by":"publisher","DOI":"10.1145\/3092282.3092295"},{"key":"e_1_3_1_84_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37703-7_9"},{"key":"e_1_3_1_85_1","doi-asserted-by":"publisher","DOI":"10.1109\/SecDev.2016.019"},{"key":"e_1_3_1_86_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90870-6_21"},{"key":"e_1_3_1_87_1","doi-asserted-by":"publisher","DOI":"10.1145\/321479.321481"},{"key":"e_1_3_1_88_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.2647"},{"key":"e_1_3_1_89_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67067-2_13"},{"key":"e_1_3_1_90_1","unstructured":"Greg Nelson. 1980. Techniques for Program Verification. Ph.D. Dissertation Stanford University. https:\/\/people.eecs.berkeley.edu\/~necula\/Papers\/nelson-thesis.pdf"},{"key":"e_1_3_1_91_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-08970-6_29"},{"key":"e_1_3_1_92_1","unstructured":"Chris Okasaki and Andy Gill. 1998. Fast Mergeable Integer Maps. In Proceedings of the 1998 ACM SIGPLAN Workshop on ML (Baltimore MD USA Sept. 26 1998). 77\u201386. https:\/\/citeseerx.ist.psu.edu\/document?doi=bf0657d381196a93bc17220f1999dc40ee35e64a"},{"key":"e_1_3_1_93_1","doi-asserted-by":"publisher","unstructured":"Inferring Regular Languages in Polynomial Update Time. Pattern Recognition and Image Analysis. Selected Papers from the IVth Spanish Symposium. doi:10.1142\/9789812797902_0004","DOI":"10.1142\/9789812797902_0004"},{"key":"e_1_3_1_94_1","doi-asserted-by":"publisher","DOI":"10.1007\/1-4020-8141-3_34"},{"key":"e_1_3_1_95_1","doi-asserted-by":"publisher","DOI":"10.1145\/2908080.2908099"},{"key":"e_1_3_1_96_1","doi-asserted-by":"publisher","DOI":"10.1145\/2989225.2989228"},{"key":"e_1_3_1_97_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380250705"},{"key":"e_1_3_1_98_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375602"},{"key":"e_1_3_1_99_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2010.38"},{"key":"e_1_3_1_100_1","doi-asserted-by":"publisher","unstructured":"Michael Schr\u00f6der and J\u00fcrgen Cito. 2025. Artifact for \u201cStatic Inference of Regular Grammars for Ad Hoc Parsers\u201d. Version oopsla25 (Aug. 2025). doi:10.5281\/zenodo.16928759","DOI":"10.5281\/zenodo.16928759"},{"key":"e_1_3_1_101_1","doi-asserted-by":"publisher","unstructured":"Michael Schr\u00f6der and J\u00fcrgen Cito. 2022. Grammars of Tree: Toward Grammar Inference for Ad Hoc Parsers. In Proceedings of the 2022 ACM\/IEEE 44th International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER 2022) (Pittsburgh PA USA May 22\u201327 2022). IEEE Computer Society 41\u201345. doi:10.1145\/3510455.3512787","DOI":"10.1145\/3510455.3512787"},{"key":"e_1_3_1_102_1","doi-asserted-by":"publisher","unstructured":"Michael Schr\u00f6der Marc Goritschnig and J\u00fcrgen Cito. 2023. An Exploratory Study of Ad Hoc Parsers in Python. arXiv preprint (Apr. 19 2023). doi:10.48550\/arXiv.2304.09733","DOI":"10.48550\/arXiv.2304.09733"},{"key":"e_1_3_1_103_1","doi-asserted-by":"publisher","unstructured":"Mohamed Nassim Seghir and Daniel Kroening. 2013. Counterexample-Guided Precondition Inference. In Programming Languages and Systems. 22nd European Symposium on Programming ESOP 2013 (Rome Italy March 2013). Springer 451\u2013471. doi:10.1007\/978-3-642-37036-6_25","DOI":"10.1007\/978-3-642-37036-6_25"},{"key":"e_1_3_1_104_1","doi-asserted-by":"publisher","unstructured":"Axel Simon Andy King and Jacob M. Howe. 2003. Two Variables per Linear Inequality as an Abstract Domain. In Logic Based Program Synthesis and Transformation. 12th International Workshop LOPSTR 2002 (Madrid Spain September 2002). Springer 71\u201389. doi:10.1007\/3-540-45013-0_7","DOI":"10.1007\/3-540-45013-0_7"},{"key":"e_1_3_1_105_1","doi-asserted-by":"publisher","unstructured":"Caleb Stanford Margus Veanes and Nikolaj Bj\u00f8rner. 2021. Symbolic Boolean Derivatives for Efficiently Solving Extended Regular Expression Constraints. In PLDI \u201921: Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (Virtual June 20\u201325 2021). Association for Computing Machinery 635\u2013650. doi:10.1145\/3453483.3454066","DOI":"10.1145\/3453483.3454066"},{"key":"e_1_3_1_106_1","volume-title":"The Unicode Standard, Version 16.0.0","year":"2024","unstructured":"The Unicode Standard, Version 16.0.0. The Unicode Consortium. 2024. https:\/\/www.unicode.org\/versions\/Unicode16.0.0\/"},{"key":"e_1_3_1_107_1","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"e_1_3_1_108_1","doi-asserted-by":"publisher","unstructured":"Minh-Thai Trinh Duc-Hiep Chu and Joxan Jaffar. 2020. Inter-theory Dependency Analysis for SMT String Solvers. Proceedings of the ACM on Programming Languages. 4 OOPSLA. doi:10.1145\/3428260","DOI":"10.1145\/3428260"},{"key":"e_1_3_1_109_1","doi-asserted-by":"publisher","unstructured":"Niki Vazou Eric Seidel Ranjit Jhala Dimitrios Vytiniotis and Simon Peyton-Jones. 2014. Refinement Types for Haskell. In ICFP \u201914: Proceedings of the 19th ACM SIGPLAN International Conference on Functional Programming (Gothenburg Sweden Sept. 1\u20136 2014). Association for Computing Machinery 269\u2013282. doi:10.1145\/2628136.2628161","DOI":"10.1145\/2628136.2628161"},{"key":"e_1_3_1_110_1","doi-asserted-by":"publisher","unstructured":"Alessandro Warth and Ian Piumarta. 2007. OMeta: An Object-Oriented Language for Pattern Matching. In DLS \u201907: Proceedings of the 2007 Symposium on Dynamic Languages (Montreal QC Canada Oct. 22 2007). Association for Computing Machinery 11\u201319. doi:10.1145\/1297081.1297086","DOI":"10.1145\/1297081.1297086"},{"key":"e_1_3_1_111_1","volume-title":"The Fuzzing Book","author":"Zeller Andreas","year":"2024","unstructured":"Andreas Zeller, Rahul Gopinath, Marcel Bohme, Gordon Fraser, and Christian Holler. 2024. The Fuzzing Book. CISPA Helmholtz Center for Information Security. https:\/\/www.fuzzingbook.org\/."}],"container-title":["Proceedings of the ACM on Programming Languages"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,7,16]],"date-time":"2026-07-16T10:01:12Z","timestamp":1784196072000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3763054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,9]]},"references-count":110,"journal-issue":{"issue":"OOPSLA2","published-print":{"date-parts":[[2025,10,9]]}},"alternative-id":["10.1145\/3763054"],"URL":"https:\/\/doi.org\/10.1145\/3763054","relation":{},"ISSN":["2475-1421"],"issn-type":[{"value":"2475-1421","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,10,9]]},"assertion":[{"value":"2024-10-13","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-10-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}