Superoptimizer: a look at the smallest program
Open accessAbstract
Given an instruction set, the superoptimizer finds the shortest program to compute a function. Startling programs have been generated, many of them engaging in convoluted bit-fiddling bearing little resemblance to the source programs which defined the functions. The key idea in the superoptimizer is a probabilistic test that makes exhaustive searches practical for programs of useful size. The search space is defined by the processor's instruction set, which may include the whole set, but it is typically restricted to a subset. By constraining the instructions and observing the effect on the output program, one can gain insight into the design of instruction sets. In addition, superoptimized programs may be used by peephole optimizers to improve the quality of generated code, or by assembly language programmers to improve manually written code.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
Searching semantically equivalent code requires extra code compilation and execution costs, which is unrealistic in a large database.
“Searching semantically equivalent code requires extra code compilation and execution costs (Massalin, 1987; Churchill et al., 2019), which is unrealistic in a large database.”
From ReACC: A Retrieval-Augmented Code Completion Framework (2022) · cites this paper as Massalin, 1987
Cites
Automatic generation of peephole optimizations
Davidson, J. W., & Fraser, C. W. (1984) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/502874.502885 · Cited by 53 · see citing works
Discovering machine-specific code improvements
Kessler, P. B. (1986) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/12276.13336 · Cited by 16 · see citing works
A practical method for code generation based on exhaustive search
Krumme, D. W., & Ackley, D. H. (1982) · ACM SIGPLAN Symposium on Compiler Construction · doi:10.1145/800230.806994 · Cited by 16 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Compiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 824 · see citing works
Oracle-guided component-based program synthesis
Jha, S., Gulwani, S., Seshia, S. A., & Tiwari, A. (2010) · Proceedings of the 32nd ACM/IEEE International Conference on Software Engineering - Volume 1 · doi:10.1145/1806799.1806833 · Cited by 365 · see citing works
Compiler validation via equivalence modulo inputs
Le, V., Afshari, M., & Su, Z. (2014) · Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/2594291.2594334 · Cited by 388 · see citing works
Schkufza, E., Sharma, R., & Aiken, A. (2013) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/2451116.2451150 · Cited by 279 · see citing works
Synthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993506 · Cited by 246 · see citing works
Dimensions in program synthesis
Gulwani, S. (2010) · International Symposium on Principles and Practice of Declarative Programming (PPDP) · doi:10.1145/1836089.1836091 · Cited by 235 · see citing works
Compiler validation via equivalence modulo inputs
Le, V., Afshari, M., & Su, Z. (2014) · ACM SIGPLAN Notices · doi:10.1145/2666356.2594334 · Cited by 222 · see citing works
Synthesis of loop-free programs
Gulwani, S., Jha, S., Tiwari, A., & Venkatesan, R. (2011) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1993498.1993506 · Cited by 201 · see citing works
Tate, R., Stepp, M., Tatlock, Z., & Lerner, S. (2009) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1480881.1480915 · Cited by 198 · see citing works
Adaptive Optimizing Compilers for the 21st Century
Cooper, K. D., Subramanian, D., & Torczon, L. (2002) · The Journal of Supercomputing · doi:10.1023/a:1015729001611 · Cited by 197 · see citing works
egg: Fast and extensible equality saturation
Willsey, M., Nandi, C., Wang, Y. R., Flatt, O., Tatlock, Z., & Panchekha, P. (2021) · Proceedings of the ACM on Programming Languages · doi:10.1145/3434304 · Cited by 181 · see citing works
A language for shading and lighting calculations
Hanrahan, P., & Lawson, J. (1990) · ACM SIGGRAPH Conference (SIGGRAPH) · doi:10.1145/97879.97911 · Cited by 180 · see citing works
Automatic generation of peephole superoptimizers
Bansal, S., & Aiken, A. (2006) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/1168857.1168906 · Cited by 160 · see citing works
Information Security and Cryptology – ICISC 2004
Anckaert, B., De Sutter, B., Chanet, D., & Bosschere, K. D. (2005) · Lecture notes in computer science · doi:10.1007/b137120 · Cited by 154 · see citing works
A comprehensive survey on smart contract construction and execution: paradigms, tools, and systems
Hu, B., Zhang, Z., Liu, J., Liu, Y., Yin, J., Lu, R., & Lin, X. (2021) · Patterns · doi:10.1016/j.patter.2020.100179 · Cited by 149 · see citing works
Joshi, R., Nelson, G., & Randall, K. H. (2002) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/512529.512566 · Cited by 149 · see citing works
Enhanced code compression for embedded RISC processors
Cooper, K. D., & McIntosh, N. (1999) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/301618.301655 · Cited by 148 · see citing works
Provably correct peephole optimizations with alive
Lopes, N. P., Menendez, D., Nagarakatte, S., & Regehr, J. D. (2015) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2737924.2737965 · Cited by 131 · see citing works
egg: Fast and Extensible Equality Saturation
Willsey, M., Nandi, C., Wang, Y. R., Flatt, O., Tatlock, Z., & Panchekha, P. (2026) · Communications of the ACM · doi:10.1145/3815481 · Cited by 131 · see citing works
Contrastive Code Representation Learning
Jain, P., Jain, A., Zhang, T., Abbeel, P., Gonzalez, J., & Stoica, I. (2021) · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing · doi:10.18653/v1/2021.emnlp-main.482 · Cited by 129 · see citing works
Fast searches for effective optimization phase sequences
Kulkarni, P. A., Hines, S. R., Hiser, J. D., Whalley, D. B., Davidson, J. W., & Jones, D. L. (2004) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/996841.996863 · Cited by 121 · see citing works
Jin, Z., Anderson, M. R., Cafarella, M., & Jagadish, H. V. (2017) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3035918.3064034 · Cited by 117 · see citing works
Bui, N. D. Q., Yu, Y., & Jiang, L. (2021) · Proceedings of the 44th International ACM SIGIR Conference on Research and Development in Information Retrieval · doi:10.1145/3404835.3462840 · Cited by 103 · see citing works
Finding effective optimization phase sequences
Kulkarni, P. A., Zhao, W., Moon, H., Cho, K., Whalley, D. B., Davidson, J. W., Bailey, M. W., Paek, Y., & Gallivan, K. A. (2003) · ACM SIGPLAN Notices · doi:10.1145/780731.780735 · Cited by 101 · see citing works
ReACC: A Retrieval-Augmented Code Completion Framework
Lu, S., Duan, N., Han, H., Guo, D., Hwang, S.-W., & Svyatkovskiy, A. (2022) · arXiv · doi:10.48550/arxiv.2203.07722 · Cited by 96 · see citing works
“Searching semantically equivalent code requires extra code compilation and execution costs (Massalin, 1987; Churchill et al., 2019), which is unrealistic in a large database.”
BackgroundDeriving linearizable fine-grained concurrent objects
Vechev, M., & Yahav, E. (2008) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1375581.1375598 · Cited by 92 · see citing works
Search-based program synthesis
Rajeev Alur, A., Singh, R., Fisman, D., & Solar-Lezama, A. (2018) · Communications of the ACM · doi:10.1145/3208071 · Cited by 89 · see citing works
Data-driven equivalence checking
Sharma, R., Schkufza, E., Churchill, B., & Aiken, A. (2013) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2509136.2509509 · Cited by 83 · see citing works
Malware Makeover: Breaking ML-based Static Analysis by Modifying Executable Bytes
Lucas, K., Sharif, M., Bauer, L., Reiter, M. K., & Shintre, S. (2021) · ACM Asia Conference on Computer and Communications Security (ASIA CCS) · doi:10.1145/3433210.3453086 · Cited by 80 · see citing works
Optimizing synthesis with metasketches
Bornholt, J., Torlak, E., Grossman, D., & Ceze, L. (2016) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/2837614.2837666 · Cited by 79 · see citing works
A language for shading and lighting calculations
Hanrahan, P., & Lawson, J. (1990) · ACM SIGGRAPH Computer Graphics · doi:10.1145/97880.97911 · Cited by 77 · see citing works
From relational verification to SIMD loop synthesis
Barthe, G., Crespo, J. M., Gulwani, S., Kunz, C., & Marron, M. (2013) · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · doi:10.1145/2442516.2442529 · Cited by 65 · see citing works
Tate, R., Stepp, M., Tatlock, Z., & Lerner, S. (2009) · ACM SIGPLAN Notices · doi:10.1145/1594834.1480915 · Cited by 59 · see citing works
Schkufza, E., Sharma, R., & Aiken, A. (2013) · ACM SIGARCH Computer Architecture News · doi:10.1145/2490301.2451150 · Cited by 57 · see citing works
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 57 · see citing works
Verified lifting of stencil computations
Kamil, S. A., Cheung, A., Itzhaky, S., & Solar-Lezama, A. (2016) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2908080.2908117 · Cited by 54 · see citing works
Finding effective optimization phase sequences
Kulkarni, P. A., Zhao, W., Moon, H., Cho, K., Whalley, D. B., Davidson, J. W., Bailey, M. W., Paek, Y., & Gallivan, K. A. (2003) · ACM SIGPLAN/SIGBED Conference on Languages, Compilers, and Tools for Embedded Systems (LCTES) · doi:10.1145/780732.780735 · Cited by 54 · see citing works
Crane, S., Larsen, P., Brunthaler, S., & Franz, M. (2013) · New Security Paradigms Workshop · doi:10.1145/2535813.2535824 · Cited by 48 · see citing works
Regehr, J. D., & Reid, A. (2004) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/1024393.1024410 · Cited by 46 · see citing works
PacketMill: toward per-Core 100-Gbps networking
Farshin, A., Barbette, T., Roozbeh, A., Maguire, G. Q., & Kostić, D. (2021) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3445814.3446724 · Cited by 46 · see citing works
Equality Saturation: A New Approach to Optimization
Tate, R., Stepp, M., Tatlock, Z., & Lerner, S. (2011) · Logical Methods in Computer Science · doi:10.2168/lmcs-7(1:10)2011 · Cited by 45 · see citing works
Finding missed compiler optimizations by differential testing
Barany, G. (2018) · doi:10.1145/3178372.3179521 · Cited by 42 · see citing works
Verified peephole optimizations for CompCert
Mullen, E., Zuniga, D., Tatlock, Z., & Grossman, D. (2016) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2908080.2908109 · Cited by 41 · see citing works
Fast searches for effective optimization phase sequences
Kulkarni, P. A., Hines, S. R., Hiser, J. D., Whalley, D. B., Davidson, J. W., & Jones, D. L. (2004) · ACM SIGPLAN Notices · doi:10.1145/996893.996863 · Cited by 39 · see citing works
WeTune: Automatic Discovery and Verification of Query Rewrite Rules
Wang, Z., Zhou, Z., Yang, Y., Ding, H., Hu, G., Ding, D., Tang, C., Chen, H., & Li, J. (2022) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/3514221.3526125 · Cited by 38 · see citing works
Verifying the Verifier: eBPF Range Analysis Verification
Vishwanathan, H., Shachnai, M., Narayana, S., & Nagarakatte, S. (2023) · Lecture notes in computer science · doi:10.1007/978-3-031-37709-9_12 · Cited by 38 · see citing works
Wu, C., Zhao, H., Nandi, C., Lipton, J. I., Tatlock, Z., & Schulz, A. (2019) · ACM Transactions on Graphics · doi:10.1145/3355089.3356518 · Cited by 38 · see citing works
QSynth - A Program Synthesis based approach for Binary Code Deobfuscation
David, R., Coniglio, L., & Ceccato, M. (2020) · Workshop on Binary Analysis Research (BAR) · doi:10.14722/bar.2020.23009 · Cited by 36 · see citing works
Function Merging by Sequence Alignment
Rocha, R. C. O., Petoumenos, P., Wang, Z., Cole, M., & Leather, H. (2019) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo.2019.8661174 · Cited by 35 · see citing works
Vechev, M., Yahav, E., Bacon, D. F., & Rinetzky, N. (2007) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/1250734.1250787 · Cited by 33 · see citing works
An Experience with Code-Size Optimization for Production iOS Mobile Applications
Chabbi, M., Lin, J., & Barik, R. (2021) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1109/cgo51591.2021.9370306 · Cited by 32 · see citing works
Effective function merging in the SSA form
Rocha, R. C. O., Petoumenos, P., Wang, Z., Cole, M., & Leather, H. (2020) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3385412.3386030 · Cited by 31 · see citing works
Large-Scale Automated Software Diversity—Program Evolution Redux
Homescu, A., Jackson, T., Crane, S., Brunthaler, S., Larsen, P., & Franz, M. (2015) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2015.2433252 · Cited by 31 · see citing works
Synthesis of machine code from semantics
Srinivasan, V., & Reps, T. (2015) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2737924.2737960 · Cited by 30 · see citing works
Stochastic program optimization
Schkufza, E., Sharma, R., & Aiken, A. (2016) · Communications of the ACM · doi:10.1145/2863701 · Cited by 30 · see citing works
Joshi, R., Nelson, G., & Randall, K. H. (2002) · ACM SIGPLAN Notices · doi:10.1145/543552.512566 · Cited by 30 · see citing works
Generating compiler optimizations from proofs
Tate, R., Stepp, M., & Lerner, S. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706345 · Cited by 30 · see citing works
The Superdiversifier: Peephole Individualization for Software Protection
Jacob, M., Jakubowski, M. H., Naldurg, P., Saw, C. W., & Venkatesan, R. (2008) · Lecture notes in computer science · doi:10.1007/978-3-540-89598-5_7 · Cited by 29 · see citing works
Schkufza, E., Sharma, R., & Aiken, A. (2013) · ACM SIGPLAN Notices · doi:10.1145/2499368.2451150 · Cited by 28 · see citing works
Practical verification of peephole optimizations with Alive
Lopes, N. P., Menendez, D., Nagarakatte, S., & Regehr, J. D. (2018) · Communications of the ACM · doi:10.1145/3166064 · Cited by 26 · see citing works
A Tensor Compiler with Automatic Data Packing for Simple and Efficient Fully Homomorphic Encryption
Krastev, A., Samardzic, N., Langowski, S., Devadas, S., & Sánchez, D. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656382 · Cited by 25 · see citing works
Automatic generation of fast optimizing code generators
Fraser, C. W., & Wendt, A. (1988) · ACM SIGPLAN Notices · doi:10.1145/960116.53998 · Cited by 25 · see citing works
Enhanced code compression for embedded RISC processors
Cooper, K. D., & McIntosh, N. (1999) · ACM SIGPLAN Notices · doi:10.1145/301631.301655 · Cited by 24 · see citing works
Conditionally correct superoptimization
Sharma, R., Schkufza, E., Churchill, B., & Aiken, A. (2015) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2814270.2814278 · Cited by 23 · see citing works
Provably correct peephole optimizations with alive
Lopes, N. P., Menendez, D., Nagarakatte, S., & Regehr, J. D. (2015) · ACM SIGPLAN Notices · doi:10.1145/2813885.2737965 · Cited by 22 · see citing works
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 22 · see citing works
Eliminating branches using a superoptimizer and the GNU C compiler
Granlund, T., & Kenner, R. (1992) · ACM SIGPLAN Notices · doi:10.1145/143103.143146 · Cited by 22 · see citing works
Optimizing synthesis with metasketches
Bornholt, J., Torlak, E., Grossman, D., & Ceze, L. (2016) · ACM SIGPLAN Notices · doi:10.1145/2914770.2837666 · Cited by 21 · see citing works
Synthesizing parallel graph programs via automated planning
Prountzos, D., Manevich, R., & Pingali, K. K. (2015) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/2737924.2737953 · Cited by 20 · see citing works
Automatically generating instruction selectors using declarative machine descriptions
Dias, J., & Ramsey, N. F. (2010) · ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL) · doi:10.1145/1706299.1706346 · Cited by 20 · see citing works
Code density concerns for new architectures
Weaver, V. M., & McKee, S. A. (2009) · IEEE International Conference on Computer Design: VLSI in Computers and Processors (ICCD) · doi:10.1109/iccd.2009.5413117 · Cited by 20 · see citing works
Instruction Set Limitation in Support of Software Diversity
Sutter, B. D., Anckaert, B., Geiregat, J., Chanet, D., & Bosschere, K. D. (2009) · Lecture notes in computer science · doi:10.1007/978-3-642-00730-9_10 · Cited by 19 · see citing works
Deriving linearizable fine-grained concurrent objects
Vechev, M., & Yahav, E. (2008) · ACM SIGPLAN Notices · doi:10.1145/1379022.1375598 · Cited by 19 · see citing works
Synthesizing an instruction selection rule library from semantic specifications
Buchwald, S., Fried, A., & Hack, S. (2018) · Proceedings of the CGO/Proceedings of the ... CGO · doi:10.1145/3168821 · Cited by 18 · see citing works
From Concrete Examples to Heap Manipulating Programs
Roy, S. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38856-9_9 · Cited by 18 · see citing works
CROW: Code Diversification for WebAssembly
Cabrera-Arteaga, J., Floros, O., Pérez, O. L. V., Baudry, B., & Monperrus, M. (2021) · Workshop on Measurements, Attacks, and Defenses for the Web (MADWeb) · doi:10.14722/madweb.2021.23004 · Cited by 18 · see citing works
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 18 · see citing works
Reverse interpretation + mutation analysis = automatic retargeting
Collberg, C. S. (1997) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/258915.258922 · Cited by 18 · see citing works
Data-driven equivalence checking
Sharma, R., Schkufza, E., Churchill, B., & Aiken, A. (2013) · ACM SIGPLAN Notices · doi:10.1145/2544173.2509509 · Cited by 16 · see citing works
Potential-driven Statistical Ordering Of Transformations
Hong, I., Kirovski, D., & Potkonjak, M. (1997) · ACM/IEEE Design Automation Conference (DAC) · doi:10.1109/dac.1997.597171 · Cited by 16 · see citing works
AlphaEvolve: A coding agent for scientific and algorithmic discovery
Novikov, A., Vũ, N., Eisenberger, M., Dupont, E., Huang, P.-S., Wagner, A. Z., Shirobokov, S., Kozlovskii, B., Ruiz, F. J. R., Mehrabian, A., et al. (2025) · arXiv · doi:10.48550/arxiv.2506.13131 · Cited by 15 · see citing works
“The idea of code superoptimization goes back to the 1980s [69]; pre-LLM approaches to the problem included systematic enumeration [69], genetic search [20], Monte Carlo sampling [86], and deep reinforcement learning [68].”
Alive-Infer: data-driven precondition inference for peephole optimizations in LLVM
Menendez, D., & Nagarakatte, S. (2017) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/3062341.3062372 · Cited by 14 · see citing works
Vector instruction selection for digital signal processors using program synthesis
Ahmad, M. B. S., Root, A. J., Adams, A., Kamil, S. A., & Cheung, A. (2022) · International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) · doi:10.1145/3503222.3507714 · Cited by 14 · see citing works
Linker Code Size Optimization for Native Mobile Applications
Liu, G., Farooq, U., Zhao, C., Liu, X., & Sun, N. (2023) · ACM SIGPLAN International Conference on Compiler Construction (CC) · doi:10.1145/3578360.3580256 · Cited by 14 · see citing works
Exercises for teaching reverse engineering
Aycock, J., Groeneveldt, A., Kroepfl, H., & Copplestone, T. (2018) · ACM Conference on Innovation and Technology in Computer Science Education (ITiCSE) · doi:10.1145/3197091.3197111 · Cited by 14 · see citing works
Partial evaluation of machine code
Srinivasan, V., & Reps, T. (2015) · Conference on Object-Oriented Programming Systems, Languages, and Applications · doi:10.1145/2814270.2814321 · Cited by 13 · see citing works
Superoptimization 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 13 · see citing works
ECO: an empirical-based compilation and optimization system
Baradaran, N., Chame, J., Chen, C., Diniz, P. C., Hall, M. W., Lee, Y.-J., Liu, B., & Lucas, R. F. (2004) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2003.1213377 · Cited by 13 · see citing works
Automatic generation of peephole superoptimizers
Bansal, S., & Aiken, A. (2006) · ACM SIGARCH Computer Architecture News · doi:10.1145/1168919.1168906 · Cited by 13 · see citing works
Automatic generation of peephole superoptimizers
Bansal, S., & Aiken, A. (2006) · ACM SIGPLAN Notices · doi:10.1145/1168918.1168906 · Cited by 13 · see citing works
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 12 · see citing works
Termination-checking for LLVM peephole optimizations
Menendez, D., & Nagarakatte, S. (2016) · ACM/IEEE International Conference on Software Engineering: Companion Proceedings (ICSE-Companion) · doi:10.1145/2884781.2884809 · Cited by 12 · see citing works
From relational verification to SIMD loop synthesis
Barthe, G., Crespo, J. M., Gulwani, S., Kunz, C., & Marron, M. (2013) · ACM SIGPLAN Notices · doi:10.1145/2517327.2442529 · Cited by 12 · see citing works
Compiler optimized remote method invocation
Veldema, & Philippsen, M. (2003) · IEEE International Conference on Cluster Computing (CLUSTER) · doi:10.1109/clustr.2003.1253308 · Cited by 11 · see citing works
Superoptimized Memory Subsystems for Streaming Applications
Wingbermuehle, J. G., Cytron, R. K., & Chamberlain, R. D. (2015) · ACM/SIGDA International Symposium on Field-Programmable Gate Arrays (FPGA) · doi:10.1145/2684746.2689069 · Cited by 10 · see citing works
Conditionally correct superoptimization
Sharma, R., Schkufza, E., Churchill, B., & Aiken, A. (2015) · ACM SIGPLAN Notices · doi:10.1145/2858965.2814278 · Cited by 10 · see citing works
Regehr, J. D., & Reid, A. (2004) · ACM SIGOPS Operating Systems Review · doi:10.1145/1037949.1024410 · Cited by 10 · see citing works
Automatic generation of fast optimizing code generators
Fraser, C. W., & Wendt, A. (1988) · ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI) · doi:10.1145/53990.53998 · Cited by 10 · see citing works
Verified peephole optimizations for CompCert
Mullen, E., Zuniga, D., Tatlock, Z., & Grossman, D. (2016) · ACM SIGPLAN Notices · doi:10.1145/2980983.2908109 · Cited by 9 · see citing works
SuperStack: Superoptimization of Stack-Bytecode via Greedy, Constraint-Based, and SAT Techniques
Albert, E., de la Banda, M. G., Hernández-Cerezo, A., Ignatiev, A., Rubio, A., & Stuckey, P. J. (2024) · Proceedings of the ACM on Programming Languages · doi:10.1145/3656435 · Cited by 9 · see citing works
- Authors
- Massalin, H.
- Affiliations
- Columbia University (US)
- Corresponding author
- Massalin, Henry
- Venue
- Proceedings of the second international conference on Architectual support for programming languages and operating systems
- Publisher
- ACM
- Published
- 1987-10
- Pages
- 122-126
- OpenAlex
- W4301666354
- Cited by
- 154
- References
- 3
- Citations by year
- 2026: 4 · 2025: 6 · 2024: 4 · 2023: 5 · 2022: 5 · 2021: 11 · 2020: 4 · 2019: 4 · 2018: 6 · 2017: 5 · 2016: 15 · 2015: 12 · 2014: 6 · 2013: 10
- FWCI
- 1.27
- Type
- conference paper
- Language
- en
- Open access
- bronze
- doi.org
- Locations
- International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Logic, programming, and type systems
- Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
- Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
- Keywords
- superoptimization, instruction set design, exhaustive search, probabilistic search, program synthesis, peephole optimization, assembly language, bit manipulation, code generation
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
