Scaling up Superoptimization
暂无分享,去创建一个
[1] Rajeev Alur,et al. TRANSIT: specifying protocols with concolic snippets , 2013, PLDI.
[2] Dinakar Dhurjati,et al. GreenThumb: superoptimizer construction framework , 2016, CC.
[3] Trevor Mudge,et al. MiBench: A free, commercially representative embedded benchmark suite , 2001 .
[4] Alexander Aiken,et al. Stochastic superoptimization , 2012, ASPLOS '13.
[5] Thomas W. Reps,et al. Synthesis of machine code from semantics , 2015, PLDI.
[6] Rajeev Alur,et al. Syntax-guided synthesis , 2013, 2013 Formal Methods in Computer-Aided Design.
[7] Henry S. Warren,et al. Hacker's Delight , 2002 .
[8] Karthikeyan Sankaralingam,et al. DySER: Unifying Functionality and Parallelism Specialization for Energy-Efficient Computing , 2012, IEEE Micro.
[9] John Regehr,et al. Provably correct peephole optimizations with alive , 2015, PLDI.
[10] Christoforos E. Kozyrakis,et al. Convolution engine: balancing efficiency & flexibility in specialized computing , 2013, ISCA.
[11] Rastislav Bodík,et al. Chlorophyll : Synthesis-Aided Compiler for Low-Power Spatial Architectures by Phitchaya Mangpo Phothilimthana , 2015 .
[12] Dharmendra S. Modha,et al. A digital neurosynaptic core using embedded crossbar memory with 45pJ per spike in 45nm , 2011, 2011 IEEE Custom Integrated Circuits Conference (CICC).
[13] Sumit Gulwani,et al. From relational verification to SIMD loop synthesis , 2013, PPoPP '13.
[14] Emina Torlak,et al. Growing solver-aided languages with rosette , 2013, Onward!.
[15] Sanjit A. Seshia,et al. Combinatorial sketching for finite programs , 2006, ASPLOS XII.
[16] Koushik Sen,et al. CodeHint: dynamic and interactive synthesis of code snippets , 2014, ICSE.
[17] Alexander Aiken,et al. Automatic generation of peephole superoptimizers , 2006, ASPLOS XII.
[18] Chenxin Zhang,et al. Dynamically Reconfigurable Architectures for Real-time Baseband Processing , 2014 .
[19] Sumit Gulwani,et al. Synthesis of loop-free programs , 2011, PLDI '11.
[20] Alan Gray,et al. picoArray technology: the tool's story , 2005, Design, Automation and Test in Europe.
[21] Dariusz Jemielniak,et al. Wikipedia in Short , 2014 .
[22] Richard Kenner,et al. Eliminating branches using a superoptimizer and the GNU C compiler , 1992, PLDI '92.
[23] Scott A. Mahlke,et al. WiBench: An open source kernel suite for benchmarking wireless systems , 2013, 2013 IEEE International Symposium on Workload Characterization (IISWC).
[24] Rajeev Alur,et al. Syntax-guided synthesis , 2013, FMCAD 2013.
[25] Narayanan Vijaykrishnan,et al. Compiler optimizations for low power systems , 2002 .
[26] Takuya Akiba,et al. Calibrating Research in Program Synthesis Using 72,000 Hours of Programmer Time , 2013 .
[27] Alexander Aiken,et al. Stochastic optimization of floating-point programs with tunable precision , 2014, PLDI.
[28] John Judge,et al. Reducing Data Center Energy Consumption , 2008 .
[29] Emina Torlak,et al. A lightweight symbolic virtual machine for solver-aided host languages , 2014, PLDI.
[30] Joe Bungo,et al. The use of compiler optimizations for embedded systems software , 2008, ACM Crossroads.
[31] Henry Massalin. Superoptimizer: a look at the smallest program , 1987, ASPLOS 1987.
[32] Viktor Kuncak,et al. Counterexample-Guided Quantifier Instantiation for Synthesis in SMT , 2015, CAV.