Stochastic superoptimization

ACM SIGPLAN Notices

Volumn 48, Issue 4, 2013, Pages 305-315

  Schkufza, Eric ^a   Sharma, Rahul ^a   Aiken, Alex ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

64 bit; Binary; Markov Chain Monte Carlo; MCMC; SMT; Stochastic Search; Superoptimization; X86; X86 64

Indexed keywords

64-BIT; BINARY; MARKOV CHAIN MONTE-CARLO; MCMC; STOCHASTIC SEARCH; SUPEROPTIMIZATION; X86; X86-64;

COMPUTER PROGRAMMING; COMPUTER SCIENCE; SURFACE MOUNT TECHNOLOGY;

STOCHASTIC SYSTEMS;

EID: 84880123323     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2499368.2451150     Document Type: Conference Paper

References (20)

1. C. Andrieu, N. de Freitas, A. Doucet, and M. I. Jordan. An introduction to MCMC for machine learning. Machine Learning, 50(1-2):5-43, 2003.
2. S. Bansal and A. Aiken. Automatic generation of peephole superoptimizers. In ASPLOS, pages 394-403, 2006.
3. L. S. Blackford, J. Demmel, J. Dongarra, I. Duff, S. Hammarling, G. Henry, M. Heroux, L. Kaufman, A. Lumsdaine, A. Petitet, R. Pozo, K. Remington, and R. C. Whaley. An updated set of basic linear algebra subprograms (BLAS). ACM Transactions on Mathematical Software, 28:135-151, 2001.
4. C. Cadar, D. Dunbar, and D. R. Engler. Klee: Unassisted and automatic generation of high-coverage tests for complex systems programs. In OSDI, pages 209-224, 2008.
5. S. Chenney and D. A. Forsyth. Sampling plausible solutions to multibody constraint problems. In SIGGRAPH, pages 219-228, 2000.
6. P. Diaconis. The markov chain monte carlo revolution. Bulletin of the American Mathematical Society, 46(2):179-205, Nov. 2008.
7. V. Ganesh and D. L. Dill. A decision procedure for bit-vectors and arrays. In CAV, pages 519-531, 2007.
8. W. R. Gilks. Markov Chain Monte Carlo in Practice. Chapman and Hall/CRC, 1999.
9. S. Gulwani, S. Jha, A. Tiwari, and R. Venkatesan. Synthesis of loop-free programs. In PLDI, pages 62-73, 2011.
10. W. K. Hastings. Monte carlo sampling methods using markov chains and their applications. Biometrika, 57(1):97-109, Apr. 1970.
11. R. Joshi, G. Nelson, and K. H. Randall. Denali: A goal-directed superoptimizer. In PLDI, pages 304-314, 2002.
12. P. Liang, M. I. Jordan, and D. Klein. Learning programs: A hierarchical bayesian approach. In ICML, pages 639-646, 2010.
13. C.-K. Luk, R. S. Cohn, R. Muth, H. Patil, A. Klauser, P. G. Lowney, S. Wallace, V. J. Reddi, and K. M. Hazelwood. Pin: Building customized program analysis tools with dynamic instrumentation. In PLDI, pages 190-200, 2005.
14. H. Massalin. Superoptimizer - a look at the smallest program. In ASPLOS, pages 122-126, 1987.
15. N. Metropolis, A.W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller. Equation of state calculations by fast computing machines. The Journal of Chemical Physics, 21(6):1087-1092, 1953.
16. A. F. Neuwald, J. S. Liu, D. J. Lipman, and C. E. Lawrence. Extracting protein alignment models from the sequence database. Nucleic Acids Research, 25:1665-1677, 1997.
17. A. Solar-Lezama, L. Tancau, R. Bodík, S. A. Seshia, and V. A. Saraswat. Combinatorial sketching for finite programs. In ASPLOS, pages 404-415, 2006.
18. R. Tate, M. Stepp, Z. Tatlock, and S. Lerner. Equality saturation: a new approach to optimization. In POPL, pages 264-276, 2009.
19. E. Veach and L. J. Guibas. Metropolis light transport. In SIGGRAPH, pages 65-76, 1997.
20. H. S. Warren. Hacker's Delight. Addison-Wesley Longman Publishing Co., Inc., Boston, MA, USA, 2002.