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

FlashRelate: extracting relational data from semi-structured spreadsheets using examples FlashRelate:使用示例从半结构化电子表格中提取关系数据

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737952

Daniel W. Barowy, Sumit Gulwani, Ted Hart, B. Zorn

{"title":"FlashRelate: extracting relational data from semi-structured spreadsheets using examples","authors":"Daniel W. Barowy, Sumit Gulwani, Ted Hart, B. Zorn","doi":"10.1145/2737924.2737952","DOIUrl":"https://doi.org/10.1145/2737924.2737952","url":null,"abstract":"With hundreds of millions of users, spreadsheets are one of the most important end-user applications. Spreadsheets are easy to use and allow users great flexibility in storing data. This flexibility comes at a price: users often treat spreadsheets as a poor man's database, leading to creative solutions for storing high-dimensional data. The trouble arises when users need to answer queries with their data. Data manipulation tools make strong assumptions about data layouts and cannot read these ad-hoc databases. Converting data into the appropriate layout requires programming skills or a major investment in manual reformatting. The effect is that a vast amount of real-world data is \"locked-in\" to a proliferation of one-off formats. We introduce FlashRelate, a synthesis engine that lets ordinary users extract structured relational data from spreadsheets without programming. Instead, users extract data by supplying examples of output relational tuples. FlashRelate uses these examples to synthesize a program in Flare. Flare is a novel extraction language that extends regular expressions with geometric constructs. An interactive user interface on top of FlashRelate lets end users extract data by point-and-click. We demonstrate that correct Flare programs can be synthesized in seconds from a small set of examples for 43 real-world scenarios. Finally, our case study demonstrates FlashRelate's usefulness addressing the widespread problem of data trapped in corporate and government formats.","PeriodicalId":104101,"journal":{"name":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130474087","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

Provably correct peephole optimizations with alive 可证明正确的窥视孔优化与活

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737965

Nuno P. Lopes, David Menendez, Santosh Nagarakatte, J. Regehr

引用次数: 120

Lightweight, flexible object-oriented generics 轻量级、灵活的面向对象泛型

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2738008

Yizhou Zhang, Matthew C. Loring, G. Salvaneschi, B. Liskov, A. Myers

{"title":"Lightweight, flexible object-oriented generics","authors":"Yizhou Zhang, Matthew C. Loring, G. Salvaneschi, B. Liskov, A. Myers","doi":"10.1145/2737924.2738008","DOIUrl":"https://doi.org/10.1145/2737924.2738008","url":null,"abstract":"The support for generic programming in modern object-oriented programming languages is awkward and lacks desirable expressive power. We introduce an expressive genericity mechanism that adds expressive power and strengthens static checking, while remaining lightweight and simple in common use cases. Like type classes and concepts, the mechanism allows existing types to model type constraints retroactively. For expressive power, we expose models as named constructs that can be defined and selected explicitly to witness constraints; in common uses of genericity, however, types implicitly witness constraints without additional programmer effort. Models are integrated into the object-oriented style, with features like model generics, model-dependent types, model enrichment, model multimethods, constraint entailment, model inheritance, and existential quantification further extending expressive power in an object-oriented setting. We introduce the new genericity features and show that common generic programming idioms, including current generic libraries, can be expressed more precisely and concisely. The static semantics of the mechanism and a proof of a key decidability property can be found in an associated technical report.","PeriodicalId":104101,"journal":{"name":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129841262","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}

引用次数: 23

Compositional certified resource bounds 组合认证资源边界

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737955

Quentin Carbonneaux, Jan Hoffmann, Zhong Shao

{"title":"Compositional certified resource bounds","authors":"Quentin Carbonneaux, Jan Hoffmann, Zhong Shao","doi":"10.1145/2737924.2737955","DOIUrl":"https://doi.org/10.1145/2737924.2737955","url":null,"abstract":"This paper presents a new approach for automatically deriving worst-case resource bounds for C programs. The described technique combines ideas from amortized analysis and abstract interpretation in a unified framework to address four challenges for state-of-the-art techniques: compositionality, user interaction, generation of proof certificates, and scalability. Compositionality is achieved by incorporating the potential method of amortized analysis. It enables the derivation of global whole-program bounds with local derivation rules by naturally tracking size changes of variables in sequenced loops and function calls. The resource consumption of functions is described abstractly and a function call can be analyzed without access to the function body. User interaction is supported with a new mechanism that clearly separates qualitative and quantitative verification. A user can guide the analysis to derive complex non-linear bounds by using auxiliary variables and assertions. The assertions are separately proved using established qualitative techniques such as abstract interpretation or Hoare logic. Proof certificates are automatically generated from the local derivation rules. A soundness proof of the derivation system with respect to a formal cost semantics guarantees the validity of the certificates. Scalability is attained by an efficient reduction of bound inference to a linear optimization problem that can be solved by off-the-shelf LP solvers. The analysis framework is implemented in the publicly-available tool C4B. An experimental evaluation demonstrates the advantages of the new technique with a comparison of C4B with existing tools on challenging micro benchmarks and the analysis of more than 2900 lines of C code from the cBench benchmark suite.","PeriodicalId":104101,"journal":{"name":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131164796","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}

引用次数: 97

DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs DAG内联:层次规划中可达性-模理论的决策过程

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737987

A. Lal, S. Qadeer

{"title":"DAG inlining: a decision procedure for reachability-modulo-theories in hierarchical programs","authors":"A. Lal, S. Qadeer","doi":"10.1145/2737924.2737987","DOIUrl":"https://doi.org/10.1145/2737924.2737987","url":null,"abstract":"A hierarchical program is one with multiple procedures but no loops or recursion. This paper studies the problem of deciding reachability queries in hierarchical programs where individual statements can be encoded in a decidable logic (say in SMT). This problem is fundamental to verification and most directly applicable to doing bounded reachability in programs, i.e., reachability under a bound on the number of loop iterations and recursive calls. The usual method of deciding reachability in hierarchical programs is to first inline all procedures and then do reachability on the resulting single-procedure program. Such inlining unfolds the call graph of the program to a tree and may lead to an exponential increase in the size of the program. We design and evaluate a method called DAG inlining that unfolds the call graph to a directed acyclic graph (DAG) instead of a tree by sharing the bodies of procedures at certain points during inlining. DAG inlining can produce much more compact representations than tree inlining. Empirically, we show that it leads to significant improvements in the running time of a state-of-the-art verifier.","PeriodicalId":104101,"journal":{"name":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"2001 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128292031","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

Light: replay via tightly bounded recording 光:通过紧密受限的记录重放

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2738001

Peng Liu, X. Zhang, Omer Tripp, Yunhui Zheng

{"title":"Light: replay via tightly bounded recording","authors":"Peng Liu, X. Zhang, Omer Tripp, Yunhui Zheng","doi":"10.1145/2737924.2738001","DOIUrl":"https://doi.org/10.1145/2737924.2738001","url":null,"abstract":"Reproducing concurrency bugs is a prominent challenge. Existing techniques either rely on recording very fine grained execution information and hence have high runtime overhead, or strive to log as little information as possible but provide no guarantee in reproducing a bug. We present Light, a technique that features much lower overhead compared to techniques based on fine grained recording, and that guarantees to reproduce concurrent bugs. We leverage and formally prove that recording flow dependences is the necessary and sufficient condition to reproduce a concurrent bug. The flow dependences, together with the thread local orders that can be automatically inferred (and hence not logged), are encoded as scheduling constraints. An SMT solver is used to derive a replay schedule, which is guaranteed to exist even though it may be different from the original schedule. Our experiments show that Light has only 44% logging overhead, almost one order of magnitude lower than the state of the art techniques relying on logging memory accesses. Its space overhead is only 10% of those techniques. Light can also reproduce all the bugs we have collected whereas existing techniques miss some of them.","PeriodicalId":104101,"journal":{"name":"Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134211720","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

Composing concurrency control 组合并发控制

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737970

Ofri Ziv, Alex Aiken, Guy Golan-Gueta, Ganesan Ramalingam, M. Sagiv

引用次数: 12

Termination and non-termination specification inference 终止和非终止规范推断

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737993

T. Le, S. Qin, W. Chin

引用次数: 43

Dynamic partial order reduction for relaxed memory models 放松记忆模型的动态偏序约简

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737956

Naling Zhang, Markus Kusano, Chao Wang

引用次数: 75

Automatic error elimination by horizontal code transfer across multiple applications 通过跨多个应用程序的水平代码传输自动消除错误

Proceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation Pub Date : 2015-06-03 DOI: 10.1145/2737924.2737988

Stelios Sidiroglou, Eric Lahtinen, Fan Long, M. Rinard

引用次数: 123