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

Mesh: compacting memory management for C/C++ applications 网格:为C/ c++应用程序压缩内存管理

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2019-02-13 DOI: 10.1145/3314221.3314582

Bobby Powers, D. Tench, E. Berger, A. Mcgregor

引用次数: 22

Cost analysis of nondeterministic probabilistic programs 不确定概率方案的成本分析

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2019-02-12 DOI: 10.1145/3314221.3314581

K. Chatterjee, Hongfei Fu, A. K. Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi

{"title":"Cost analysis of nondeterministic probabilistic programs","authors":"K. Chatterjee, Hongfei Fu, A. K. Goharshady, Peixin Wang, Xudong Qin, Wenjun Shi","doi":"10.1145/3314221.3314581","DOIUrl":"https://doi.org/10.1145/3314221.3314581","url":null,"abstract":"We consider the problem of expected cost analysis over nondeterministic probabilistic programs, which aims at automated methods for analyzing the resource-usage of such programs. Previous approaches for this problem could only handle nonnegative bounded costs. However, in many scenarios, such as queuing networks or analysis of cryptocurrency protocols, both positive and negative costs are necessary and the costs are unbounded as well. In this work, we present a sound and efficient approach to obtain polynomial bounds on the expected accumulated cost of nondeterministic probabilistic programs. Our approach can handle (a) general positive and negative costs with bounded updates in variables; and (b) nonnegative costs with general updates to variables. We show that several natural examples which could not be handled by previous approaches are captured in our framework. Moreover, our approach leads to an efficient polynomial-time algorithm, while no previous approach for cost analysis of probabilistic programs could guarantee polynomial runtime. Finally, we show the effectiveness of our approach using experimental results on a variety of programs for which we efficiently synthesize tight resource-usage bounds.","PeriodicalId":441774,"journal":{"name":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"127 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-02-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133679060","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}

引用次数: 35

Bidirectional type checking for relational properties 关系属性的双向类型检查

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2018-12-12 DOI: 10.1145/3314221.3314603

Ezgi Çiçek, Weihao Qu, G. Barthe, Marco Gaboardi, D. Garg

{"title":"Bidirectional type checking for relational properties","authors":"Ezgi Çiçek, Weihao Qu, G. Barthe, Marco Gaboardi, D. Garg","doi":"10.1145/3314221.3314603","DOIUrl":"https://doi.org/10.1145/3314221.3314603","url":null,"abstract":"Relational type systems have been designed for several applications including information flow, differential privacy, and cost analysis. In order to achieve the best results, these systems often use relational refinements and relational effects to maximally exploit the similarity in the structure of the two programs being compared. Relational type systems are appealing for relational properties because they deliver simpler and more precise verification than what could be derived from typing the two programs separately. However, relational type systems do not yet achieve the practical appeal of their non-relational counterpart, in part because of the lack of a general foundation for implementing them. In this paper, we take a step in this direction by developing bidirectional relational type checking for systems with relational refinements and effects. Our approach achieves the benefits of bidirectional type checking, in a relational setting. In particular, it significantly reduces the need for typing annotations through the combination of type checking and type inference. In order to highlight the foundational nature of our approach, we develop bidirectional versions of several relational type systems which incrementally combine many different components needed for expressive relational analysis.","PeriodicalId":441774,"journal":{"name":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"45 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120927128","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}

引用次数: 13

Sound regular expression semantics for dynamic symbolic execution of JavaScript JavaScript动态符号执行的合理正则表达式语义

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2018-10-10 DOI: 10.1145/3314221.3314645

Blake Loring, Duncan Mitchell, Johannes Kinder

引用次数: 20

Scenic: a language for scenario specification and scene generation 场景:一种用于场景规范和场景生成的语言

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2018-09-25 DOI: 10.1145/3314221.3314633

Daniel J. Fremont, T. Dreossi, Shromona Ghosh, Xiangyu Yue, A. Sangiovanni-Vincentelli, S. Seshia

{"title":"Scenic: a language for scenario specification and scene generation","authors":"Daniel J. Fremont, T. Dreossi, Shromona Ghosh, Xiangyu Yue, A. Sangiovanni-Vincentelli, S. Seshia","doi":"10.1145/3314221.3314633","DOIUrl":"https://doi.org/10.1145/3314221.3314633","url":null,"abstract":"We propose a new probabilistic programming language for the design and analysis of perception systems, especially those based on machine learning. Specifically, we consider the problems of training a perception system to handle rare events, testing its performance under different conditions, and debugging failures. We show how a probabilistic programming language can help address these problems by specifying distributions encoding interesting types of inputs and sampling these to generate specialized training and test sets. More generally, such languages can be used for cyber-physical systems and robotics to write environment models, an essential prerequisite to any formal analysis. In this paper, we focus on systems like autonomous cars and robots, whose environment is a scene, a configuration of physical objects and agents. We design a domain-specific language, Scenic, for describing scenarios that are distributions over scenes. As a probabilistic programming language, Scenic allows assigning distributions to features of the scene, as well as declaratively imposing hard and soft constraints over the scene. We develop specialized techniques for sampling from the resulting distribution, taking advantage of the structure provided by Scenic's domain-specific syntax. Finally, we apply Scenic in a case study on a convolutional neural network designed to detect cars in road images, improving its performance beyond that achieved by state-of-the-art synthetic data generation methods.","PeriodicalId":441774,"journal":{"name":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"182 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124596825","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}

引用次数: 174

Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs 作为契约的大小变化终止:动态和静态地强制终止高阶程序

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2018-08-06 DOI: 10.1145/3314221.3314643

Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn

{"title":"Size-change termination as a contract: dynamically and statically enforcing termination for higher-order programs","authors":"Phuc C. Nguyen, Thomas Gilray, Sam Tobin-Hochstadt, David Van Horn","doi":"10.1145/3314221.3314643","DOIUrl":"https://doi.org/10.1145/3314221.3314643","url":null,"abstract":"Termination is an important but undecidable program property, which has led to a large body of work on static methods for conservatively predicting or enforcing termination. One such method is the size-change termination approach of Lee, Jones, and Ben-Amram, which operates in two phases: (1) abstract programs into “size-change graphs,” and (2) check these graphs for the size-change property: the existence of paths that lead to infinite decreasing sequences. We transpose these two phases with an operational semantics that accounts for the run-time enforcement of the size-change property, postponing (or entirely avoiding) program abstraction. This choice has two key consequences: (1) size-change termination can be checked at run-time and (2) termination can be rephrased as a safety property analyzed using existing methods for systematic abstraction. We formulate run-time size-change checks as contracts in the style of Findler and Felleisen. The result compliments existing contracts that enforce partial correctness specifications to obtain contracts for total correctness. Our approach combines the robustness of the size-change principle for termination with the precise information available at run-time. It has tunable overhead and can check for nontermination without the conservativeness necessary in static checking. To obtain a sound and computable termination analysis, we apply existing abstract interpretation techniques directly to the operational semantics, avoiding the need for custom abstractions for termination. The resulting analyzer is competitive with with existing, purpose-built analyzers.","PeriodicalId":441774,"journal":{"name":"Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-08-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134462909","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}

引用次数: 8

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

Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 1900-01-01 DOI: 10.1145/3314221

引用次数: 1