Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation最新文献

Statistical similarity of binaries 二进制文件的统计相似性

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908126

Yaniv David, Nimrod Partush, Eran Yahav

引用次数: 139

Verified lifting of stencil computations 验证了模具吊装计算

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908117

S. Kamil, Alvin Cheung, Shachar Itzhaky, Armando Solar-Lezama

{"title":"Verified lifting of stencil computations","authors":"S. Kamil, Alvin Cheung, Shachar Itzhaky, Armando Solar-Lezama","doi":"10.1145/2908080.2908117","DOIUrl":"https://doi.org/10.1145/2908080.2908117","url":null,"abstract":"This paper demonstrates a novel combination of program synthesis and verification to lift stencil computations from low-level Fortran code to a high-level summary expressed using a predicate language. The technique is sound and mostly automated, and leverages counter-example guided inductive synthesis (CEGIS) to find provably correct translations. Lifting existing code to a high-performance description language has a number of benefits, including maintainability and performance portability. For example, our experiments show that the lifted summaries can enable domain specific compilers to do a better job of parallelization as compared to an off-the-shelf compiler working on the original code, and can even support fully automatic migration to hardware accelerators such as GPUs. We have implemented verified lifting in a system called STNG and have evaluated it using microbenchmarks, mini-apps, and real-world applications. We demonstrate the benefits of verified lifting by first automatically summarizing Fortran source code into a high-level predicate language, and subsequently translating the lifted summaries into Halide, with the translated code achieving median performance speedups of 4.1X and up to 24X for non-trivial stencils as compared to the original implementation.","PeriodicalId":178839,"journal":{"name":"Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"80 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127099726","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}

引用次数: 71

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation 第37届ACM SIGPLAN编程语言设计与实现会议论文集

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080

C. Krintz, E. Berger

引用次数: 2

SDNRacer: concurrency analysis for software-defined networks SDNRacer:软件定义网络的并发分析

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908124

Ahmed El-Hassany, Jeremie Miserez, Pavol Bielik, L. Vanbever, Martin T. Vechev

引用次数: 42

Assessing the limits of program-specific garbage collection performance 评估特定于程序的垃圾收集性能的限制

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908120

Nicholas Jacek, Meng-Chieh Chiu, Benjamin M Marlin, E. Moss

引用次数: 8

Remix: online detection and repair of cache contention for the JVM Remix:在线检测和修复JVM的缓存争用

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908090

Ariel Eizenberg, Shiliang Hu, Gilles A. Pokam, Joseph Devietti

{"title":"Remix: online detection and repair of cache contention for the JVM","authors":"Ariel Eizenberg, Shiliang Hu, Gilles A. Pokam, Joseph Devietti","doi":"10.1145/2908080.2908090","DOIUrl":"https://doi.org/10.1145/2908080.2908090","url":null,"abstract":"As ever more computation shifts onto multicore architectures, it is increasingly critical to find effective ways of dealing with multithreaded performance bugs like true and false sharing. Previous approaches to fixing false sharing in unmanaged languages have employed highly-invasive runtime program modifications. We observe that managed language runtimes, with garbage collection and JIT code compilation, present unique opportunities to repair such bugs directly, mirroring the techniques used in manual repairs. We present Remix, a modified version of the Oracle HotSpot JVM which can detect cache contention bugs and repair false sharing at runtime. Remix's detection mechanism leverages recent performance counter improvements on Intel platforms, which allow for precise, unobtrusive monitoring of cache contention at the hardware level. Remix can detect and repair known false sharing issues in the LMAX Disruptor high-performance inter-thread messaging library and the Spring Reactor event-processing framework, automatically providing 1.5-2x speedups over unoptimized code and matching the performance of hand-optimization. Remix also finds a new false sharing bug in SPECjvm2008, and uncovers a true sharing bug in the HotSpot JVM that, when fixed, improves the performance of three NAS Parallel Benchmarks by 7-25x. Remix incurs no statistically-significant performance overhead on other benchmarks that do not exhibit cache contention, making Remix practical for always-on use.","PeriodicalId":178839,"journal":{"name":"Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127694578","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}

引用次数: 28

Data-driven precondition inference with learned features 基于学习特征的数据驱动的前提推理

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908099

Saswat Padhi, Rahul Sharma, T. Millstein

引用次数: 107

Cardinalities and universal quantifiers for verifying parameterized systems 用于验证参数化系统的基数和通用量词

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908129

K. V. Gleissenthall, N. Bjørner, A. Rybalchenko

引用次数: 30

End-to-end verification of information-flow security for C and assembly programs C和汇编程序信息流安全性的端到端验证

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908100

D. Costanzo, Zhong Shao, Ronghui Gu

{"title":"End-to-end verification of information-flow security for C and assembly programs","authors":"D. Costanzo, Zhong Shao, Ronghui Gu","doi":"10.1145/2908080.2908100","DOIUrl":"https://doi.org/10.1145/2908080.2908100","url":null,"abstract":"Protecting the confidentiality of information manipulated by a computing system is one of the most important challenges facing today's cybersecurity community. A promising step toward conquering this challenge is to formally verify that the end-to-end behavior of the computing system really satisfies various information-flow policies. Unfortunately, because today's system software still consists of both C and assembly programs, the end-to-end verification necessarily requires that we not only prove the security properties of individual components, but also carefully preserve these properties through compilation and cross-language linking. In this paper, we present a novel methodology for formally verifying end-to-end security of a software system that consists of both C and assembly programs. We introduce a general definition of observation function that unifies the concepts of policy specification, state indistinguishability, and whole-execution behaviors. We show how to use different observation functions for different levels of abstraction, and how to link different security proofs across abstraction levels using a special kind of simulation that is guaranteed to preserve state indistinguishability. To demonstrate the effectiveness of our new methodology, we have successfully constructed an end-to-end security proof, fully formalized in the Coq proof assistant, of a nontrivial operating system kernel (running on an extended CompCert x86 assembly machine model). Some parts of the kernel are written in C and some are written in assembly; we verify all of the code, regardless of language.","PeriodicalId":178839,"journal":{"name":"Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124631139","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}

引用次数: 71

Synthesizing transformations on hierarchically structured data 对分层结构数据进行综合转换

Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2016-06-02 DOI: 10.1145/2908080.2908088

Navid Yaghmazadeh, Christian Klinger, Işıl Dillig, Swarat Chaudhuri

引用次数: 55