检索结果-内蒙古大学图书馆

42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation (PLDI)

作者： Ren, Xiaolei Ho, Michael Ming, Jiang Lei, Yu Li, Li Univ Texas Arlington Arlington TX 76019 USA Monash Univ Melbourne Vic Australia

ISBN: (纸本)9781450383912

Hunting binary code difference without source code (i.e., binary diffing) has compelling applications in software security. Due to the high variability of binary code, existing solutions have been driven towards measuring semantic similarities from syntactically different code. Since compiler optimization is the most common source contributing to binary code differences in syntax, testing the resilience against the changes caused by different compiler optimization settings has become a standard evaluation step for most binary diffing approaches. For example, 47 top-venue papers in the last 12 years compared different program versions compiled by default optimization levels (e.g., -Ox in GCC and LLVM). Although many of them claim they are immune to compiler transformations, it is yet unclear about their resistance to non-default optimization settings. Especially, we have observed that adversaries explored non-default compiler settings to amplify malware differences. This paper takes the first step to systematically studying the effectiveness of compiler optimization on binary code differences. We tailor search-based iterative compilation for the auto-tuning of binary code differences. We develop BinTuner to search near-optimal optimization sequences that can maximize the amount of binary code differences. We run BinTuner with GCC 10.2 and LLVM 11.0 on SPEC benchmarks (CPU2006 & CPU2017), Coreutils, and OpenSSL. Our experiments show that at the cost of 279 to 1, 881 compilation iterations, BinTuner can find custom optimization sequences that are substantially better than the general -Ox settings. BinTuner's outputs seriously undermine prominent binary diffing tools' comparisons. In addition, the detection rate of the IoT malware variants tuned by BinTuner falls by more than 50%. Our findings paint a cautionary tale for security analysts that attackers have a new way to mutate malware code cost-effectively, and the research community needs to step back to reassess opti

关键词： compiler optimization Binary Code Difference

来源：评论

学校读者我要写书评

暂无评论

OOElala: Order-of-Evaluation Based Alias Analysis for compiler optimization 2020

OOElala: Order-of-Evaluation Based Alias Analysis for Compil...

引用

41st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

作者： Phulia, Ankush Bhagee, Vaibhav Bansal, Sorav Indian Inst Technol Delhi New Delhi India

ISBN: (纸本)9781450376136

In C, the order of evaluation of expressions is unspecified;further for expressions that do not involve function calls, C semantics ensure that there cannot be a data race between two evaluations that can proceed in either order (or concurrently). We explore the optimization opportunity enabled by these non-deterministic expression evaluation semantics in C, and provide a sound compile-time alias analysis to realize the same. Our algorithm is implemented as a part of the Clang/LLVM infrastructure, in a tool called OOElala. Our experimental results demonstrate that the untapped optimization opportunity is significant: code patterns that enable such optimizations are common;the enabled transformations can range from vectorization to improved instruction selection and register allocation;and the resulting speedups can be as high as 2.6x on already-optimized code.

关键词： Undefined Behaviour compiler optimization

来源：评论

学校读者我要写书评

暂无评论

REDUCING PROCESSOR ENERGY CONSUMPTION BY compiler optimization

REDUCING PROCESSOR ENERGY CONSUMPTION BY COMPILER OPTIMIZATI...

引用

IEEE Workshop on Signal Processing Systems (SiPS 2009)

作者： Guzma, Vladimir Pitkanen, Teemu Kellomaki, Pertti Takala, Jarmo Tampere Univ Technol Dept Comp Syst FI-33720 Tampere Finland

ISBN: (纸本)9781424443345

Purpose of embedded computing is to transform input data to output format. Functionality required to achieve this goal is therefore combination of operation executions on computing units and data transfers between those units. To avoid memory bottlenecks, processors use register files to store data during computation. While contributing to increase of speed of computation, this approach introduce restrictions to exploitable parallelism in application due to data anti dependencies and requires substantial amount of energy to move data between register files and computing units. In this paper we analyze effect of compiler optimization technique, software bypassing, to reduce amount of energy required by processor. By utilizing direct data transfers between computing units, we avoid substantial amount of register file traffic. Our results show that application of this compiler optimization technique can reduce overall energy consumption of processor by up to 38%.

关键词： Application Specific Instruction-Set Processors Low Power Computing compiler optimization

来源：评论

学校读者我要写书评

暂无评论

Enhancement of Orchestration Algorithms for compiler optimization

Enhancement of Orchestration Algorithms for Compiler Optimiz...

