Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages最新文献

Fast polyhedra abstract domain 快速多面体抽象域

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009885

Gagandeep Singh, Markus Püschel, Martin T. Vechev

{"title":"Fast polyhedra abstract domain","authors":"Gagandeep Singh, Markus Püschel, Martin T. Vechev","doi":"10.1145/3009837.3009885","DOIUrl":"https://doi.org/10.1145/3009837.3009885","url":null,"abstract":"Numerical abstract domains are an important ingredient of modern static analyzers used for verifying critical program properties (e.g., absence of buffer overflow or memory safety). Among the many numerical domains introduced over the years, Polyhedra is the most expressive one, but also the most expensive: it has worst-case exponential space and time complexity. As a consequence, static analysis with the Polyhedra domain is thought to be impractical when applied to large scale, real world programs. In this paper, we present a new approach and a complete implementation for speeding up Polyhedra domain analysis. Our approach does not lose precision, and for many practical cases, is orders of magnitude faster than state-of-the-art solutions. The key insight underlying our work is that polyhedra arising during analysis can usually be kept decomposed, thus considerably reducing the overall complexity. We first present the theory underlying our approach, which identifies the interaction between partitions of variables and domain operators. Based on the theory we develop new algorithms for these operators that work with decomposed polyhedra. We implemented these algorithms using the same interface as existing libraries, thus enabling static analyzers to use our implementation with little effort. In our evaluation, we analyze large benchmarks from the popular software verification competition, including Linux device drivers with over 50K lines of code. Our experimental results demonstrate massive gains in both space and time: we show end-to-end speedups of two to five orders of magnitude compared to state-of-the-art Polyhedra implementations as well as significant memory gains, on all larger benchmarks. In fact, in many cases our analysis terminates in seconds where prior code runs out of memory or times out after 4 hours. We believe this work is an important step in making the Polyhedra abstract domain both feasible and practically usable for handling large, real-world programs.","PeriodicalId":20657,"journal":{"name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","volume":"32 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81398703","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}

引用次数: 90

Monadic second-order logic on finite sequences 有限序列上的一元二阶逻辑

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009844

Loris D'antoni, Margus Veanes

{"title":"Monadic second-order logic on finite sequences","authors":"Loris D'antoni, Margus Veanes","doi":"10.1145/3009837.3009844","DOIUrl":"https://doi.org/10.1145/3009837.3009844","url":null,"abstract":"We extend the weak monadic second-order logic of one successor on finite strings (M2L-STR) to symbolic alphabets by allowing character predicates to range over decidable quantifier free theories instead of finite alphabets. We call this logic, which is able to describe sequences over complex and potentially infinite domains, symbolic M2L-STR (S-M2L-STR). We then present a decision procedure for S-M2L-STR based on a reduction to symbolic finite automata, a decidable extension of finite automata that allows transitions to carry predicates and can therefore model symbolic alphabets. The reduction constructs a symbolic automaton over an alphabet consisting of pairs of symbols where the first element of the pair is a symbol in the original formula’s alphabet, while the second element is a bit-vector. To handle this modified alphabet we show that the Cartesian product of two decidable Boolean algebras (e.g., the formula’s one and the bit-vector’s one) also forms a decidable Boolean algebras. To make the decision procedure practical, we propose two efficient representations of the Cartesian product of two Boolean algebras, one based on algebraic decision diagrams and one on a variant of Shannon expansions. Finally, we implement our decision procedure and evaluate it on more than 10,000 formulas. Despite the generality, our implementation has comparable performance with the state-of-the-art M2L-STR solvers.","PeriodicalId":20657,"journal":{"name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","volume":"14 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88979189","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}

引用次数: 9

Semantic-directed clumping of disjunctive abstract states 析取抽象状态的语义导向聚类

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009881

Huisong Li, F. Berenger, B. E. Chang, Xavier Rival

{"title":"Semantic-directed clumping of disjunctive abstract states","authors":"Huisong Li, F. Berenger, B. E. Chang, Xavier Rival","doi":"10.1145/3009837.3009881","DOIUrl":"https://doi.org/10.1145/3009837.3009881","url":null,"abstract":"To infer complex structural invariants, shape analyses rely on expressive families of logical properties. Many such analyses manipulate abstract memory states that consist of separating conjunctions of basic predicates describing atomic blocks or summaries. Moreover, they use finite disjunctions of abstract memory states in order to account for dissimilar shapes. Disjunctions should be kept small for the sake of scalability, though precision often requires to keep additional case splits. In this context, deciding when and how to merge case splits and to replace them with summaries is critical both for the precision and for the efficiency. Existing techniques use sets of syntactic rules, which are tedious to design and prone to failure. In this paper, we design a semantic criterion to clump abstract states based on their silhouette which applies not only to the conservative union of disjuncts, but also to the weakening of separating conjunction of memory predicates into inductive summaries. Our approach allows to define union and widening operators that aim at preserving the case splits that are required for the analysis to succeed. We implement this approach in the MemCAD analyzer, and evaluate it on real-world C codes from existing libraries, including programs dealing with doubly linked lists, red-black trees and AVL-trees.","PeriodicalId":20657,"journal":{"name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","volume":"54 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78422964","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

Intersection type calculi of bounded dimension 有界维的交型演算

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009862

Andrej Dudenhefner, J. Rehof

{"title":"Intersection type calculi of bounded dimension","authors":"Andrej Dudenhefner, J. Rehof","doi":"10.1145/3009837.3009862","DOIUrl":"https://doi.org/10.1145/3009837.3009862","url":null,"abstract":"A notion of dimension in intersection typed λ-calculi is presented. The dimension of a typed λ-term is given by the minimal norm of an elaboration (a proof theoretic decoration) necessary for typing the term at its type, and, intuitively, measures intersection introduction as a resource. Bounded-dimensional intersection type calculi are shown to enjoy subject reduction, since terms can be elaborated in non-increasing norm under β-reduction. We prove that a multiset interpretation (corresponding to a non-idempotent and non-linear interpretation of intersection) of dimensionality corresponds to the number of simultaneous constraints required during search for inhabitants. As a consequence, the inhabitation problem is decidable in bounded multiset dimension, and it is proven to be EXPSPACE-complete. This result is a substantial generalization of inhabitation for the rank 2-fragment, yielding a calculus with decidable inhabitation which is independent of rank. Our results give rise to a new criterion (dimensional bound) for subclasses of intersection type calculi with a decidable inhabitation problem, which is orthogonal to previously known criteria, and which should have immediate applications in synthesis. Additionally, we give examples of dimensional analysis of fragments of the intersection type system, including conservativity over simple types, rank 2-types, and normal form typings, and we provide some observations towards dimensional analysis of other systems. It is suggested (for future work) that our notion of dimension may have semantic interpretations in terms of of reduction complexity.","PeriodicalId":20657,"journal":{"name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","volume":"17 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"75841963","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}

引用次数: 22

Gradual refinement types 逐渐细化类型

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009856

Nico Lehmann, É. Tanter

引用次数: 54

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages 第44届ACM SIGPLAN编程语言原理研讨会论文集

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837

Giuseppe Castagna, A. Gordon

引用次数: 14

QWIRE: a core language for quantum circuits QWIRE:量子电路的核心语言

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009894

Jennifer Paykin, Robert Rand, S. Zdancewic

引用次数: 148

Exact Bayesian inference by symbolic disintegration 符号分解的精确贝叶斯推理

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009852

Chung-chieh Shan, N. Ramsey

引用次数: 40

The influence of dependent types (keynote) 从属类型的影响(主题)

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3093333.3009923

Stephanie Weirich

引用次数: 6

Automatically generating the dynamic semantics of gradually typed languages 自动生成渐进类型语言的动态语义

Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages Pub Date : 2017-01-01 DOI: 10.1145/3009837.3009863

M. Cimini, Jeremy G. Siek

{"title":"Automatically generating the dynamic semantics of gradually typed languages","authors":"M. Cimini, Jeremy G. Siek","doi":"10.1145/3009837.3009863","DOIUrl":"https://doi.org/10.1145/3009837.3009863","url":null,"abstract":"Many language designers have adopted gradual typing. However, there remains open questions regarding how to gradualize languages. Cimini and Siek (2016) created a methodology and algorithm to automatically generate the type system of a gradually typed language from a fully static version of the language. In this paper, we address the next challenge of how to automatically generate the dynamic semantics of gradually typed languages. Such languages typically use an intermediate language with explicit casts. Our first result is a methodology for generating the syntax, type system, and dynamic semantics of the intermediate language with casts. Next, we present an algorithm that formalizes and automates the methodology, given a language definition as input. We show that our approach is general enough to automatically gradualize several languages, including features such as polymorphism, recursive types and exceptions. We prove that our algorithm produces languages that satisfy the key correctness criteria of gradual typing. Finally, we implement the algorithm, generating complete specifications of gradually typed languages in lambda-Prolog, including executable interpreters.","PeriodicalId":20657,"journal":{"name":"Proceedings of the 44th ACM SIGPLAN Symposium on Principles of Programming Languages","volume":"40 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2017-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88603325","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