Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation最新文献_第6页

Compiler testing via a theory of sound optimisations in the C11/C++11 memory model 编译器测试通过一个理论的声音优化在C11/ c++ 11内存模型

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2491967

Robin Morisset, P. Pawan, Francesco Zappa Nardelli

引用次数: 61

Programming languages in security: keynote 安全中的编程语言:主题演讲

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462158

F. Schneider

引用次数: 0

Monadic abstract interpreters 一元抽象解释器

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2491979

Ilya Sergey, Dominique Devriese, M. Might, Jan Midtgaard, David Darais, D. Clarke, F. Piessens

{"title":"Monadic abstract interpreters","authors":"Ilya Sergey, Dominique Devriese, M. Might, Jan Midtgaard, David Darais, D. Clarke, F. Piessens","doi":"10.1145/2491956.2491979","DOIUrl":"https://doi.org/10.1145/2491956.2491979","url":null,"abstract":"Recent developments in the systematic construction of abstract interpreters hinted at the possibility of a broad unification of concepts in static analysis. We deliver that unification by showing context-sensitivity, polyvariance, flow-sensitivity, reachability-pruning, heap-cloning and cardinality-bounding to be independent of any particular semantics. Monads become the unifying agent between these concepts and between semantics. For instance, by plugging the same \"context-insensitivity monad\" into a monadically-parameterized semantics for Java or for the lambda calculus, it yields the expected context-insensitive analysis. To achieve this unification, we develop a systematic method for transforming a concrete semantics into a monadically-parameterized abstract machine. Changing the monad changes the behavior of the machine. By changing the monad, we recover a spectrum of machines---from the original concrete semantics to a monovariant, flow- and context-insensitive static analysis with a singly-threaded heap and weak updates. The monadic parameterization also suggests an abstraction over the ubiquitous monotone fixed-point computation found in static analysis. This abstraction makes it straightforward to instrument an analysis with high-level strategies for improving precision and performance, such as abstract garbage collection and widening. While the paper itself runs the development for continuation-passing style, our generic implementation replays it for direct-style lambda-calculus and Featherweight Java to support generality.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"38 5","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114013027","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 34

Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines Halide:一种语言和编译器，用于优化图像处理管道中的并行性、局部性和重计算

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462176

Jonathan Ragan-Kelley, Connelly Barnes, Andrew Adams, Sylvain Paris, F. Durand, Saman P. Amarasinghe

{"title":"Halide: a language and compiler for optimizing parallelism, locality, and recomputation in image processing pipelines","authors":"Jonathan Ragan-Kelley, Connelly Barnes, Andrew Adams, Sylvain Paris, F. Durand, Saman P. Amarasinghe","doi":"10.1145/2491956.2462176","DOIUrl":"https://doi.org/10.1145/2491956.2462176","url":null,"abstract":"Image processing pipelines combine the challenges of stencil computations and stream programs. They are composed of large graphs of different stencil stages, as well as complex reductions, and stages with global or data-dependent access patterns. Because of their complex structure, the performance difference between a naive implementation of a pipeline and an optimized one is often an order of magnitude. Efficient implementations require optimization of both parallelism and locality, but due to the nature of stencils, there is a fundamental tension between parallelism, locality, and introducing redundant recomputation of shared values. We present a systematic model of the tradeoff space fundamental to stencil pipelines, a schedule representation which describes concrete points in this space for each stage in an image processing pipeline, and an optimizing compiler for the Halide image processing language that synthesizes high performance implementations from a Halide algorithm and a schedule. Combining this compiler with stochastic search over the space of schedules enables terse, composable programs to achieve state-of-the-art performance on a wide range of real image processing pipelines, and across different hardware architectures, including multicores with SIMD, and heterogeneous CPU+GPU execution. From simple Halide programs written in a few hours, we demonstrate performance up to 5x faster than hand-tuned C, intrinsics, and CUDA implementations optimized by experts over weeks or months, for image processing applications beyond the reach of past automatic compilers.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121710655","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1077

Scalable variable and data type detection in a binary rewriter 二进制重写器中的可伸缩变量和数据类型检测

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462165

Khaled Elwazeer, K. Anand, A. Kotha, M. Smithson, R. Barua

引用次数: 78

SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplication SMAT:用于稀疏矩阵向量乘法的输入自适应自动调谐器

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462181

Jiajia Li, Guangming Tan, Mingyu Chen, Ninghui Sun

{"title":"SMAT: an input adaptive auto-tuner for sparse matrix-vector multiplication","authors":"Jiajia Li, Guangming Tan, Mingyu Chen, Ninghui Sun","doi":"10.1145/2491956.2462181","DOIUrl":"https://doi.org/10.1145/2491956.2462181","url":null,"abstract":"Sparse Matrix Vector multiplication (SpMV) is an important kernel in both traditional high performance computing and emerging data-intensive applications. By far, SpMV libraries are optimized by either application-specific or architecture-specific approaches, making the libraries become too complicated to be used extensively in real applications. In this work we develop a Sparse Matrix-vector multiplication Auto-Tuning system (SMAT) to bridge the gap between specific optimizations and general-purpose usage. SMAT provides users with a unified programming interface in compressed sparse row (CSR) format and automatically determines the optimal format and implementation for any input sparse matrix at runtime. For this purpose, SMAT leverages a learning model, which is generated in an off-line stage by a machine learning method with a training set of more than 2000 matrices from the UF sparse matrix collection, to quickly predict the best combination of the matrix feature parameters. Our experiments show that SMAT achieves impressive performance of up to 51GFLOPS in single-precision and 37GFLOPS in double-precision on mainstream x86 multi-core processors, which are both more than 3 times faster than the Intel MKL library. We also demonstrate its adaptability in an algebraic multigrid solver from Hypre library with above 20% performance improvement reported.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133180713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 123

Session details: Analysis 会话详细信息:

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/3245337

B. Liblit

引用次数: 0

How to combine widening and narrowing for non-monotonic systems of equations 如何结合非单调方程组的加宽与缩窄

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462190

Kalmer Apinis, H. Seidl, Vesal Vojdani

{"title":"How to combine widening and narrowing for non-monotonic systems of equations","authors":"Kalmer Apinis, H. Seidl, Vesal Vojdani","doi":"10.1145/2491956.2462190","DOIUrl":"https://doi.org/10.1145/2491956.2462190","url":null,"abstract":"Non-trivial analysis problems require complete lattices with infinite ascending and descending chains. In order to compute reasonably precise post-fixpoints of the resulting systems of equations, Cousot and Cousot have suggested accelerated fixpoint iteration by means of widening and narrowing. The strict separation into phases, however, may unnecessarily give up precision that cannot be recovered later. While widening is also applicable if equations are non-monotonic, this is no longer the case for narrowing. A narrowing iteration to improve a given post-fixpoint, additionally, must assume that all right-hand sides are monotonic. The latter assumption, though, is not met in presence of widening. It is also not met by equation systems corresponding to context-sensitive interprocedural analysis, possibly combining context-sensitive analysis of local information with flow-insensitive analysis of globals. As a remedy, we present a novel operator that combines a given widening operator with a given narrowing operator. We present adapted versions of round-robin as well as of worklist iteration, local, and side-effecting solving algorithms for the combined operator and prove that the resulting solvers always return sound results and are guaranteed to terminate for monotonic systems whenever only finitely many unknowns (constraint variables) are encountered.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123444525","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 20

Complete completion using types and weights 使用类型和权重完成补全

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/2491956.2462192

Tihomir Gvero, Viktor Kunčak, I. Kuraj, R. Piskac

引用次数: 142

Session details: Verification 2 会话详细信息

Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2013-06-16 DOI: 10.1145/3245340

S. Blackburn

引用次数: 0