1key,doi_or_arxiv,verified_via,verified_title,match2czerwinski2019petri,10.1145/3313276.3316369,crossref,The reachability problem for Petri nets is not elementary,yes3czerwinski2021ackermann,10.1109/FOCS52979.2021.00120,crossref,Reachability in Vector Addition Systems is Ackermann-complete,yes4leroux2021notprimitive,10.1109/FOCS52979.2021.00121,crossref,The Reachability Problem for Petri Nets is Not Primitive Recursive,yes5wang2024llmtesting,10.1109/tse.2024.3368208,crossref,"Software Testing With Large Language Models: Survey, Landscape, and Vision",yes6zhang2022mltesting,10.1109/tse.2019.2962027,crossref,"Machine Learning Testing: Survey, Landscapes and Horizons",yes7cui2026genaiwork,10.1287/mnsc.2025.00535,crossref,The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Developers,yes8li2024llift,10.1145/3649828,crossref,Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach,yes9yang2024whitefox,10.1145/3689736,crossref,WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models,yes10baghdadi2019tiramisu,10.1109/cgo.2019.8661197,crossref,Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code,yes11wang2018mlcompiler,10.1109/jproc.2018.2817118,crossref,Machine Learning in Compiler Optimization,yes12ashouri2018autotuning,10.1145/3197978,crossref,A Survey on Compiler Autotuning using Machine Learning,yes13cummins2025llmcompiler,10.1145/3708493.3712691,crossref,LLM Compiler: Foundation Language Models for Compiler Optimization,yes14munley2024llm4vv,10.1016/j.future.2024.05.034,crossref,LLM4VV: Developing LLM-driven testsuite for compiler validation,yes15barbosa2022cvc5,10.1007/978-3-030-99524-9_24,crossref,cvc5: A Versatile and Industrial-Strength SMT Solver,yes16beyer2024svcomp,10.1007/978-3-031-57256-2_15,crossref,State of the Art in Software Verification and Witness Validation: SV-COMP 2024,yes17katz2019marabou,10.1007/978-3-030-25540-4_26,crossref,The Marabou Framework for Verification and Analysis of Deep Neural Networks,yes18singh2019deeppoly,10.1145/3290354,crossref,An abstract domain for certifying neural networks,yes19permenev2020verx,10.1109/sp40000.2020.00024,crossref,VerX: Safety Verification of Smart Contracts,yes20willsey2021egg,10.1145/3434304,crossref,egg: Fast and extensible equality saturation,yes21kalra2018zeus,10.14722/ndss.2018.23082,crossref,ZEUS: Analyzing Safety of Smart Contracts,yes22papadakis2019mutation,10.1016/bs.adcom.2018.03.015,crossref,Mutation Testing Advances: An Analysis and Survey,yes23abualigah2021aoa,10.1016/j.cma.2020.113609,crossref,The Arithmetic Optimization Algorithm,yes24abualigah2021aquila,10.1016/j.cie.2021.107250,crossref,Aquila Optimizer: A novel meta-heuristic optimization algorithm,yes25biere2021handbook,10.3233/faia336,crossref,Handbook of Satisfiability,yes26li2019kolmogorov,10.1007/978-3-030-11298-1,crossref,An Introduction to Kolmogorov Complexity and Its Applications,yes27sorensen2013metaphor,10.1111/itor.12001,crossref,Metaheuristics—the metaphor exposed,yes28aranha2021metaphor,10.1007/s11721-021-00202-9,crossref,"Metaphor-based metaheuristics, a call for action: the elephant in the room",yes29camachovillalon2022exposing,10.1111/itor.13176,crossref,"Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization techniques inspired by<i>bestial</i>metaphors",yes30mitzenmacher2022predictions,10.1145/3528087,crossref,Algorithms with predictions,yes31mankowitz2023alphadev,10.1038/s41586-023-06004-9,crossref,Faster sorting algorithms discovered using deep reinforcement learning,yes32lopes2021alive2,10.1145/3453483.3454030,crossref,Alive2: bounded translation validation for LLVM,yes33yang2011csmith,10.1145/1993498.1993532,crossref,Finding and understanding bugs in C compilers,yes34xia2024fuzz4all,10.1145/3597503.3639121,crossref,Fuzz4All: Universal Fuzzing with Large Language Models,yes35xia2023apr,10.1109/ICSE48619.2023.00129,crossref,Automated Program Repair in the Era of Large Pre-trained Language Models,yes36kang2023fewshottesters,10.1109/icse48619.2023.00194,crossref,Large Language Models are Few-shot Testers: Exploring LLM-based General Bug Reproduction,yes37lattuada2024verus,10.1145/3694715.3695952,crossref,Verus: A Practical Foundation for Systems Verification,yes38brix2023vnncomp,10.1007/s10009-023-00703-4,crossref,First three years of the international verification of neural networks competition (VNN-COMP),yes39katz2017reluplex,10.1007/978-3-319-63387-9_5,crossref,Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks,yes40cygan2015parameterized,10.1007/978-3-319-21275-3,crossref,Parameterized Algorithms,yes41vassilevskawilliams2019finegrained,10.1142/9789813272880_0188,crossref,On some fine-grained questions in algorithms and complexity,yes42lykouris2021caching,10.1145/3447579,crossref,Competitive Caching with Machine Learned Advice,yes43chen2018metamorphicsurvey,10.1145/3143561,crossref,Metamorphic Testing,yes44perry2023insecure,10.1145/3576915.3623157,crossref,Do Users Write More Insecure Code with AI Assistants?,yes45ragankelley2013halide,10.1145/2491956.2462176,crossref,"Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines",yes46merrill2023parallelism,10.1162/tacl_a_00562,crossref,The Parallelism Tradeoff: Limitations of Log-Precision Transformers,yes47strobl2024survey,10.1162/tacl_a_00663,crossref,What Formal Languages Can Transformers Express? A Survey,yes48willsey2026eggcacm,10.1145/3815481,crossref,egg: Fast and Extensible Equality Saturation,yes49lynch2026ioautomata,10.1145/3788687,crossref,An Introduction to Input/Output Automata,yes50bernstein2022negative,10.1109/focs54457.2022.00063,crossref,Negative-Weight Single-Source Shortest Paths in Near-linear Time,yes51duan2025sorting,10.1145/3717823.3718179,crossref,Breaking the Sorting Barrier for Directed Single-Source Shortest Paths,yes52williams2025sqrtspace,10.1145/3717823.3718225,crossref,Simulating Time with Square-Root Space,yes53farachcolton2024openaddressing,10.1109/focs61266.2024.00045,crossref,Optimal Bounds for Open Addressing Without Reordering,yes54jakubuv2023mizar,10.4230/lipics.itp.2023.19,datacite,MizAR 60 for Mizar 50,yes55chen2025apiss,10.4230/lipics.ecoop.2025.6,datacite,Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Open-Source Repositories,yes56pham2025kdtree,10.4230/lipics.wads.2025.45,datacite,Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences,yes57langedal2024mis,10.4230/lipics.sea.2024.20,datacite,Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks,yes58naqvi2026bigger,10.4230/lipics.esem.2026.34,datacite,Bigger Is Not Always Better: Performance and Sustainability Trade-Offs in LLMs for Python Bug-Fixing Tasks,yes59klampfl2024asp,10.4230/oasics.dx.2024.10,datacite,"Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and Autonomous Driving Systems",yes60gasparlopes2025vuln,10.4230/oasics.icpec.2025.4,datacite,Can Open Large Language Models Catch Vulnerabilities?,yes61awadid2025robust,10.4230/oasics.saia.2024.1,datacite,On Assessing ML Model Robustness: A Methodological Framework (Academic Track),yes62becker2025metr,arXiv:2507.09089,arxiv,Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity,yes63yang2023leandojo,arXiv:2306.15626,arxiv,LeanDojo: Theorem Proving with Retrieval-Augmented Language Models,yes64xin2024deepseekprover,arXiv:2405.14333,arxiv,DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data,yes65yang2024sweagent,arXiv:2405.15793,arxiv,SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering,yes66novikov2025alphaevolve,arXiv:2506.13131,arxiv,AlphaEvolve: A coding agent for scientific and algorithmic discovery,yes67