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

13th acm sigplan International conference on Software language Engineering (SLE) part of SPLASH conference

作者： Racordon, Dimitri Buchs, Didier Univ Geneva Dept Comp Sci Geneva Switzerland

ISBN: (纸本)9781450381765

Swift is a modern general-purpose programming language, designed to be a replacement for C-based languages. Although primarily directed at development of applications for Apple's operating systems, Swift's adoption has been growing steadily in other domains, ranging from server-side services to machine learning. This success can be partly attributed to a rich type system that enables the design of safe, fast, and expressive programming interfaces. Unfortunately, this richness comes at the cost of complexity, setting a high entry barrier to exploit Swift's full potential. Furthermore, existing documentation typically only relies on examples, leaving new users with little help to build a deeper understanding of the underlying rules and mechanisms. This paper aims to tackle this issue by laying out the foundations for a formal framework to reason about Swift's type system. We introduce Featherweight Swift, a minimal language stripped of all features not essential to describe its typing rules. Featherweight Swift features classes and protocol inheritance, supports retroactive modeling, and emulates Swift's overriding mechanisms. Yet its formalization fits on a few pages. We present Featherweight Swift's syntax and semantics. We then elaborate on the usability of our framework to reason about Swift's features, future extensions, and implementation by discussing a bug in Swift's compiler, discovered throughout the design of our calculus.

关键词： protocol oriented programming language semantics language calculus type systems swift

来源：评论

学校读者我要写书评

暂无评论

On the Principles of Differentiable Quantum programming languages 2020

On the Principles of Differentiable Quantum Programming Lang...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Zhu, Shaopeng Hung, Shih-Han Chakrabarti, Shouvanik Wu, Xiaodi Univ Maryland College Pk MD 20742 USA

ISBN: (纸本)9781450376136

Variational Quantum Circuits (VQCs), or the so-called quantum neural-networks, are predicted to be one of the most important near-term quantum applications, not only because of their similar promises as classical neural-networks, but also because of their feasibility on near-term noisy intermediate-size quantum (NISQ) machines. The need for gradient information in the training procedure of VQC applications has stimulated the development of auto-differentiation techniques for quantum circuits. We propose the first formalization of this technique, not only in the context of quantum circuits but also for imperative quantum programs (e.g., with controls), inspired by the success of differentiable programming languages in classical machine learning. In particular, we overcome a few unique difficulties caused by exotic quantum features (such as quantum no-cloning) and provide a rigorous formulation of differentiation applied to bounded-loop imperative quantum programs, its code-transformation rules, as well as a sound logic to reason about their correctness. Moreover, we have implemented our code transformation in OCaml and demonstrated the resource-efficiency of our scheme both analytically and empirically. We also conduct a case study of training a VQC instance with controls, which shows the advantage of our scheme over existing auto-differentiation for quantum circuits without controls.

关键词： quantum programming languages differentiable programming languages quantum machine learning

来源：评论

学校读者我要写书评

暂无评论

A Principled Approach to REPL Interpreters

A Principled Approach to REPL Interpreters

引用

acm sigplan International Symposium on New Ideas, New Paradigms, and Reflections on programming and Software (Onward) Part of part of SPLASH conference

作者： van Binsbergen, L. Thomas Merino, Mauricio Verano Jeanjean, Pierre van der Storm, Tijs Combemale, Benoit Barais, Olivier Ctr Wiskunde & Informat Amsterdam Netherlands Eindhoven Univ Technol Eindhoven Netherlands Univ Rennes INRIA CRNS IRISA Rennes France Univ Groningen Groningen Netherlands

ISBN: (纸本)9781450381789

