3.8 Proceedings Paper

PROGRAML: A Graph-based Program Representation for Data Flow Analysis and Compiler Optimizations

出版社

JMLR-JOURNAL MACHINE LEARNING RESEARCH

关键词

-

资金

  1. European Research Council (ERC) under the European Union [678880, 955606, 955513]
  2. Swiss National Science Foundation [185778]

向作者/读者索取更多资源

The paper discusses the application of machine learning in building compiler optimization heuristics, highlighting the challenges many machine learning methods face in program data flow analysis. By formulating data flow analysis as supervised learning tasks and introducing a dataset of programs and corresponding labels, the authors propose a language-independent representation of program semantics, PROGRAML, which overcomes limitations of prior works and improves performance on optimization tasks.
Machine learning (ML) is increasingly seen as a viable approach for building compiler optimization heuristics, but many ML methods cannot replicate even the simplest of the data flow analyses that are critical to making good optimization decisions. We posit that if ML cannot do that, then it is insufficiently able to reason about programs. We formulate data flow analyses as supervised learning tasks and introduce a large open dataset of programs and their corresponding labels from several analyses. We use this dataset to benchmark ML methods and show that they struggle on these fundamental program reasoning tasks. We propose PROGRAML - Program Graphs for Machine Learning - a language-independent, portable representation of program semantics. PROGRAML overcomes the limitations of prior works and yields improved performance on downstream optimization tasks.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

3.8
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据