检索结果-内蒙古大学图书馆

34th acm sigplan conference on programming language design and implementation (PLDI)

作者： Desai, Ankush Gupta, Vivek Jackson, Ethan Qadeer, Shaz Rajamani, Sriram Zufferey, Damien Microsoft Corp Redmond WA 98052 USA

ISBN: (纸本)9781450320146

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.

关键词： domain-specific language device driver event-driven programming state machine verification systematic testing

来源：评论

学校读者我要写书评

暂无评论

Characterising Renaming within OCaml's Module System: theory and implementation 2019

Characterising Renaming within OCaml's Module System: Theory...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Rowe, Reuben N. S. Feree, Hugo thompson, Simon J. Owens, Scott Univ Kent Sch Comp Canterbury Kent England

ISBN: (纸本)9781450367127

We present an abstract, set-theoretic denotational semantics for a significant subset of OCaml and its module system, allowing to reason about the correctness of renaming value bindings. Our semantics captures information about the binding structure of programs, as well as about which declarations are related by the use of different language constructs (e.g. functors, module types and module constraints). Correct renamings are precisely those that preserve this structure. We show that our abstract semantics is sound with respect to a (domain-theoretic) denotational model of the operational behaviour of programs, and that it allows us to prove various high-level, intuitive properties of renamings. this formal framework has been implemented in a prototype refactoring tool for OCaml that performs renaming.

关键词： Adequacy dependencies modules module types OCaml refactoring renaming semantics

来源：评论

学校读者我要写书评

暂无评论

Renaissance: Benchmarking Suite for Parallel Applications on the JVM 2019

Renaissance: Benchmarking Suite for Parallel Applications on...

引用

40th acm sigplan conference on programming language design and implementation (PLDI) part of acm's Federated Computing Research conference (FCRC)

作者： Prokopec, Aleksandar Rosa, Andrea Leopoldseder, David Duboscq, Gilles Tuma, Petr Studener, Martin Bulej, Lubomir Zheng, Yudi Villazon, Alex Simon, Doug Wurthinger, thomas Binder, Walter Oracle Labs Zurich Switzerland Univ Svizzera Italiana Lugano Switzerland Johannes Kepler Univ Linz Linz Austria Charles Univ Prague Prague Czech Republic Univ Privada Boliviana Colcapirhua Bolivia

ISBN: (纸本)9781450367127

Established benchmark suites for the Java Virtual Machine (JVM), such as DaCapo, ScalaBench, and SPECjvm2008, lack workloads that take advantage of the parallel programming abstractions and concurrency primitives offered by the JVM and the Java Class Library. However, such workloads are fundamental for understanding the way in which modern applications and data-processing frameworks use the JVM's concurrency features, and for validating new just-in-time (JIT) compiler optimizations that enable more efficient execution of such workloads. We present Renaissance, a new benchmark suite composed of modern, real-world, concurrent, and object-oriented workloads that exercise various concurrency primitives of the JVM. We show that the use of concurrency primitives in these workloads reveals optimization opportunities that were not visible with the existing workloads. We use Renaissance to compare performance of two state-of-the-art, production-quality JIT compilers (HotSpot C2 and Graal), and show that the performance differences are more significant than on existing suites such as DaCapo and SPECjvm2008. We also use Renaissance to expose four new compiler optimizations, and we analyze the behavior of several existing ones. Evaluating these optimizations using four benchmark suites shows a more prominent impact on the Renaissance workloads than on those of other suites.

关键词： benchmarks JIT compilation parallelism concurrency JVM object-oriented programming benchmarks functional programming benchmarks Big Data benchmarks

来源：评论

学校读者我要写书评

暂无评论

Search, Align, and Repair: Data-Driven Feedback Generation for Introductory programming Exercises 2018

Search, Align, and Repair: Data-Driven Feedback Generation f...

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Wang, Ke Singh, Rishabh Su, Zhendong Univ Calif Davis Davis CA 95616 USA Microsoft Res Redmond WA USA

ISBN: (纸本)9781450356985