Read-eval-print-loops (REPLs) allow programmers to test out snippets of code, explore APIs, or even incrementally construct code, and get immediate feedback on their actions. However, even though many languages provide a REPL, the relation between the language as is and what is accepted at the REPL prompt is not always well-defined. Furthermore, implementing a REPL for new languages, such as DSLs, may incur significant language engineering cost. In this paper we survey the domain of REPLs and investigate the (formal) principles underlying REPLs. We identify and define the class of sequential languages, which admit a sound REPL implementation based on a definitional interpreter, and present design guidelines for extending existing language implementations to support REPL-style interfaces (including computational notebooks). The obtained REPLs can then be generically turned into an exploring interpreter, to allow exploration of the user's interaction. The approach is illustrated using three case studies, based on MiniJava, QL (a DSL for questionnaires), and eFLINT (a DSL for normative rules). We expect sequential languages, and the consequent design principles, to be stepping stones towards a better understanding of the essence of REPLs.

关键词： interpreters REPLs software language engineering notebooks meta-languages language workbenches

来源：评论

学校读者我要写书评

暂无评论

Variability Modules for Java-like languages 21

Variability Modules for Java-like Languages

引用

25th acm International Systems and Software Product Line conference (SPLC)

作者： Damiani, Ferruccio Haehnle, Reiner Kamburjan, Eduard Lienhardt, Michael Paolini, Luca Univ Turin Dept Comp Sci Turin Italy Tech Univ Darmstadt Dept Comp Sci Darmstadt Germany Univ Oslo Dept Informat Oslo Norway Off Natl Etud & Rech Aerosp Palaiseau France

ISBN: (纸本)9781450384698

