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

Fast condensation of the program dependence graph 程序依赖图的快速凝聚

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

Nick P. Johnson, Taewook Oh, A. Zaks, David I. August

引用次数: 12

P: safe asynchronous event-driven programming P:安全的异步事件驱动编程

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

Ankush Desai, Vivek Gupta, Ethan K. Jackson, S. Qadeer, S. Rajamani, D. Zufferey

{"title":"P: safe asynchronous event-driven programming","authors":"Ankush Desai, Vivek Gupta, Ethan K. Jackson, S. Qadeer, S. Rajamani, D. Zufferey","doi":"10.1145/2491956.2462184","DOIUrl":"https://doi.org/10.1145/2491956.2462184","url":null,"abstract":"We describe the design and implementation of P, a domain-specific language to write asynchronous event driven code. P allows the programmer to specify the system as a collection of interacting state machines, which communicate with each other using events. P unifies modeling and programming into one activity for the programmer. Not only can a P program be compiled into executable code, but it can also be tested using model checking techniques. P allows the programmer to specify the environment, used to \"close\" the system during testing, as nondeterministic ghost machines. Ghost machines are erased during compilation to executable code; a type system ensures that the erasure is semantics preserving. The P language is designed so that a P program can be checked for responsiveness---the ability to handle every event in a timely manner. By default, a machine needs to handle every event that arrives in every state. But handling every event in every state is impractical. The language provides a notion of deferred events where the programmer can annotate when she wants to delay processing an event. The default safety checker looks for presence of unhandled events. The language also provides default liveness checks that an event cannot be potentially deferred forever. P was used to implement and verify the core of the USB device driver stack that ships with Microsoft Windows 8. The resulting driver is more reliable and performs better than its prior incarnation (which did not use P); we have more confidence in the robustness of its design due to the language abstractions and verification provided by P.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"11 8 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":"129312700","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}

引用次数: 159

Session details: Keynote address 2 会议详情:主题演讲2

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

M. Hicks

引用次数: 0

Session details: Types 会话详细信息:

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

J. Regehr

引用次数: 0

Static analysis for probabilistic programs: inferring whole program properties from finitely many paths 概率程序的静态分析:从有限多路径推断整个程序的性质

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

S. Sankaranarayanan, Aleksandar Chakarov, Sumit Gulwani

{"title":"Static analysis for probabilistic programs: inferring whole program properties from finitely many paths","authors":"S. Sankaranarayanan, Aleksandar Chakarov, Sumit Gulwani","doi":"10.1145/2491956.2462179","DOIUrl":"https://doi.org/10.1145/2491956.2462179","url":null,"abstract":"We propose an approach for the static analysis of probabilistic programs that sense, manipulate, and control based on uncertain data. Examples include programs used in risk analysis, medical decision making and cyber-physical systems. Correctness properties of such programs take the form of queries that seek the probabilities of assertions over program variables. We present a static analysis approach that provides guaranteed interval bounds on the values (assertion probabilities) of such queries. First, we observe that for probabilistic programs, it is possible to conclude facts about the behavior of the entire program by choosing a finite, adequate set of its paths. We provide strategies for choosing such a set of paths and verifying its adequacy. The queries are evaluated over each path by a combination of symbolic execution and probabilistic volume-bound computations. Each path yields interval bounds that can be summed up with a \"coverage\" bound to yield an interval that encloses the probability of assertion for the program as a whole. We demonstrate promising results on a suite of benchmarks from many different sources including robotic manipulators and medical decision making programs.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"25 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":"122938537","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}

引用次数: 122

TRANSIT: specifying protocols with concolic snippets TRANSIT:指定带有结肠片段的协议

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

A. Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, R. Alur

{"title":"TRANSIT: specifying protocols with concolic snippets","authors":"A. Udupa, Arun Raghavan, Jyotirmoy V. Deshmukh, Sela Mador-Haim, Milo M. K. Martin, R. Alur","doi":"10.1145/2491956.2462174","DOIUrl":"https://doi.org/10.1145/2491956.2462174","url":null,"abstract":"With the maturing of technology for model checking and constraint solving, there is an emerging opportunity to develop programming tools that can transform the way systems are specified. In this paper, we propose a new way to program distributed protocols using concolic snippets. Concolic snippets are sample execution fragments that contain both concrete and symbolic values. The proposed approach allows the programmer to describe the desired system partially using the traditional model of communicating extended finite-state-machines (EFSM), along with high-level invariants and concrete execution fragments. Our synthesis engine completes an EFSM skeleton by inferring guards and updates from the given fragments which is then automatically analyzed using a model checker with respect to the desired invariants. The counterexamples produced by the model checker can then be used by the programmer to add new concrete execution fragments that describe the correct behavior in the specific scenario corresponding to the counterexample. We describe TRANSIT, a language and prototype implementation of the proposed specification methodology for distributed protocols. Experimental evaluations of TRANSIT to specify cache coherence protocols show that (1) the algorithm for expression inference from concolic snippets can synthesize expressions of size 15 involving typical operators over commonly occurring types, (2) for a classical directory-based protocol, TRANSIT automatically generates, in a few seconds, a complete implementation from a specification consisting of the EFSM structure and a few concrete examples for every transition, and (3) a published partial description of the SGI Origin cache coherence protocol maps directly to symbolic examples and leads to a complete implementation in a few iterations, with the programmer correcting counterexamples resulting from underspecified transitions by adding concrete examples in each iteration.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"6 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":"116875022","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}

引用次数: 212

Session details: Monads and FRP 会议细节:单子和玻璃钢

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

Arjun Guha

引用次数: 0

Steal Tree: low-overhead tracing of work stealing schedulers 窃取树:低开销的工作窃取调度器跟踪

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

J. Lifflander, S. Krishnamoorthy, L. Kalé

引用次数: 21

Harmonizing classes, functions, tuples, and type parameters in virgil iii 协调virgil iii中的类、函数、元组和类型参数

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

Ben L. Titzer

{"title":"Harmonizing classes, functions, tuples, and type parameters in virgil iii","authors":"Ben L. Titzer","doi":"10.1145/2491956.2491962","DOIUrl":"https://doi.org/10.1145/2491956.2491962","url":null,"abstract":"Languages are becoming increasingly multi-paradigm. Subtype polymorphism in statically-typed object-oriented languages is being supplemented with parametric polymorphism in the form of generics. Features like first-class functions and lambdas are appearing everywhere. Yet existing languages like Java, C#, C++, D, and Scala seem to accrete ever more complexity when they reach beyond their original paradigm into another; inevitably older features have some rough edges that lead to nonuniformity and pitfalls. Given a fresh start, a new language designer is faced with a daunting array of potential features. Where to start? What is important to get right first, and what can be added later? What features must work together, and what features are orthogonal? We report on our experience with Virgil III, a practical language with a careful balance of classes, functions, tuples and type parameters. Virgil intentionally lacks many advanced features, yet we find its core feature set enables new species of design patterns that bridge multiple paradigms and emulate features not directly supported such as interfaces, abstract data types, ad hoc polymorphism, and variant types. Surprisingly, we find variance for function types and tuple types often replaces the need for other kinds of type variance when libraries are designed in a more functional style.","PeriodicalId":224397,"journal":{"name":"Proceedings of the 34th ACM SIGPLAN Conference on Programming Language Design and Implementation","volume":"1 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":"130143737","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}

引用次数: 2

Session details: Verification 1 会话详细信息:验证

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

Swarat Chaudhuri

引用次数: 0