Automatic Synthesis of Compilable C Benchmarks from Open Source Repositories
暂无分享,去创建一个
Anderson Faustino da Silva | Breno Campos Ferreira Guimarães | José Wesley de S. Magalhães | B. Guimarães | A. F. Silva | Bruno Conde Kind | Jerónimo Nunes | Rocha | José Wesley de Souza Magalhães | Jerônimo Nunes | J. N. Rocha | Anderson Faustino | Uem Brazil DA SILVA | Ufmg BRUNO CONDE KIND | Brazil José | Ufmg WESLEY DE SOUZA MAGALHÃES | Brazil Jerônimo | Ufmg Brazil NUNES ROCHA | Breno Campos | Ufmg FERREIRA GUIMARÃES | Brazil Fernando | U. B. M Q PEREIRA | Bruno Conde | Fernando M Q Pereira
[1] Chris Cummins,et al. Compiler fuzzing through deep learning , 2018, ISSTA.
[2] Gergö Barany,et al. Liveness-Driven Random Program Generation , 2017, LOPSTR.
[3] Gianluca Palermo,et al. COBAYN: Compiler Autotuning Framework Using Bayesian Networks , 2016, ACM Trans. Archit. Code Optim..
[4] David H. Bailey,et al. The Nas Parallel Benchmarks , 1991, Int. J. High Perform. Comput. Appl..
[5] Michael F. P. O'Boyle,et al. Mapping parallelism to multi-cores: a machine learning based approach , 2009, PPoPP '09.
[6] Michael F. P. O'Boyle,et al. Partitioning streaming parallelism for multi-cores: A machine learning based approach , 2010, 2010 19th International Conference on Parallel Architectures and Compilation Techniques (PACT).
[7] Mark Harman,et al. Evolving transformation sequences using genetic algorithms , 2004, Source Code Analysis and Manipulation, Fourth IEEE International Workshop on.
[8] Anderson Faustino da Silva,et al. Yet Another Intelligent Code-Generating System: A Flexible and Low-Cost Solution , 2018, Journal of Computer Science and Technology.
[9] Mineo Takai,et al. Parssec: A Parallel Simulation Environment for Complex Systems , 1998, Computer.
[10] Vikram S. Adve,et al. LLVM: a compilation framework for lifelong program analysis & transformation , 2004, International Symposium on Code Generation and Optimization, 2004. CGO 2004..
[11] Fang Yu. Code Compression ∗ , 2006 .
[12] Saman P. Amarasinghe,et al. Meta optimization: improving compiler heuristics with machine learning , 2003, PLDI '03.
[13] Riccardo Poli,et al. Particle swarm optimization , 1995, Swarm Intelligence.
[14] Olivier Temam,et al. Collective optimization: A practical collaborative approach , 2010, TACO.
[15] Andrew S. Tanenbaum,et al. Using Peephole Optimization on Intermediate Code , 1982, TOPL.
[16] Yunheung Paek,et al. Finding effective optimization phase sequences , 2003, LCTES '03.
[17] Gabriel Poesia,et al. Static placement of computation on heterogeneous devices , 2017, Proc. ACM Program. Lang..
[18] Atsushi Hashimoto,et al. Detecting Arithmetic Optimization Opportunities for C Compilers by Randomly Generated Equivalent Programs , 2016, IPSJ Trans. Syst. LSI Des. Methodol..
[19] Anderson Faustino da Silva,et al. Exploration of Compiler Optimization Sequences Using a Hybrid Approach , 2018, Comput. Informatics.
[20] Benoît Dupont de Dinechin,et al. Fast liveness checking for ssa-form programs , 2008, CGO '08.
[21] S. Hewitt,et al. 2006 , 2018, Los 25 años de la OMC: Una retrospectiva fotográfica.
[22] Árpád Beszédes,et al. Code Factoring in GCC , 2004 .
[23] Christopher C. Cummins,et al. Synthesizing benchmarks for predictive modeling , 2017, 2017 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
[24] John L. Henning. SPEC CPU2006 benchmark descriptions , 2006, CARN.
[25] Rajkishore Barik,et al. A black-box approach to energy-aware scheduling on integrated CPU-GPU systems , 2016, 2016 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
[26] Uri Alon,et al. code2vec: learning distributed representations of code , 2018, Proc. ACM Program. Lang..
[27] Tarek S. Abdelrahman,et al. Use of Synthetic Benchmarks for Machine-Learning-Based Performance Auto-Tuning , 2017, 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW).
[28] Georgios Gousios,et al. Lean GHTorrent: GitHub data on demand , 2014, MSR 2014.
[29] Keith D. Cooper,et al. Optimizing for reduced code space using genetic algorithms , 1999, LCTES '99.
[30] Trevor Mudge,et al. MiBench: A free, commercially representative embedded benchmark suite , 2001 .
[31] Leandro T. C. Melo,et al. Inference of static semantics for incomplete C programs , 2017, Proc. ACM Program. Lang..
[32] Sriraman Tallam,et al. Safe ICF: Pointer Safe and Unwinding Aware Identical Code Folding in Gold , 2010 .
[33] Kazuhiro Nakamura,et al. Introducing Loop Statements in Random Testing of C Compilers Based on Expected Value Calculation , 2015 .
[34] Michael F. P. O'Boyle,et al. Smart multi-task scheduling for OpenCL programs on CPU/GPU heterogeneous platforms , 2014, 2014 21st International Conference on High Performance Computing (HiPC).
[35] Alexander Aiken,et al. Stochastic program optimization , 2016, Commun. ACM.
[36] J. Cocke. Global common subexpression elimination , 1970, Symposium on Compiler Optimization.
[37] Michael F. P. O'Boyle,et al. Milepost GCC: Machine Learning Enabled Self-tuning Compiler , 2011, International Journal of Parallel Programming.
[38] Thorsten Meinl,et al. Graph-Based Procedural Abstraction , 2008, International Symposium on Code Generation and Optimization (CGO'07).
[39] Kevin Skadron,et al. Rodinia: A benchmark suite for heterogeneous computing , 2009, 2009 IEEE International Symposium on Workload Characterization (IISWC).
[40] Atsushi Hashimoto,et al. Reinforcing Random Testing of Arithmetic Optimization of C Compilers by Scaling up Size and Number of Expressions , 2014, IPSJ Trans. Syst. LSI Des. Methodol..
[41] Keith D. Cooper,et al. Effective partial redundancy elimination , 1994, PLDI '94.
[42] Xuejun Yang,et al. Finding and understanding bugs in C compilers , 2011, PLDI '11.
[43] Dinakar Dhurjati,et al. Scaling up Superoptimization , 2016, ASPLOS.
[44] Martin Líska. Optimizing large applications , 2014, ArXiv.
[45] 유춘자. 1991 , 1992, The Winning Cars of the Indianapolis 500.
[46] Murray Cole,et al. Function Merging by Sequence Alignment , 2019, 2019 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
[47] Albert Cohen,et al. Practical aggregation of semantical program properties for machine learning based optimization , 2010, CASES '10.
[48] Abdoulaye Gamatié,et al. Compiler-assisted Adaptive Program Scheduling in big.LITTLE Systems , 2019, ArXiv.
[49] Gergö Barany,et al. Finding missed compiler optimizations by differential testing , 2018, CC.
[50] José Nelson Amaral,et al. To Inline or Not to Inline? Enhanced Inlining Decisions , 2003, LCPC.
[51]
Shankar Balachandran,et al.
[52] Alexander Aiken,et al. Binary Translation Using Peephole Superoptimizers , 2008, OSDI.
[53] Fernando Magno Quintão Pereira,et al. Static Prediction of Silent Stores , 2019, ACM Trans. Archit. Code Optim..
[54] Björn Franke,et al. Exploiting function similarity for code size reduction , 2014, LCTES '14.
[55] Zheng Wang,et al. Machine Learning in Compiler Optimization , 2018, Proceedings of the IEEE.
[56] Michael F. P. O'Boyle,et al. Using machine learning to focus iterative optimization , 2006, International Symposium on Code Generation and Optimization (CGO'06).
[57] Peter E. Hart,et al. Nearest neighbor pattern classification , 1967, IEEE Trans. Inf. Theory.
[58] Pushmeet Kohli,et al. Learning to superoptimize programs - Workshop Version , 2016, ICLR.
[59] Gianluca Palermo,et al. A Survey on Compiler Autotuning using Machine Learning , 2018, ACM Comput. Surv..
[60] Siraj Muhammad,et al. Improved Similarity Measures for Software Clustering , 2011, 2011 15th European Conference on Software Maintenance and Reengineering.
[61] Sameer Kulkarni,et al. Automatic construction of inlining heuristics using machine learning , 2013, Proceedings of the 2013 IEEE/ACM International Symposium on Code Generation and Optimization (CGO).
[62] Bernhard Steffen,et al. Partial dead code elimination , 1994, PLDI '94.