引用

4th ObCom International Conference on Recent Trends in Computing, Communication and Information Technology

作者： Andrews, J. Sasikala, T. Sathyabama Univ Dept CSE Chennai Tamil Nadu India SRR Engn Coll Chennai Tamil Nadu India

ISBN: (纸本)9783642292187

Applying the right compiler optimizations to a particular program can have a significant impact on program performance. But achieving this target involves lot of complication because arriving at the compiler configuration for a particular problem is a complex process. The performance of the program measured by time and memory depends on the machine architecture, problem domain and the settings of the compiler. Due to the non-linear interaction of compiler optimizations however, determining the best setting is nontrivial. There have been several proposed techniques that search the space of compiler options to find good solutions;however such approaches can be expensive. This paper proposes a different approach using an effective orchestration algorithm strategy. We show that such an approach which outperforms existing orchestration algorithms. In this paper, it is proposed to study the classification of problems, identification of ideal objective functions for different tasks and the ordering of objective function for optimization. In this paper we proposed an automated framework to select the compiler options for a particular problem from large set options. Many previous works consider only limited set of options. For this framework, we implemented compiler optimization selection algorithms such as branch and bound strategy and advanced combined elimination algorithm and evaluated its efficiencies to improve tuning time. Using our technique we achieve better improvement over the highest optimization setting of the MiBench benchmark suite on Intel core duo processor.

关键词： compiler optimization Advanced combined elimination Branch and Bound

来源：评论

学校读者我要写书评

暂无评论

Verification of the correctness of compiler optimization using co-induction

引用

JOURNAL OF DISCRETE MATHEMATICAL SCIENCES & CRYPTOGRAPHY 2007年第3期10卷 329-349页

作者： Thiyagarajan, M. Sairam, N. SASTRA Deemed Univ Sch Comp Thanjavur 613402 Tamil Nadu India

We use co-algebraic theory of Kleene Algebra with Tests (KAT) to verify some common compiler optimizations including common sub-expression elimination, copy propagation, loop hoisting, induction variable elimination and loop unrolling. In each of these cases we give a co-inductive proof (using mixed automata) of the correctness of the optimizing transformation. We have also given a method for constructing a minimal mixed automata and a condition for proving the equivalence of two mixed automata.

关键词： Co-algebra KAT mixed automata compiler optimization

来源：评论

学校读者我要写书评

暂无评论

Speeding up SMT Solving via compiler optimization 2023

Speeding up SMT Solving via Compiler Optimization

引用

31st ACM Joint Meeting of the European Software Engineering Conference / Symposium on the Foundations-of-Software-Engineering (ESEC/FSE)

作者： Mikek, Benjamin Zhang, Qirun Georgia Inst Technol Atlanta GA 30332 USA

ISBN: (纸本)9798400703270

SMT solvers are fundamental tools for reasoning about constraints in practical problems like symbolic execution and program synthesis. Faster SMT solving can improve the performance and precision of those analysis tools. Existing approaches typically speed up SMT solving by developing new heuristics inside particular solvers, which requires nontrivial engineering efforts. This paper presents a new perspective on speeding up SMT solving. We propose SMT-LLVM Optimizing Translation (SLOT), a solver-agnostic pre-processing approach that utilizes existing compiler optimizations to simplify SMT problem instances. We implement SLOT for the two most application-critical SMT theories, bitvectors, and floating-point numbers. Our extensive evaluation based on the standard SMT-LIB benchmarks shows that SLOT can substantially increase the number of solvable SMT formulas given fixed timeouts and achieve mean speedups of nearly 3x for large benchmarks.

关键词： SMT Solvers simplification compiler optimization

来源：评论

学校读者我要写书评

暂无评论

OPTango: Multi-central Representation Learning against Innumerable compiler optimization for Binary Diffing 34

OPTango: Multi-central Representation Learning against Innum...

引用

34th IEEE International Symposium on Software Reliability Engineering (ISSRE)

作者： Geng, Hongna Zhong, Ming Zhang, Peihua Lv, Fang Feng, Xiaobing UCAS CAS ICT SKLP Beijing Peoples R China Chinese Acad Sci ICT SKLP Beijing Peoples R China

ISBN: (纸本)9798350315943