A Software Product Line (SPL) is a family of similar programs (called variants) generated from a common artifact base. A Multi SPL (MPL) is a set of interdependent SPLs (i.e., such that an SPL's variant can depend on variants from other SPLs). MPLs are challenging to model and implement efficiently, especially when different variants of the same SPL must coexist and interoperate. We address this challenge by introducing variability modules (VMs), a new language construct. A VM represents both a module and an SPL of standard (variability-free), possibly interdependent modules. Generating a variant of a VM triggers the generation of all variants required to fulfill its dependencies. Then, a set of interdependent VMs represents an MPL that can be compiled into a set of standard modules. We illustrate VMs by an example from an industrial modeling scenario, formalize them in a core calculus, provide an implementation for the Java-like modeling language ABS, and evaluate VMs by case studies.

关键词： ABS language Delta-oriented programming language design Modules Multi product line Variant generation

来源：评论

学校读者我要写书评

暂无评论

Rustsim: A Process-Oriented Simulation Framework for the Rust language 23

Rustsim: A Process-Oriented Simulation Framework for the Rus...

引用

proceedings of the Winter Simulation conference

作者： Kevin Frez Mauricio Oyarzún Alonso Inostrosa-Psijas Francisco Moreno Gabriel Wainer Facultad de Ingeniería y Arquitectura Universidad Arturo Prat Iquique Chile Escuela de Ingeniería Informática Universidad de Valparaíso Valparaíso Chile Depto. de Matemática y Ciencia de la Computación Universidad de Santiago Santiago Chile Dept. Of Systems and Computer Engineering Carleton University Ottawa Canada

ISBN: (纸本)9798350369663

We present RustSim, a library for discrete-event process-oriented simulations designed and implemented in the Rust programming language. It includes a broad set of classes to allow the user to implement simulation processes and process-oriented primitives. The flexible modular design of RustSim allows users to extend its functionality. In addition, RustSim includes mechanisms to avoid inconsistencies when applying state-changing primitives that other libraries in the language's ecosystem do not provide. We take advantage of Rust generators (coroutine equivalents) to implement process-oriented simulation primitives. Finally, the library's internal process handling structure is discussed in detail, including its implementation, how simulations are executed, and a case study with a highly detailed example of its use.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EVA: An Encrypted Vector Arithmetic language and Compiler for Efficient Homomorphic Computation 2020

EVA: An Encrypted Vector Arithmetic Language and Compiler fo...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Dathathri, Roshan Kostova, Blagovesta Saarikivi, Olli Dai, Wei Laine, Kim Musuvathi, Madan Univ Texas Austin Austin TX 78712 USA Ecole Polytech Fed Lausanne Lausanne Switzerland Microsoft Res Redmond WA USA

ISBN: (纸本)9781450376136

Fully-Homomorphic Encryption (FHE) offers powerful capabilities by enabling secure offloading of both storage and computation, and recent innovations in schemes and implementations have made it all the more attractive. At the same time, FHE is notoriously hard to use with a very constrained programming model, a very unusual performance profile, and many cryptographic constraints. Existing compilers for FHE either target simpler but less efficient FHE schemes or only support specific domains where they can rely on expert-provided high-level runtimes to hide complications. This paper presents a new FHE language called Encrypted Vector Arithmetic (EVA), which includes an optimizing compiler that generates correct and secure FHE programs, while hiding all the complexities of the target FHE scheme. Bolstered by our optimizing compiler, programmers can develop efficient general-purpose FHE applications directly in EVA. For example, we have developed image processing applications using EVA, with a very few lines of code. EVA is designed to also work as an intermediate representation that can be a target for compiling higher-level domain-specific languages. To demonstrate this, we have re-targeted CHET, an existing domain-specific compiler for neural network inference, onto EVA. Due to the novel optimizations in EVA, its programs are on average 5.3x faster than those generated by CHET. We believe that EVA would enable a wider adoption of FHE by making it easier to develop FHE applications and domain-specific FHE compilers.

关键词： Homomorphic encryption compiler neural networks privacy-preserving machine learning

来源：评论

学校读者我要写书评

暂无评论

Towards Assessing the Readability of programming Error Messages 21

Towards Assessing the Readability of Programming Error Messa...

引用

23rd Australasian Computing Education conference (ACE)

作者： Becker, Brett A. Denny, Paul Prather, James Pettit, Raymond Nix, Robert Mooney, Catherine Univ Coll Dublin Dublin Ireland Univ Auckland Auckland New Zealand Abilene Christian Univ Abilene TX 79699 USA Univ Virginia Charlottesville VA USA Oklahoma Christian Univ Edmond OK USA

ISBN: (纸本)9781450389761

programming error messages have proven to be notoriously problematic for novices who are learning to program. Although recent efforts have focused on improving message wording, these have been criticized for attempting to improve usability without first understanding and addressing readability. To date, there has been no research dedicated to the readability of programming error messages and how this could be assessed. In this paper we examine human-based assessments of programming error message readability and make two important contributions. First, we conduct an experiment using the top twenty most-frequent error messages in three popular programming languages (Python, Java, and C), revealing that human notions of readability are highly subjective and dependent on both programming experience and language familiarity. Both novices and experts agreed more about which messages are more readable, but disagreed more about which messages are not readable. Second, we leverage the data from this experiment to uncover several key factors that seem to affect message readability: message length, message tone, and use of jargon. We discuss how these factors can help guide future efforts to design a readability metric for programming error messages.

关键词： compiler error messages compiler design and implementation CS1 enhanced error messages HCI novice programmers programming programming error messages readability

来源：评论

学校读者我要写书评

暂无评论

Automatic Generation of Efficient Sparse Tensor Format Conversion Routines 2020

Automatic Generation of Efficient Sparse Tensor Format Conve...

引用

41st acm sigplan conference on programming language design and implementation (PLDI)

作者： Chou, Stephen Kjolstad, Fredrik Amarasinghe, Saman MIT CSAIL Cambridge MA 02139 USA Stanford Univ Stanford CA 94305 USA

ISBN: (纸本)9781450376136

This paper shows how to generate code that efficiently converts sparse tensors between disparate storage formats (data layouts) such as CSR, DIA, ELL, and many others. We decompose sparse tensor conversion into three logical phases: coordinate remapping, analysis, and assembly. We then develop a language that precisely describes how different formats group together and order a tensor's nonzeros in memory. This lets a compiler emit code that performs complex remappings of nonzeros when converting between formats. We also develop a query language that can extract statistics about sparse tensors, and we show how to emit efficient analysis code that computes such queries. Finally, we define an abstract interface that captures how data structures for storing a tensor can be efficiently assembled given specific statistics about the tensor. Disparate formats can implement this common interface, thus letting a compiler emit optimized sparse tensor conversion code for arbitrary combinations of many formats without hard-coding for any specific combination. Our evaluation shows that the technique generates sparse tensor conversion routines with performance between 1.00 and 2.01x that of hand-optimized versions in SPARSKIT and Intel MKL, two popular sparse linear algebra libraries. And by emitting code that avoids materializing temporaries, which both libraries need for many combinations of source and target formats, our technique outperforms those libraries by 1.78 to 4.01x for CSC/COO to DIA/ELL conversion.

关键词： sparse tensor conversion sparse tensor assembly sparse tensor algebra sparse tensor formats coordinate remapping notation attribute query language

来源：评论

学校读者我要写书评

暂无评论

A History of the Oz Multiparadigm language

引用

proceedings OF THE acm ON programming languageS-PacmPL 2020年第HOPL期4卷 1–56页

作者： Van Roy, Peter Haridi, Seif Schulte, Christian Smolka, Gert Catholic Univ Louvain B-1348 Louvain La Neuve Belgium Royal Inst Technol Stockholm Sweden RISE Stockholm Sweden Saarland Univ Saarbrucken Germany

Oz is a programming language designed to support multiple programming paradigms in a clean factored way that is easy to program despite its broad coverage. It started in 1991 as a collaborative effort by the DFKI (Germany) and SICS (Sweden) and led to an influential system, Mozart, that was released in 1999 and widely used in the 2000s for practical applications and education. We give the history of Oz as it developed from its origins in logic programming, starting with Prolog, followed by concurrent logic programming and constraint logic programming, and leading to its two direct precursors, the concurrent constraint model and the Andorra Kernel language (AKL). We give the lessons learned from the Oz effort including successes and failures and we explain the principles underlying the Oz design. Oz is defined through a kernel language, which is a formal model similar to a foundational calculus, but that is designed to be directly useful to the programmer. The kernel language is organized in a layered structure, which makes it straightforward to write programs that use different paradigms in different parts. Oz is a key enabler for the book Concepts, Techniques, and Models of Computer programming (MIT Press, 2004). Based on the book and the implementation, Oz has been used successfully in university-level programming courses starting from 2001 to the present day.

关键词： Computer programming multiparadigm programming concurrent programming dataflow functional programming logic programming lazy evaluation programming education distributed programming

来源：评论

学校读者我要写书评

暂无评论

BlankIt Library Debloating 41

BlankIt Library Debloating

引用

41st acm sigplan conference on programming language design and implementation, PLDI 2020

作者： Porter, Chris Mururu, Girish Barua, Prithayan Pande, Santosh Georgia Institute of Technology United States

ISBN: (纸本)9781450376136

Modern software systems make extensive use of libraries derived from C and C++. Because of the lack of memory safety in these languages, however, the libraries may suffer from vulnerabilities, which can expose the applications to potential attacks. For example, a very large number of return-oriented programming gadgets exist in glibc that allow stitching together semantically valid but malicious Turing-complete and -incomplete programs. While CVEs get discovered and often patched and remedied, such gadgets serve as building blocks of future undiscovered attacks, opening an ever-growing set of possibilities for generating malicious programs. Thus, significant reduction in the quantity and expressiveness (utility) of such gadgets for libraries is an important problem. In this work, we propose a new approach for handling an application's library functions that focuses on the principle of "getting only what you want." This is a significant departure from the current approaches that focus on "cutting what is unwanted." Our approach focuses on activating/deactivating library functions on demand in order to reduce the dynamically linked code surface, so that the possibilities of constructing malicious programs diminishes substantially. The key idea is to load only the set of library functions that will be used at each library call site within the application at runtime. This approach of demand-driven loading relies on an input-aware oracle that predicts a near-exact set of library functions needed at a given call site during the execution. The predicted functions are loaded just in time and unloaded on return. We present a decision-tree based predictor, which acts as an oracle, and an optimized runtime system, which works directly with library binaries like GNU libc and libstdc++. We show that on average, the proposed scheme cuts the exposed code surface of libraries by 97.2%, reduces ROP gadgets present in linked libraries by 97.9%, achieves a prediction accuracy in most

关键词： C++ (programming language)

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：