1czerwinski2019petri crossref 10.1145/3313276.3316369 2019 Czerwiński Wojciech Proceedings of the 51st Annual ACM SIGACT Symposium on Theor The reachability problem for Petri nets is not elementary proceedings-article2czerwinski2021ackermann crossref 10.1109/FOCS52979.2021.00120 2022 Czerwinski Wojciech 2021 IEEE 62nd Annual Symposium on Foundations of Computer S Reachability in Vector Addition Systems is Ackermann-complete proceedings-article3leroux2021notprimitive crossref 10.1109/FOCS52979.2021.00121 2022 Leroux Jerome 2021 IEEE 62nd Annual Symposium on Foundations of Computer S The Reachability Problem for Petri Nets is Not Primitive Recursive proceedings-article4wang2024llmtesting crossref 10.1109/tse.2024.3368208 2024 Wang Junjie IEEE Transactions on Software Engineering Software Testing With Large Language Models: Survey, Landscape, and Vision journal-article5zhang2020mltesting crossref 10.1109/tse.2019.2962027 2022 Zhang Jie M. IEEE Transactions on Software Engineering Machine Learning Testing: Survey, Landscapes and Horizons journal-article6cui2026genaiwork crossref 10.1287/mnsc.2025.00535 2026 Cui Kevin Zheyuan Management Science The Effects of Generative AI on High-Skilled Work: Evidence from Three Field Experiments with Software Develop journal-article7li2024llift crossref 10.1145/3649828 2024 Li Haonan Proceedings of the ACM on Programming Languages Enhancing Static Analysis for Practical Bug Detection: An LLM-Integrated Approach journal-article8yang2024whitefox crossref 10.1145/3689736 2024 Yang Chenyuan Proceedings of the ACM on Programming Languages WhiteFox: White-Box Compiler Fuzzing Empowered by Large Language Models journal-article9baghdadi2019tiramisu crossref 10.1109/cgo.2019.8661197 2019 Baghdadi Riyadh 2019 IEEE/ACM International Symposium on Code Generation and Tiramisu: A Polyhedral Compiler for Expressing Fast and Portable Code proceedings-article10wang2018mlcompiler crossref 10.1109/jproc.2018.2817118 2018 Wang Zheng Proceedings of the IEEE Machine Learning in Compiler Optimization journal-article11ashouri2018autotuning crossref 10.1145/3197978 2018 Ashouri Amir H. ACM Computing Surveys A Survey on Compiler Autotuning using Machine Learning journal-article12cummins2025llmcompiler crossref 10.1145/3708493.3712691 2025 Cummins Chris Proceedings of the 34th ACM SIGPLAN International Conference LLM Compiler: Foundation Language Models for Compiler Optimization proceedings-article13munley2024llm4vv crossref 10.1016/j.future.2024.05.034 2024 Munley Christian Future Generation Computer Systems LLM4VV: Developing LLM-driven testsuite for compiler validation journal-article14barbosa2022cvc5 crossref 10.1007/978-3-030-99524-9_24 2022 Barbosa Haniel Lecture Notes in Computer Science cvc5: A Versatile and Industrial-Strength SMT Solver book-chapter15beyer2024svcomp crossref 10.1007/978-3-031-57256-2_15 2024 Beyer Dirk Lecture Notes in Computer Science State of the Art in Software Verification and Witness Validation: SV-COMP 2024 book-chapter16katz2019marabou crossref 10.1007/978-3-030-25540-4_26 2019 Katz Guy Lecture Notes in Computer Science The Marabou Framework for Verification and Analysis of Deep Neural Networks book-chapter17singh2019deeppoly crossref 10.1145/3290354 2019 Singh Gagandeep Proceedings of the ACM on Programming Languages An abstract domain for certifying neural networks journal-article18permenev2020verx crossref 10.1109/sp40000.2020.00024 2020 Permenev Anton 2020 IEEE Symposium on Security and Privacy (SP) VerX: Safety Verification of Smart Contracts proceedings-article19willsey2021egg crossref 10.1145/3434304 2021 Willsey Max Proceedings of the ACM on Programming Languages egg: Fast and extensible equality saturation journal-article20kalra2018zeus crossref 10.14722/ndss.2018.23082 2018 Kalra Sukrit Proceedings 2018 Network and Distributed System Security Sym ZEUS: Analyzing Safety of Smart Contracts proceedings-article21papadakis2019mutation crossref 10.1016/bs.adcom.2018.03.015 2019 Advances in Computers Mutation Testing Advances: An Analysis and Survey book-chapter22abualigah2021aoa crossref 10.1016/j.cma.2020.113609 2021 Abualigah Laith Computer Methods in Applied Mechanics and Engineering The Arithmetic Optimization Algorithm journal-article23abualigah2021aquila crossref 10.1016/j.cie.2021.107250 2021 Abualigah Laith Computers & Industrial Engineering Aquila Optimizer: A novel meta-heuristic optimization algorithm journal-article24biere2021handbook crossref 10.3233/faia336 2021 Frontiers in Artificial Intelligence and Applications Handbook of Satisfiability edited-book25li2019kolmogorov crossref 10.1007/978-3-030-11298-1 2019 Li Ming Texts in Computer Science An Introduction to Kolmogorov Complexity and Its Applications book26jakubuv2023mizar crossref 10.4230/lipics.itp.2023.19 ERROR HTTP Error 404: Not Found 27ecoop2025apiss crossref 10.4230/lipics.ecoop.2025.6 ERROR HTTP Error 404: Not Found 28wads2025kdtree crossref 10.4230/lipics.wads.2025.45 ERROR HTTP Error 404: Not Found 29sea2024mis crossref 10.4230/lipics.sea.2024.20 ERROR HTTP Error 404: Not Found 30sorensen2015metaphor crossref 10.1111/itor.12001 2013 Sörensen Kenneth International Transactions in Operational Research Metaheuristics—the metaphor exposed journal-article31aranha2022metaphor crossref 10.1007/s11721-021-00202-9 2021 Aranha Claus Swarm Intelligence Metaphor-based metaheuristics, a call for action: the elephant in the room journal-article32camachovillalon2023exposing crossref 10.1111/itor.13176 2022 Camacho‐Villalón Christian L. International Transactions in Operational Research Exposing the grey wolf, moth‐flame, whale, firefly, bat, and antlion algorithms: six misleading optimization t journal-article33mitzenmacher2022predictions crossref 10.1145/3528087 2022 Mitzenmacher Michael Communications of the ACM Algorithms with predictions journal-article34mankowitz2023alphadev crossref 10.1038/s41586-023-06004-9 2023 Mankowitz Daniel J. Nature Faster sorting algorithms discovered using deep reinforcement learning journal-article35lopes2021alive2 crossref 10.1145/3453483.3454030 2021 Lopes Nuno P. Proceedings of the 42nd ACM SIGPLAN International Conference Alive2: bounded translation validation for LLVM proceedings-article36yang2011csmith crossref 10.1145/1993498.1993532 2011 Yang Xuejun Proceedings of the 32nd ACM SIGPLAN Conference on Programmin Finding and understanding bugs in C compilers proceedings-article37xia2024fuzz4all crossref 10.1145/3597503.3639121 2024 Xia Chunqiu Steven Proceedings of the IEEE/ACM 46th International Conference on Fuzz4All: Universal Fuzzing with Large Language Models proceedings-article38xia2023apr crossref 10.1109/ICSE48619.2023.00129 2023 Xia Chunqiu Steven 2023 IEEE/ACM 45th International Conference on Software Engi Automated Program Repair in the Era of Large Pre-trained Language Models proceedings-article39kang2023fewshottesters crossref 10.1109/ICSE48619.2023.00051 2023 Yan Yutian 2023 IEEE/ACM 45th International Conference on Software Engi Adhere: Automated Detection and Repair of Intrusive Ads proceedings-article40lattuada2024verus crossref 10.1145/3694715.3695952 2024 Lattuada Andrea Proceedings of the ACM SIGOPS 30th Symposium on Operating Sy Verus: A Practical Foundation for Systems Verification proceedings-article41brix2023vnncomp crossref 10.1007/s10009-023-00703-4 2023 Brix Christopher International Journal on Software Tools for Technology Trans First three years of the international verification of neural networks competition (VNN-COMP) journal-article42katz2017reluplex crossref 10.1007/978-3-319-63387-9_5 2017 Katz Guy Lecture Notes in Computer Science Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks book-chapter43cygan2015parameterized crossref 10.1007/978-3-319-21275-3 2015 Cygan Marek Parameterized Algorithms book44williams2018finegrainedicm crossref 10.1142/9789813272880_0188 2019 WILLIAMS VIRGINIA VASSILEVSKA Proceedings of the International Congress of Mathematicians ON SOME FINE-GRAINED QUESTIONS IN ALGORITHMS AND COMPLEXITY proceedings-article45lykouris2021caching crossref 10.1145/3447579 2021 Lykouris Thodoris Journal of the ACM Competitive Caching with Machine Learned Advice journal-article46chen2018metamorphicsurvey crossref 10.1145/3143561 2018 Chen Tsong Yueh ACM Computing Surveys Metamorphic Testing journal-article47perry2023insecure crossref 10.1145/3576915.3623157 2023 Perry Neil Proceedings of the 2023 ACM SIGSAC Conference on Computer an Do Users Write More Insecure Code with AI Assistants? proceedings-article48ragankelley2013halide crossref 10.1145/2491956.2462176 2013 Ragan-Kelley Jonathan Proceedings of the 34th ACM SIGPLAN Conference on Programmin Halide proceedings-article49merrill2023parallelism crossref 10.1162/tacl_a_00562 2023 Merrill William Transactions of the Association for Computational Linguistic The Parallelism Tradeoff: Limitations of Log-Precision Transformers journal-article50strobl2024survey crossref 10.1162/tacl_a_00663 2024 Strobl Lena Transactions of the Association for Computational Linguistic What Formal Languages Can Transformers Express? A Survey journal-article51gelernter2025cacm_egg crossref 10.1145/3815481 2026 Willsey Max Communications of the ACM egg: Fast and Extensible Equality Saturation journal-article52lynch2026ioautomata crossref 10.1145/3788687 2026 Lynch Nancy A. Formal Aspects of Computing An Introduction to Input/Output Automata journal-article53esem2026translation crossref 10.4230/lipics.esem.2026.34 ERROR HTTP Error 404: Not Found 54dx2024asp crossref 10.4230/oasics.dx.2024.10 ERROR HTTP Error 404: Not Found 55icpec2025vuln crossref 10.4230/oasics.icpec.2025.4 ERROR HTTP Error 404: Not Found 56saia2024robust crossref 10.4230/oasics.saia.2024.1 ERROR HTTP Error 404: Not Found 57bernstein2022negative crossref-query 10.1109/focs54457.2022.00063 2022 Bernstein Aaron 2022 IEEE 63rd Annual Symposium on Foundations of Computer S Negative-Weight Single-Source Shortest Paths in Near-linear Time proceedings-article58bernstein2022negative crossref-query 10.1145/3742890 2025 Bernstein Aaron Journal of the ACM Negative-Weight Single-Source Shortest Paths in Near-linear Time journal-article59bernstein2022negative crossref-query 10.1145/3631536 2025 Bernstein Aaron Communications of the ACM Negative-Weight Single-Source Shortest Paths in Near-Linear Time journal-article60duan2025sorting crossref-query 10.1145/3849867 2026 Duan Ran Journal of the ACM Breaking the Sorting Barrier for Directed Single-Source Shortest Paths journal-article61duan2025sorting crossref-query 10.1145/3717823.3718179 2025 Duan Ran Proceedings of the 57th Annual ACM Symposium on Theory of Co Breaking the Sorting Barrier for Directed Single-Source Shortest Paths proceedings-article62duan2025sorting crossref-query 10.1007/springerreference_57896 None SpringerReference Single-Source Shortest Paths, 1999; Thorup reference-entry63williams2025sqrtspace crossref-query 10.1145/3717823.3718225 2025 Williams R. Ryan Proceedings of the 57th Annual ACM Symposium on Theory of Co Simulating Time with Square-Root Space proceedings-article64williams2025sqrtspace crossref-query 10.1145/3798104 2026 Williams Ryan Journal of the ACM Simulating Time with Square-Root Space journal-article65williams2025sqrtspace crossref-query 10.2514/6.1986-2049 1986 WILLIAMS T. Astrodynamics Conference A square root method for the identification of large space structures proceedings-article66farachcolton2024openaddressing crossref-query 10.1109/focs61266.2024.00045 2024 Farach-Colton Martín 2024 IEEE 65th Annual Symposium on Foundations of Computer S Optimal Bounds for Open Addressing Without Reordering proceedings-article67farachcolton2024openaddressing crossref-query 10.21203/rs.3.rs-10296712/v1 2026 Herrera Mauricio Cache Lines, Not Probes: The Memory-Access Cost of Open Addressing Without Reordering posted-content68farachcolton2024openaddressing crossref-query 10.1109/focs61266.2024.00047 2024 Bender Michael A. 2024 IEEE 65th Annual Symposium on Foundations of Computer S Tight Bounds for Classical Open Addressing proceedings-article69alphaproof2025 crossref-query 10.20944/preprints202610.0774.v1 2026 Chen Yiyuan SCOPE-RL: Reinforcement Learning with Executable Step-Level Verification for Mathematical Reasoning posted-content70alphaproof2025 crossref-query 10.1017/cbo9780511543326.005 2005 Rippling: Meta-Level Guidance for Mathematical Reasoning A formal account of rippling book-chapter71alphaproof2025 crossref-query 10.18653/v1/2025.findings-acl.935 2025 Zhao Xueliang Findings of the Association for Computational Linguistics: A PromptCoT: Synthesizing Olympiad-level Problems for Mathematical Reasoning in Large Language Models proceedings-article72becker2025metr arxiv 2507.09089 2025-07-12 Joel Becker arXiv Measuring the Impact of Early-2025 AI on Experienced Open-Source Developer Productivity 73yang2023leandojo arxiv 2306.15626 ERROR The read operation timed out 74xin2024deepseekprover arxiv 2405.14333 2024-05-23 Huajian Xin arXiv DeepSeek-Prover: Advancing Theorem Proving in LLMs through Large-Scale Synthetic Data 75yang2024sweagent arxiv 2405.15793 2024-05-06 John Yang arXiv SWE-agent: Agent-Computer Interfaces Enable Automated Software Engineering 76selsam2019neurosat arxiv 1802.03685 ERROR HTTP Error 503: Service Unavailable 77novikov2025alphaevolve arxiv 2506.13131 2025-06-16 Alexander Novikov arXiv AlphaEvolve: A coding agent for scientific and algorithmic discovery 78purohit2018predictions openalex W2891784792 2024 Ravi Kumar arXiv (Cornell University) Improving Online Algorithms via ML Predictions https://doi.org/10.48550/arxiv.2407.1771279jakubuv2023mizar datacite 10.4230/lipics.itp.2023.19 2023 Jakubův, Jan; Chvalovský, Karel; Goertzel, Zarathustra LIPIcs, Volume 268, ITP 2023 MizAR 60 for Mizar 5080ecoop2025apiss datacite 10.4230/lipics.ecoop.2025.6 2025 Chen, Tianyu; Wang, Zeyu; Li, Lin LIPIcs, Volume 333, ECOOP 2025 Detecting Functionality-Specific Vulnerabilities via Retrieving Individual Functionality-Equivalent APIs in Op81wads2025kdtree datacite 10.4230/lipics.wads.2025.45 2025 Pham, Tuyen; Wagner, Hubert LIPIcs, Volume 349, WADS 2025 Fast Kd-Trees for the Kullback-Leibler Divergence and Other Decomposable Bregman Divergences82sea2024mis datacite 10.4230/lipics.sea.2024.20 2024 Langedal, Kenneth; Hespe, Demian; Sanders, Peter LIPIcs, Volume 301, SEA 2024 Targeted Branching for the Maximum Independent Set Problem Using Graph Neural Networks83esem2026translation datacite 10.4230/lipics.esem.2026.34 2026 Naqvi, Syed Fakhar Abbas; Anwar, Hina LIPIcs, Volume 394, ESEM 2026 Bigger Is Not Always Better: Performance and Sustainability Trade-Offs in LLMs for Python Bug-Fixing Tasks84dx2024asp datacite 10.4230/oasics.dx.2024.10 2024 Klampfl, Lorenz; Wotawa, Franz OASIcs, Volume 125, DX 2024 Leveraging Answer Set Programming for Continuous Monitoring, Fault Detection, and Explanation of Automated and85icpec2025vuln datacite 10.4230/oasics.icpec.2025.4 2025 Gaspar Lopes, Diogo; Espinha Gasiba, Tiago; Amburi, Sathwik OASIcs, Volume 133, ICPEC 2025 Can Open Large Language Models Catch Vulnerabilities?86saia2024robust datacite 10.4230/oasics.saia.2024.1 2025 Awadid, Afef; Robert, Boris OASIcs, Volume 126, SAIA 2024 On Assessing ML Model Robustness: A Methodological Framework (Academic Track)87W4385245566 openalex https://doi.org/10.48550/arxiv.1706.03762 2017 Ashish Vaswani; Noam Shazeer; Niki Parmar arXiv (Cornell University) Attention Is All You Need cited_by=122093 type=preprint88W2964015378 openalex https://doi.org/10.48550/arxiv.1609.02907 2016 Thomas Kipf; Max Welling arXiv (Cornell University) Semi-Supervised Classification with Graph Convolutional Networks cited_by=24853 type=preprint89W4293846201 openalex https://doi.org/10.48550/arxiv.1706.06083 2017 Aleksander Mądry; Aleksandar Makelov; Ludwig Schmidt arXiv (Cornell University) Towards Deep Learning Models Resistant to Adversarial Attacks cited_by=6746 type=preprint90W4311415873 openalex https://doi.org/10.48550/arxiv.1312.6114 2013 Diederik P. Kingma; Max Welling UvA-DARE (University of Amsterdam) Auto-Encoding Variational Bayes cited_by=21064 type=preprint91W4294558607 openalex https://doi.org/10.48550/arxiv.1706.02216 2017 William L. Hamilton; Rex Ying; Jure Leskovec arXiv (Cornell University) Inductive Representation Learning on Large Graphs cited_by=10920 type=preprint92W3177813494 openalex https://doi.org/10.48550/arxiv.2107.03374 2021 Mark I-Cheng Chen; Jerry Tworek; Heewoo Jun arXiv (Cornell University) Evaluating Large Language Models Trained on Code cited_by=1492 type=preprint93W2189687801 openalex https://doi.org/10.7275/7408407.0 2021 Thomas Helmuth Scholarworks (University of Massachusetts Amherst) General Program Synthesis from Examples Using Genetic Programming with Parent Selection Based on Random Lexico cited_by=19 type=dissertation94yang2023leandojo arxiv 2306.15626 2023-06-27 Kaiyu Yang arXiv LeanDojo: Theorem Proving with Retrieval-Augmented Language Models95selsam2019neurosat arxiv 1802.03685 ERROR HTTP Error 429: Unknown Error96kang2023fewshottesters crossref-query 10.1109/icse48619.2023.00194 2023 Kang 2023 IEEE/ACM 45th International Conference on Software Engi Large Language Models are Few-shot Testers: Exploring LLM-based General Bug Reproduction97kang2023fewshottesters crossref-query 10.1109/tse.2024.3450837 2024 Kang IEEE Transactions on Software Engineering Evaluating Diverse Large Language Models for Automatic and General Bug Reproduction98