Binary diffing, which quantitatively measures the difference between given binaries, has been broadly used in critical security areas. Previous studies have been tackling the challenge of default compiler optimization, as it can affect binary representation but overlooked the exploration of non-default optimization settings, which can also significantly affect the accuracy of diffing. Recent research indicates a growing trend of compiling applications with non-default optimization settings to magnify binary code discrepancies, enabling them to evade detection by binary diffing tools. This paper takes the first step to systematically studying the resistance of compiler optimization (including default and non-default optimization settings) on binary diffing tasks. To this end, we construct a diverse and unique dataset, OPTBinary, with 3.6 million functions compiled from 514 optimization settings. Then, we propose OPTango, an innovative transformer-based multi-central representation learning approach, exploring the solution to build a compiler optimization-agnostic binary diffing tool. We conduct extensive experiments and benchmark OPTango with state-of-the-art binary diffing approaches. Evaluation results show that OPTango is more robust and significantly outperforms existing methods against both default and non-default compiler optimization.

关键词： Binary diffing compiler optimization representation learning

来源：评论

学校读者我要写书评

暂无评论

Poster: MC/DC Coverage-Oriented compiler optimization for Symbolic Execution 40

Poster: MC/DC Coverage-Oriented Compiler Optimization for Sy...

引用

40th ACM/IEEE International Conference on Software Engineering (ICSE)

作者： Liu, Yijun Chen, Zhenbang Dong, Wei Feng, Chendong Natl Univ Def Technol Coll Comp Changsha Hunan Peoples R China

ISBN: (纸本)9781450356633

Complier optimizations influence the effectiveness and efficiency of symbolic execution. In this extended abstract, we report our recent results of recommending compiler optimizations for symbolic execution w.r.t. MC/DC coverage. We carried out extensive experiments to study the influence of compiler optimizations on MC/DC coverage. Then, an SVM-based optimization recommendation method is designed and implementation. The preliminary experimental results are promising.

关键词： Symbolic Execution compiler optimization Recommendation

来源：评论

学校读者我要写书评

暂无评论

COLE: compiler optimization Level Exploration 08

COLE: Compiler Optimization Level Exploration

引用

6th International Symposium on Code Generation and optimization

作者： Hoste, Kenneth Eeckhout, Lieven Univ Ghent ELIS Dept B-9000 Ghent Belgium

ISBN: (纸本)9781595939784

Modern compilers implement a large number of optimizations which all interact in complex ways, and which all have a different impact oil code quality, compilation time, code size, energy consumption, etc. For this reason, compilers typically provide a limited number of standard optimization levels, such as -01, -02, -03 and -0s, that combine various optimizations providing a number of trade-offs between multiple objective functions (such as code quality, compilation time and code size). The construction of these optimization levels, i.e., choosing which optimizations to activate at each level, is a manual process typically done using high-level heuristics based on the compiler developer's experience. This paper proposes COLE, compiler optimization Level Exploration, a framework or automatically finding Pareto optimal optimization levels through multi-objective evolutionary searching. Our experimental results using GCC and the SPEC CPU benchmarks show that the automatic construction of optimization levels is feasible in practice, and in addition, yields better optimization levels than GCC's manually derived (-0s, -01, -02 and -03) optimization levels, as well as the optimization levels obtained through random sampling. We also demonstrate that COLE can be used to gain insight into the effectiveness of compiler optimizations as well as to better understand a benchmark's sensitivity to compiler optimizations.

关键词： compiler optimization multi-objective search

来源：评论

学校读者我要写书评

暂无评论

Analysis of compiler optimization techniques by using feature mining technique 39

Analysis of compiler optimization techniques by using featur...

引用

39th National Systems Conference (NSC)

作者： Kumar, Tarun Singh, Rajeev Kumar Shiv Nadar Univ Sch Engn Dept Comp Sci & Engn Lucknow Uttar Pradesh India

ISBN: (纸本)9781467368292

Different compilers offer different kind and different level of optimization techniques. These days, scale of applications is increasing rapidly. This increase in scale demands more complex applications to be developed. This results in imbalance of resource capability and application demand. To take maximum of existing resources, compiler optimization techniques are used. There are existing compiler optimization techniques for single core processors. But use of these optimization techniques requires expert level knowledge. optimization of compiler means minimization or maximization or various objectives. These objectives may be latency, size, power requirement etc. Importance of these objectives may vary from one application to other. This paper illustrates analysis of existing optimization techniques, which are available for single core processor systems. The speed-up analysis of different applications is performed and architecture level features are extracted. Analysis graphs are generated at the end to show effect of various program features on applicability of optimization techniques.

关键词： compiler optimization High performance computing Instruction Level Parallelism feature space exploration compilers option selection

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：