this paper introduces the "Search, Align, and Repair" data-driven program repair framework to automate feedback generation for introductory programming exercises. Distinct from existing techniques, our goal is to develop an efficient, fully automated, and problem-agnostic technique for large or MOOC-scale introductory programming courses. We leverage the large amount of available student submissions in such settings and develop new algorithms for identifying similar programs, aligning correct and incorrect programs, and repairing incorrect programs by finding minimal fixes. We have implemented our technique in the SARFGEN system and evaluated it on thousands of real student attempts from the Microsoft-DEV204.1x edX course and the Microsoft Code-Hunt platform. Our results show that SARFGEN can, within two seconds on average, generate concise, useful feedback for 89.7% of the incorrect student submissions. It has been integrated with the Microsoft-DEV204.1X edX class and deployed for production use.

关键词： Automatic Grading Computer-Aided Education Program Analysis

来源：评论

学校读者我要写书评

暂无评论

Software meta-language engineering and CBS

引用

JOURNAL OF COMPUTER languageS 2019年 50卷 39-48页

作者： Mosses, Peter D. Swansea Univ Dept Comp Sci Computat Foundry Bay Campus Swansea SA1 8EN W Glam Wales Delft Univ Technol Programming Languages EEMCS POB 5031 NL-2600 GA Delft Netherlands

the SLE conference series is devoted to the engineering principles of software languages: their design, their implementation, and their evolution. this paper is about the role of language specification in SLE. A precise specification of a software language needs to be written in a formal meta-language, and it needs to co-evolve with the specified language. Moreover, different software languages often have features in common, which should provide opportunities for reuse of parts of language specifications. Support for co-evolution and reuse in a meta-language requires careful engineering of its design. the author has been involved in the development of several meta-languages for semantic specification, including action semantics and modular variants of structural operational semantics (MSOS, I-MSOS). this led to the PLanCompS project, and to the design of its meta-language, CBS, for component-based semantics. CBS comes together with an extensible library of reusable components called 'funcons', corresponding to fundamental programming constructs. the main aim of CBS is to optimise co-evolution and reuse of specifications during language development, and to make specification of language semantics almost as straightforward as context-free syntax specification. the paper discusses the engineering of a selection of previous meta-languages, assessing how well they support co-evolution and reuse. It then gives an introduction to CBS, and illustrates significant features. It also considers whether other current meta-languages might also be used to define an extensible library of funcons for use in component-based semantics.

关键词： Semantics of programming languages Meta-languages Modularity

来源：评论

学校读者我要写书评

暂无评论

VESTA: Power Modeling with language Runtime Events

引用

PROCEEDINGS OF thE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 621-646页

作者： Raskind, Joseph Babakol, Timur Mahmoud, Khaled Liu, Yu David SUNY Binghamton Binghamton NY 13902 USA

Power modeling is an essential building block for computer systems in support of energy optimization, energy profiling, and energy-aware application development. We introduce VESTA, a novel approach to modeling the power consumption of applications with one key insight: language runtime events are often correlated with a sustained level of power consumption. When compared with the established approach of power modeling based on hardware performance counters (HPCs), VESTA has the benefit of solely requiring application-scoped information and enabling a higher level of explainability, while achieving comparable or even higher precision. through experiments performed on 37 real-world applications on the Java Virtual Machine (JVM), we find the power model built by VESTA is capable of predicting energy consumption with a mean absolute percentage error of 1.56%, while the monitoring of language runtime events incurs small performance and energy overhead.

关键词： power modeling language runtimes Java virtual machines BPF

来源：评论

学校读者我要写书评

暂无评论

Frenetic: A Network programming language 11

Frenetic: A Network Programming Language

引用

16th acm sigplan International conference on Functional programming (ICFP 11)

作者： Foster, Nate Harrison, Rob Freedman, Michael J. Monsanto, Christopher Rexford, Jennifer Story, Alec Walker, David Cornell Univ Ithaca NY 14853 USA Princeton Univ Princeton NJ 08544 USA

ISBN: (纸本)9781450308656

Modern networks provide a variety of interrelated services including routing, traffic monitoring, load balancing, and access control. Unfortunately, the languages used to program today's networks lack modern features-they are usually defined at the low level of abstraction supplied by the underlying hardware and they fail to provide even rudimentary support for modular programming. As a result, network programs tend to be complicated, error-prone, and difficult to maintain. this paper presents Frenetic, a high-level language for programming distributed collections of network switches. Frenetic provides a declarative query language for classifying and aggregating network traffic as well as a functional reactive combinator library for describing high-level packet-forwarding policies. Unlike prior work in this domain, these constructs are-by design-fully compositional, which facilitates modular reasoning and enables code reuse. this important property is enabled by Frenetic's novel run-time system which manages all of the details related to installing, uninstalling, and querying low-level packet-processing rules on physical switches. Overall, this paper makes three main contributions: (1) We analyze the state-of-the art in languages for programming networks and identify the key limitations;(2) We present a language design that addresses these limitations, using a series of examples to motivate and validate our choices;(3) We describe an implementation of the language and evaluate its performance on several benchmarks.

