Stochastic superoptimization
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
We formulate the loop-free binary superoptimization task as a stochastic search problem. The competing constraints of transformation correctness and performance improvement are encoded as terms in a cost function, and a Markov Chain Monte Carlo sampler is used to rapidly explore the space of all possible programs to find one that is an optimization of a given target program. Although our method sacrifices completeness, the scope of programs we are able to consider, and the resulting quality of the programs that we produce, far exceed those of existing superoptimizers. Beginning from binaries compiled by llvm -O0 for 64-bit x86, our prototype implementation, STOKE, is able to produce programs which either match or outperform the code produced by gcc -O3, icc -O3, and in some cases, expert handwritten assembly.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Citations
Cites
Equation of State Calculations by Fast Computing Machines
Metropolis, N., Rosenbluth, A. W., Rosenbluth, M. N., Teller, A. H., & Teller, E. (1953) · The Journal of Chemical Physics · doi:10.1063/1.1699114 · Cited by 37,192
Monte Carlo sampling methods using Markov chains and their applications.
Hastings, W. K. (1970) · Biometrika · doi:10.1093/biomet/57.1.97 · Cited by 15,195
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
Pin: building customized program analysis tools with dynamic instrumentation
Luk, C.-K., Cohn, R., Muth, R., Patil, H., Klauser, A., Lowney, G., Wallace, S., Reddi, V. J., & Hazelwood, K. (2005) · Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation · doi:10.1145/1065010.1065034 · Cited by 2,310
An updated set of basic linear algebra subprograms (BLAS)
(2002) · ACM Transactions on Mathematical Software · doi:10.1145/567806.567807 · Cited by 834
Combinatorial sketching for finite programs
Solar-Lezama, A., Tancau, L., Bodik, R., Seshia, S., & Saraswat, V. (2006) · Proceedings of the 12th international conference on Architectural support for programming languages and operating systems · doi:10.1145/1168857.1168907 · Cited by 635
Veach, E., & Guibas, L. J. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258775 · Cited by 511
The Markov chain Monte Carlo revolution
Diaconis, P. (2008) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-08-01238-x · Cited by 295
Extracting protein alignment models from the sequence database
Neuwald, A. F., Liu, J. S., Lipman, D. J., & Lawrence, C. E. (1997) · Nucleic Acids Research · doi:10.1093/nar/25.9.1665 · Cited by 234
Synthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993506 · Cited by 200
Research works printed but not linked: 5
- Cadar C., 2008, OSDI, 209
- Ganesh V., 2007, CAV, 519
- Gilks W. R., 1999, Chapman and Hall/CRC
- Liang P., 2010, ICML, 639
- Warren H. S., 2002, Inc.
Cited by
Mathematical discoveries from program search with large language models
Romera-Paredes, B., Barekatain, M., Novikov, A., Balog, M., Kumar, M. P., Dupont, E., Ruiz, F. J. R., Ellenberg, J. S., Wang, P., Fawzi, O., et al. (2024) · Nature · doi:10.1038/s41586-023-06924-6 · Cited by 544
Ansor: Generating High-Performance Tensor Programs for Deep LearningPreprint
Zheng, L., Jia, C., Sun, M., Zhao, W., Yu, C. H., Haj-Ali, A., Wang, Y., Yang, J., Zhuo, D., Sen, K., et al. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2006.06762 · Cited by 487
CodeGen: An Open Large Language Model for Code with Multi-Turn Program Synthesis
Nijkamp, E., Pang, B., Hayashi, H., Tu, L., Wang, H., Zhou, Y., Savarese, S., & Xiong, C. (2022) · arXiv · doi:10.48550/arxiv.2203.13474 · Cited by 330
Learning to Perform Local Rewriting for Combinatorial OptimizationPreprint
Chen, X., & Tian, Y. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1810.00337 · Cited by 326
FlashMeta: a framework for inductive program synthesis
Polozov, O., & Gulwani, S. (2015) · Proceedings of the 2015 ACM SIGPLAN International Conference on Object-Oriented Programming, Systems, Languages, and Applications · doi:10.1145/2814270.2814310 · Cited by 225
GAMMA: automating the HW mapping of DNN models on accelerators via genetic algorithm
Kao, S.-C., & Krishna, T. (2020) · doi:10.1145/3400302.3415639 · Cited by 212
Synthesizing highly expressive SQL queries from input-output examples
Wang, C., Cheung, A., & Bodik, R. (2017) · Proceedings of the 38th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3062341.3062365 · Cited by 178
ConfuciuX: Autonomous Hardware Resource Assignment for DNN Accelerators using Reinforcement Learning
Kao, S.-C., Jeong, G., & Krishna, T. (2020) · IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro50266.2020.00058 · Cited by 150
Semantic program alignment for equivalence checking
Churchill, B., Padon, O., Sharma, R., & Aiken, A. (2019) · Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3314221.3314596 · Cited by 97
Self-citationFlashMeta: a framework for inductive program synthesis
Polozov, O., & Gulwani, S. (2015) · ACM SIGPLAN Notices · doi:10.1145/2858965.2814310 · Cited by 45
Verified lifting of stencil computations
Kamil, S., Cheung, A., Itzhaky, S., & Solar-Lezama, A. (2016) · Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2908080.2908117 · Cited by 53
Chlorophyll: synthesis-aided compiler for low-power spatial architectures
Phothilimthana, P. M., Jelvis, T., Shah, R., Totla, N., Chasins, S., & Bodík, R. (2014) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2594291.2594339 · Cited by 77
Functional programming for compiling and decompiling computer-aided design
Nandi, C., Wilcox, J. R., Panchekha, P., Blau, T., Grossman, D., & Tatlock, Z. (2018) · Proceedings of the ACM on Programming Languages · doi:10.1145/3236794 · Cited by 63
MAGMA: An Optimization Framework for Mapping Multiple DNNs on Multiple Accelerator Cores
Kao, S.-C., & Krishna, T. (2022) · 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) · doi:10.1109/hpca53966.2022.00065 · Cited by 58
Wei, A., Cao, J., Li, R., Chen, H., Zhang, Y., Wang, Z., Liu, Y., Teixeira, T. S. F. X., Yang, D., Wang, K., et al. (2025) · Conference on Empirical Methods in Natural Language Processing (EMNLP) · doi:10.18653/v1/2025.emnlp-main.1718 · Cited by 53
Self-citationSynthesizing highly expressive SQL queries from input-output examples
Wang, C., Cheung, A., & Bodik, R. (2017) · ACM SIGPLAN Notices · doi:10.1145/3140587.3062365 · Cited by 48
Boosting Neural Networks to Decompile Optimized Binaries
Cao, Y., Liang, R., Chen, K., & Hu, P. (2022) · Annual Computer Security Applications Conference · doi:10.1145/3564625.3567998 · Cited by 48
Efficient Neural Network Analysis with Sum-of-Infeasibilities
Wu, H., Zeljić, A., Katz, G., & Barrett, C. (2022) · Lecture notes in computer science · doi:10.1007/978-3-030-99524-9_8 · Cited by 48
Synthesizing safe and efficient kernel extensions for packet processing
Xu, Q., Wong, M. D., Wagle, T., Narayana, S., & Sivaraman, A. (2021) · ACM SIGCOMM Conference (SIGCOMM) · doi:10.1145/3452296.3472929 · Cited by 47
Supersonic: Learning to Generate Source Code Optimizations in C/C++
Chen, Z., Fang, S., & Monperrus, M. (2024) · IEEE Transactions on Software Engineering · doi:10.1109/tse.2024.3423769 · Cited by 47
Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate
Menguy, G., Bardin, S., Bonichon, R., & Lima, C. D. S. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3485250 · Cited by 41
Neutron: an attention-based neural decompiler
Liang, R., Cao, Y., Hu, P., & Chen, K. (2021) · Cybersecurity · doi:10.1186/s42400-021-00070-0 · Cited by 41
Bayesian synthesis of probabilistic programs for automatic data modeling
Saad, F. A., Cusumano-Towner, M., Schaechtle, U., Rinard, M., & Mansinghka, V. K. (2019) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 37
Sampling for Bayesian Program Learning
Ellis, K., Solar-Lezama, A., & Tenenbaum, J. B. (2016) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 36
Interpretable Program Synthesis
Zhang, T., Chen, Z., Zhu, Y., Vaithilingam, P., Wang, X., & Glassman, E. L. (2021) · CHI Conference on Human Factors in Computing Systems · doi:10.1145/3411764.3445646 · Cited by 36
Practical verification protocols for analog quantum simulators
Shaffer, R., Megidish, E., Broz, J., Chen, W.-T., & Häffner, H. (2021) · npj Quantum Information · doi:10.1038/s41534-021-00380-8 · Cited by 33
Adaptive Neural CompilationPreprint
Bunel, R., Desmaison, A., Kohli, P., Torr, P. H. S., & Kumar, M. (2016) · arXiv (Cornell University) · doi:10.48550/arxiv.1605.07969 · Cited by 33
Verified lifting of stencil computations
Kamil, S. A., Cheung, A., Itzhaky, S., & Solar-Lezama, A. (2016) · ACM SIGPLAN Notices · doi:10.1145/2980983.2908117 · Cited by 32
Chlorophyll: synthesis-aided compiler for low-power spatial architectures
Phothilimthana, P. M., Jelvis, T., Shah, R., Totla, N., Chasins, S., & Bodík, R. (2014) · ACM SIGPLAN Notices · doi:10.1145/2666356.2594339 · Cited by 31
Neurosymbolic Transformers for Multi-Agent CommunicationPreprint
Inala, J. P., Yang, Y., Paulos, J., Pu, Y., Bastani, O., Kumar, V., Rinard, M., & Solar-Lezama, A. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2101.03238 · Cited by 31
WebAssembly diversification for malware evasion
Cabrera-Arteaga, J., Monperrus, M., Toady, T., & Baudry, B. (2023) · Computers & Security · doi:10.1016/j.cose.2023.103296 · Cited by 28
Dataflow-based pruning for speeding up superoptimization
Mukherjee, M., Kant, P., Liu, Z., & Regehr, J. D. (2020) · Proceedings of the ACM on Programming Languages · doi:10.1145/3428245 · Cited by 27
A compiler and verifier for page access oblivious computation
Sinha, R., Rajamani, S. K., & Seshia, S. A. (2017) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3106237.3106248 · Cited by 25
GEVO: GPU Code Optimization Using Evolutionary Computation
Liou, J.-Y., Wang, X., Forrest, S., & Wu, C.-J. (2020) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/3418055 · Cited by 24
Learning to make compiler optimizations more effective
Mammadli, R., Selakovic, M., Wolf, F., & Pradel, M. (2021) · MAPS@PLDI · doi:10.1145/3460945.3464952 · Cited by 24
ECO: An LLM-Driven Efficient Code Optimizer for Warehouse Scale ComputersPreprint
Lin, H., Maas, M., Roquemore, M., Hasanzadeh, A., Lewis, F., Simonson, Y., Shringi, A., Dai, H., Musau, P., Yang, T.-W., et al. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2503.15669 · Cited by 23
SuperCoder: Assembly Program Superoptimization with Large Language ModelsPreprint
Wei, A., Suresh, T., Tan, H., Xu, Y., Singh, G., Wang, K., & Aiken, A. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2505.11480 · Cited by 23
Self-citationEqBench: A Dataset of Equivalent and Non-equivalent Program Pairs
Badihi, S., Li, Y., & Rubin, J. (2021) · International Conference on Mining Software Repositories (MSR) · doi:10.1109/msr52588.2021.00084 · Cited by 22
CryptOpt: Verified Compilation with Randomized Program Search for Cryptographic Primitives
Kuepper, J., Erbsen, A., Gross, J. S., Conoly, O., Sun, C., Tian, S., Wu, D., Chlipala, A. J., Chuengsatiansup, C., Genkin, D., et al. (2023) · Proceedings of the ACM on Programming Languages · doi:10.1145/3591272 · Cited by 19
SynthCT: Towards Portable Constant-Time Code
Dinesh, S., Garrett-Grossman, G., & Fletcher, C. W. (2022) · Network and Distributed System Security Symposium · doi:10.14722/ndss.2022.24215 · Cited by 19
Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis
Gupta, K., Christensen, P. E., Chen, X., & Song, D. (2020) · arXiv · doi:10.48550/arxiv.2007.08095 · Cited by 18
Learning to Improve Code EfficiencyPreprint
Chen, B., Tarlow, D., Swersky, K., Maas, M., Heiber, P. A., Naik, A. V., Hashemi, M., & Ranganathan, P. (2022) · arXiv (Cornell University) · doi:10.48550/arxiv.2208.05297 · Cited by 17
ProofOptimizer: Training Language Models to Simplify Proofs without Human Demonstrations
Gu, A., Piotrowski, B., Gloeckle, F., Yang, K., & Markosyan, A. H. (2026) · International Conference on Learning Representations · doi:10.48550/arxiv.2510.15700 · Cited by 18
Formally verified big step semantics out of x86-64 binaries
Roessle, I., Verbeek, F., & Ravindran, B. (2019) · ACM SIGPLAN International Conference on Certified Programs and Proofs (CPP) · doi:10.1145/3293880.3294102 · Cited by 16
Recursive Program Synthesis using Paramorphisms
Hong, Q., & Aiken, A. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656381 · Cited by 14
Self-citationSuperoptimization of WebAssembly bytecode
Cabrera-Arteaga, J., Donde, S., Gu, J., Floros, O., Satabin, L., Baudry, B., & Monperrus, M. (2020) · International Conference on Art, Science, and Engineering of Programming (<Programming>) · doi:10.1145/3397537.3397567 · Cited by 14
Man-Made Heuristics Are Dead. Long Live Code Generators!
Dwivedula, R., Saxena, D., Akella, A., Chaudhuri, S., & Kim, D. (2025) · ACM Workshop on Hot Topics in Networks (HotNets) · doi:10.1145/3772356.3772413 · Cited by 12
Automatically Tailoring Abstract Interpretation to Custom Usage Scenarios
Mansur, M. N., Mariano, B., Christakis, M., Navas, J. A., & Wüstholz, V. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-81688-9_36 · Cited by 13
Input-Output Example-Guided Data Deobfuscation on Binary
Zhao, Y., Tang, Z., Ye, G., Gong, X., & Fang, D. (2021) · Security and Communication Networks · doi:10.1155/2021/4646048 · Cited by 13
Interpretable, Verifiable, and Robust Reinforcement Learning via Program Synthesis
Bastani, O., Inala, J. P., & Solar-Lezama, A. (2022) · Lecture notes in computer science · doi:10.1007/978-3-031-04083-2_11 · Cited by 13
Generating Compilers for Qubit Mapping and Routing
Molavi, A., Xu, A., Cecchetti, E., Tannu, S., & Albarghouthi, A. (2026) · Proceedings of the ACM on Programming Languages · doi:10.1145/3776720 · Cited by 12
QSSA: an SSA-based IR for Quantum computing
Peduri, A., Bhat, S., & Grosser, T. (2022) · ACM SIGPLAN International Conference on Compiler Construction (CC) · doi:10.1145/3497776.3517772 · Cited by 10
Dynamic Operator Optimization for Efficient Multi-Tenant LoRA Model Serving
Zhou, C., Zhou, Y., Zhang, S., Wang, Y., & Liu, Z. (2025) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v39i21.34453 · Cited by 9
FormulaCode: Evaluating Agentic Optimization on Large CodebasesPreprint
Sehgal, A., Hou, J., Sarkar, A., Mantripragada, I., Chaudhuri, S., Sun, J. J., & Yue, Y. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2603.16011 · Cited by 9
High-Performance Branch-Free Algorithms for Extended-Precision Floating-Point Arithmetic
Zhang, D. K., & Aiken, A. (2025) · International Conference for High Performance Computing, Networking, Storage and Analysis (SC) · doi:10.1145/3712285.3759876 · Cited by 8
Self-citationSemantics-Recovering Decompilation through Neural Machine TranslationPreprint
Liang, R., Cao, Y. S., Hu, P., He, J., & Chen, K. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2112.15491 · Cited by 8
LPO: Discovering Missed Peephole Optimizations with Large Language Models
Xu, Z., Xu, H., Tian, Y., Zhou, X., & Sun, C. P. (2026) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3779212.3790184 · Cited by 7
Statistical Approach to Efficient and Deterministic Schedule Synthesis for Cyber-Physical Systems
Xu, S., Ghosh, B., Hobbs, C., Fraccaroli, E., Duggirala, P. S., & Chakraborty, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45329-8_15 · Cited by 7
Measuring code efficiency optimization capabilities with ACEOB
Pan, Y., Shao, X., & Lyu, C. (2024) · Journal of Systems and Software · doi:10.1016/j.jss.2024.112250 · Cited by 7
Learning to Superoptimize Real-world ProgramsPreprint
Shypula, A., Yin, P., Lacomis, J., Goues, C. L., Schwartz, E. J., & Neubig, G. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2109.13498 · Cited by 7
AutoNumerics-Zero: Automated Discovery of State-of-the-Art Mathematical FunctionsPreprint
Real, E., Rossini, M., de Souza, C., Garg, M., Firsching, M., Le, Q. V., Chen, Y., Verghese, A., Cubuk, E. D., & Park, D. H. (2023) · arXiv (Cornell University) · doi:10.48550/arxiv.2312.08472 · Cited by 7
Attias, V., Bellec, N., Menguy, G., Bardin, S., & Marion, J.-Y. (2025) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3719027.3765134 · Cited by 6
Checking equivalence in a non-strict language
Kolesar, J. C., Piskač, R., & Hallahan, W. T. (2022) · Proceedings of the ACM on Programming Languages · doi:10.1145/3563340 · Cited by 5
EPSO: A Caching-Based Efficient Superoptimizer for BPF Bytecode
Zhu, Q., Liu, Y., Zhu, Z., Liu, S., & Bu, L. (2025) · IEEE/ACM International Conference on Automated Software Engineering (ASE) · doi:10.1109/ase63991.2025.00242 · Cited by 4
Iterative genetic improvement: Scaling stochastic program synthesis
Yuan, Y., & Banzhaf, W. (2023) · Artificial Intelligence · doi:10.1016/j.artint.2023.103962 · Cited by 4
Synthesizing Trajectory Queries from Examples
Mell, S., Bastani, F., Zdancewic, S., & Bastani, O. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37706-8_23 · Cited by 4
Enhancing Robot Program Synthesis Through Environmental Context
Chen, T., Wang, Q., Dong, Z., Shen, L., & Xin, P. (2023) · neural information processing systems · doi:10.52202/075280-0171 · Cited by 4
Program Synthesis-based Simplification of MBA Obfuscated Malware with Restart Strategies
Kang, S., Kim, J., Cho, E.-S., & Choi, S. (2022) · doi:10.1145/3560831.3564258 · Cited by 4
Understanding the Power of Evolutionary Computation for GPU Code Optimization
Liou, J.-Y., Awan, M. G., Hofmeyr, S. A., Forrest, S., & Wu, C.-J. (2022) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc55918.2022.00025 · Cited by 4
Enhancing LoRA Model Serving Capacity via Adaptive Operator Scheduling for Multi-Tenancy on GPU
Xia, L., & Ma, H. (2024) · IEEE Access · doi:10.1109/access.2024.3483250 · Cited by 3
TestGPT-Server: Automatically Testing Microservices with Large Language Models at ByteDance
Wang, J., Chen, S., Liu, Y., Deng, Y., Zhang, L., Fu, Y., & Liu, B. (2025) · ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering (ESEC/FSE) · doi:10.1145/3696630.3728545 · Cited by 3
DAEDALUS: Defense Against Firmware ROP Exploits Using Stochastic Software DiversityPreprint
Obaidat, I., Sridhar, M., & Tavakoli, F. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2401.16234 · Cited by 3
Algorithms for learning to induce programs
Ellis, K. (2020) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 3
Black-box code analysis for reverse engineering through constraint acquisition and program synthesis
Menguy, G. (2023) · theses.fr (ABES) · doi:10.70675/529006e9z5197z44eezaa10zb9838ec76479 · Cited by 3
Attention-Based Decompilation Through Neural Machine Translation
Liang, R., Cao, Y., Hu, P., & Chen, K. (2025) · Lecture notes in computer science · doi:10.1007/978-981-96-4731-6_16 · Cited by 2
Liou, J.-Y., Awan, M. G., Leyba, K. G., Šulc, P., Hofmeyr, S. A., Wu, C.-J., & Forrest, S. (2024) · ACM Transactions on Evolutionary Learning and Optimization · doi:10.1145/3703920 · Cited by 2
Correia, A. R. S., Iyoda, J., & Mota, A. (2021) · Software Practice and Experience · doi:10.1002/spe.3054 · Cited by 2
Search-Based Local Black-Box Deobfuscation: Understand, Improve and Mitigate (Poster)
Menguy, G., Bardin, S., Bonichon, R., & Lima, C. D. S. (2021) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/3460120.3485337 · Cited by 2
Automated Property Directed Self Composition
Shenoy, A., Prabhu, S., Madhukar, K., Shemer, R., & Srivas, M. K. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-45332-8_7 · Cited by 2
Ullrich, M., & Hack, S. (2025) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3696443.3708954 · Cited by 2
Le, H., Nguyen, P., Do, H., Nguyen, T., Pham, T., Nguyen-Duc, A., & Quan, T. (2026) · Array · doi:10.1016/j.array.2026.101137 · Cited by 2
Tensor Program Superoptimization through Cost-Guided Symbolic Program Synthesis
Brauckmann, A., Chaube, A., Magalhães, J. W. D. S., Polgreen, E., & O’boyle, M. F. P. (2026) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo68049.2026.11395198 · Cited by 2
Using hypersafety verification for proving correctness of programming assignments
Anil, J. K., Sumanth Prabhu, S., Madhukar, K., & Venkatesh, R. (2020) · IEEE/ACM International Conference on Software Engineering: New Ideas and Emerging Results (ICSE-NIER) · doi:10.1145/3377816.3381747 · Cited by 2
Beyond the Phase Ordering Problem: Finding the Globally Optimal Code w.r.t. Optimization PhasesPreprint
Wang, Y., Chen, H., & Wang, K. (2024) · arXiv (Cornell University) · doi:10.48550/arxiv.2410.03120 · Cited by 2
Identification of obfuscated function clones in binaries using machine learning
Pucher, M. (2021) · reposiTUm (TU Wien) · doi:10.34726/hss.2022.87962 · Cited by 2
Two-level realization of logical formulas for deductive program synthesis
Joudakizadeh, M., & Beltiukov, A. P. (2024) · Vestnik Udmurtskogo Universiteta Matematika Mekhanika Komp yuternye Nauki · doi:10.35634/vm240401 · Cited by 1
Формализация задач в условиях дедуктивного синтеза
Beltiukov, A. P. (2019) · Systems Engineering and Information Technologies · Cited by 1
Program Synthesis Without Full Specifications for Novel Applications
Perelman, D. (2015) · ResearchWorks at the University of Washington (University of Washington) · Cited by 1
On the representation and learning of concepts : programs, types, and bayes
Morales, L. (2018) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 1
Neuro-Symbolic Program Synthesis for Data-Efficient Learning
Barke, S. (2024) · eScholarship (California Digital Library) · Cited by 1
The Case for Automated Hyperspecialization: Evidence from SATPreprint
Green, H., Goues, C. L., & Brown, F. (2026) · arXiv (Cornell University) · doi:10.48550/arxiv.2609.14836 · Cited by 1
Correia, A. R. S., Iyoda, J., & Mota, A. (2023) · Software Practice and Experience · doi:10.1002/spe.3286
Checking equivalence in a non-strict language
Kolesar, J. C., Piskač, R., & Hallahan, W. T. (2025) · Journal of Functional Programming · doi:10.1017/s0956796825100099
PrediPrune: Reducing Verification Overhead in Souper with Machine Learning Driven PruningPreprint
Ishimwe, A.-T., Shivakumar, R., Kim, H., Lehman, T. S., & Izraelevitz, J. (2025) · arXiv (Cornell University) · doi:10.48550/arxiv.2509.16497
Schloegel, M. (2024) · Dokumentenrepositorium der RUB (Ruhr University Bochum) · doi:10.13154/294-12651
Scalable and Efficient Systems for Large Deep Learning Models
Zheng, L. (2024) · eScholarship (California Digital Library)
Tensor program optimization through program synthesis
Brauckmann, A. (2025) · ERA · doi:10.7488/era/6825
Medforth, N. (n.d.) · Summit (Simon Fraser University)
Ζαμάνης, Ι., & Zamanis, I. (2026) · DSpace - NTUA (National Technical University of Athens) · doi:10.26240/heal.ntua.31813
Optimus: A Generic Operator-Level PyTorch Model Transformation Framework
Yu, M., Xu, J., Huang, Y., Liang, Y., Liu, J., Yang, S., Ansel, J., Ellison, E. F. D., Yang, E. Z., Hirsh, B., et al. (2026) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/3770855.3818458
Metadata
- Authors
- Schkufza, E., Sharma, R., & Aiken, A.
- Affiliations
- Stanford University (US)
- Venue
- ACM SIGARCH Computer Architecture News
- Published
- 2013-03-16
- Volume
- 41
- Issue
- 1
- Pages
- 305-316
- ISSN
- 0163-5964 (ISSN-L)
- OpenAlex
- W4299968636
- Cited by
- 57
- References
- 15
- Citations by year
- 2026: 5 · 2025: 7 · 2024: 4 · 2023: 8 · 2022: 6 · 2021: 10 · 2020: 5 · 2019: 2 · 2018: 1 · 2017: 3 · 2016: 2 · 2015: 2 · 2014: 2
- FWCI
- 3.75
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- ACM SIGARCH Computer Architecture News (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Software › Logic, programming, and type systems
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Keywords
- stochastic search, Markov chain Monte Carlo, program transformation, program optimization, Stokes, x86 assembly
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.