关键词： languages design Network programming languages domain-specific languages functional reactive programming OpenFlow

来源：评论

学校读者我要写书评

暂无评论

Achieving High Coverage for Floating-Point Code via Unconstrained programming 2017

Achieving High Coverage for Floating-Point Code via Unconstr...

引用

38th acm sigplan conference on programming language design and implementation (PLDI)

作者： Fu, Zhoulai Su, Zhendong Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781450349888

Achieving high code coverage is essential in testing, which gives us confidence in code quality. Testing floating-point code usually requires painstaking efforts in handling floating-point constraints, e.g., in symbolic execution. this paper turns the challenge of testing floating-point code into the opportunity of applying unconstrained programming-the mathematical solution for calculating function minimum points over the entire search space. Our core insight is to derive a representing function from the floating-point program, any of whose minimum points is a test input guaranteed to exercise a new branch of the tested program. this guarantee allows us to achieve high coverage of the floating-point program by repeatedly minimizing the representing function. We have realized this approach in a tool called CoverMe and conducted an extensive evaluation of it on Sun's C math library. Our evaluation results show that CoverMe achieves, on average, 90.8% branch coverage in 6.9 seconds, drastically outperforming our compared tools: (1) Random testing, (2) AFL, a highly optimized, robust fuzzer released by Google, and (3) Austin, a state-of-the-art coverage-based testing tool designed to support floating-point code.

关键词： Unconstrained programming Representing Function CoverMe

来源：评论

学校读者我要写书评

暂无评论

Probabilistic programming with Programmable Inference 2018

Probabilistic Programming with Programmable Inference

引用

39th acm sigplan conference on programming language design and implementation (PLDI)

作者： Mansinghka, Vikash K. Schaechtle, Ulrich Handa, Shivam Radul, Alexey Chen, Yutian Rinard, Martin MIT Cambridge MA 02139 USA Google DeepMind London England

ISBN: (纸本)9781450356985

We introduce inference metaprogramming for probabilistic programming languages, including new language constructs, a formalism, and the first demonstration of effectiveness in practice. Instead of relying on rigid black-box inference algorithms hard-coded into the language implementation as in previous probabilistic programming languages, inference metaprogramming enables developers to 1) dynamically decompose inference problems into subproblems, 2) apply inference tactics to subproblems, 3) alternate between incorporating new data and performing inference over existing data, and 4) explore multiple execution traces of the probabilistic program at once. Implemented tactics include gradient-based optimization, Markov chain Monte Carlo, variational inference, and sequental Monte Carlo techniques. Inference metaprogramming enables the concise expression of probabilistic models and inference algorithms across diverse fields, such as computer vision, data science, and robotics, within a single probabilistic programming language.

关键词： Probabilistic programming Semantics Inference

来源：评论

学校读者我要写书评

暂无评论

First-class Runtime Generation of High-performance Types using Exotypes 14

First-class Runtime Generation of High-performance Types usi...

引用

35th acm sigplan conference on programming language design and implementation (PLDI)

作者： DeVito, Zachary Ritchie, Daniel Fisher, Matt Aiken, Alex Hanrahan, Pat Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450327848

We introduce exotypes, user-defined types that combine the flexibility of meta-object protocols in dynamically-typed languages with the performance control of low-level languages. Like objects in dynamic languages, exotypes are defined programmatically at runtime, allowing behavior based on external data such as a database schema. To achieve high performance, we use staged programming to define the behavior of an exotype during a runtime compilation step and implement exotypes in Terra, a low-level staged programming language. We show how exotype constructors compose, and use exotypes to implement high-performance libraries for serialization, dynamic assembly, automatic differentiation, and probabilistic programming. Each exotype achieves expressiveness similar to libraries written in dynamically-typed languages but implements optimizations that exceed the performance of existing libraries written in low-level statically-typed languages. though each implementation is significantly shorter, our serialization library is 11 times faster than Kryo, and our dynamic assembler is 3-20 times faster than Google's Chrome assembler.

关键词： design Performance Lua Staged computation DSL

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：