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

10th acm sigplan Symposium on Haskell (Haskell) co-located with ICFP conference

作者： Aronsson, Markus Sheeran, Mary Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9781450351829

We present a library in Haskell for programming Field Programmable Gate Arrays (FPGAs), including hardware software co-design. Code for software (in C) and hardware (in VHDL) is generated from a single program, along with the code to support communication between hardware and software. We present type-based techniques for the simultaneous implementation of more than one embedded domain specific language (EDSL). We build upon a generic representation of imperative programs that is loosely coupled to instruction and expression types, allowing the individual parts to be developed and improved separately. Code generation is implemented as a series of translations between progressively smaller, typed EDSLs, safeguarding against errors that arise in untyped translations. Initial case studies show promising performance.

关键词： hardware software co-design domain specific language

来源：评论

学校读者我要写书评

暂无评论

Component-Based Synthesis of Table Consolidation and Transformation Tasks from Examples 2017

Component-Based Synthesis of Table Consolidation and Transfo...

引用

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

作者： Feng, Yu Martins, Ruben Van Geffen, Jacob Dillig, Isil Chaudhuri, Swarat Univ Texas Austin Austin TX 78712 USA Rice Univ Houston TX 77251 USA

ISBN: (纸本)9781450349888

This paper presents a novel component-based synthesis algorithm that marries the power of type-directed search with lightweight SMT-based deduction and partial evaluation. Given a set of components together with their over-approximate first-order specifications, our method first generates a program sketch over a subset of the components and checks its feasibility using an SMT solver. Since a program sketch typically represents many concrete programs, the use of SMT-based deduction greatly increases the scalability of the algorithm. Once a feasible program sketch is found, our algorithm completes the sketch in a bottom-up fashion, using partial evaluation to further increase the power of deduction for rejecting partially-filled program sketches. We apply the proposed synthesis methodology for automating a large class of data preparation tasks that commonly arise in data science. We have evaluated our synthesis algorithm on dozens of data wrangling and consolidation tasks obtained from on-line forums, and we show that our approach can automatically solve a large class of problems encountered by R users.

关键词： Program synthesis programming by example data preparation Component-based synthesis SMT-based deduction

来源：评论

学校读者我要写书评

暂无评论

Programmable Semantic Fragments The design and implementation of typy 2016

Programmable Semantic Fragments The Design and Implementatio...

引用

15th acm International conference on Generative programming - Concepts and Experiences (GPCE)

作者： Omar, Cyrus Aldrich, Jonathan Carnegie Mellon Univ Pittsburgh PA 15213 USA

ISBN: (纸本)9781450344463

This paper introduces typy, a statically typed programming language embedded by reflection into Python. typy features a fragmentary semantics, i.e. it delegates semantic control over each term, drawn from Python's fixed concrete and abstract syntax, to some contextually relevant user-defined semantic fragment. The delegated fragment programmatically 1) typechecks the term (following a bidirectional protocol);and 2) assigns dynamic meaning to the term by computing a translation to Python. We argue that this design is expressive with examples of fragments that express the static and dynamic semantics of 1) functional records;2) labeled sums (with nested pattern matching a la ML);3) a variation on JavaScript's prototypal object system;and 4) typed foreign interfaces to Python and OpenCL. These semantic structures are, or would need to be, defined primitively in conventionally structured languages. We further argue that this design is compositionally well-behaved. It avoids the expression problem and the problems of grammar composition because the syntax is fixed. Moreover, programs are semantically stable under fragment composition (i.e. defining a new fragment will not change the meaning of existing program components.)

关键词： metaprogramming bidirectional typechecking pattern matching foreign function interfaces

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

RaTrace: Simple and Efficient Abstractions for BVH Ray Traversal Algorithms 2017

RaTrace: Simple and Efficient Abstractions for BVH Ray Trave...

引用

16th acm sigplan International conference on Generative programming - Concepts and Experiences (GPCE) co-located with SPLASH conference

作者： Perard-Gayot, Arsene Weier, Martin Membarth, Richard Slusallek, Philipp Leissa, Roland Hack, Sebastian Saarland Univ Comp Graph Lab Saarbrucken Germany Bonn Rhein Sieg Univ Inst Visual Comp St Augustin Germany DFKI Agents & Simulated Real Saarbrucken Germany Saarland Univ Compiler Design Lab Saarbrucken Germany

ISBN: (纸本)9781450355247

In order to achieve the highest possible performance, the ray traversal and intersection routines at the core of every high-performance ray tracer are usually hand-coded, heavily optimized, and implemented separately for each hardware platform-even though they share most of their algorithmic core. The results are implementations that heavily mix algorithmic aspects with hardware and implementation details, making the code non-portable and difficult to change and maintain. In this paper, we present a new approach that offers the ability to define in a functional language a set of conceptual, high-level language abstractions that are optimized away by a special compiler in order to maximize performance. Using this abstraction mechanism we separate a generic ray traversal and intersection algorithm from its low-level aspects that are specific to the target hardware. We demonstrate that our code is not only significantly more flexible, simpler to write, and more concise but also that the compiled results perform as well as state-of-the-art implementations on any of the tested CPU and GPU platforms.

关键词： Computer Graphics Ray Tracing Functional programming Domain-Specific languages

来源：评论

学校读者我要写书评

暂无评论

CIAHelper: Towards Change Impact Analysis in Delta-Oriented Software Product Lines 18

CIAHelper: Towards Change Impact Analysis in Delta-Oriented ...

引用

22nd International Systems and Software Product Line conference (SPLC)

作者： Hamza, Mostafa Walker, Robert J. Elaasar, Maged Univ Calgary Dept Comp Sci Calgary AB Canada Carleton Univ Dept Syst & Comp Engn Ottawa ON Canada

ISBN: (纸本)9781450364645

Change is inevitable for software systems to deal with the evolving environment surrounding them, and applying changes requires careful design and implementation not to break existing functionalities. Evolution in software product lines (SPLs) is more complex compared to evolution for individual products: a change applied to a single feature might affect all the products in the whole product family. In this paper we present an approach for change impact analysis in delta-oriented programming (DOP), an existing language aimed at supporting SPLs. We propose the CIAHelper tool to identify dependencies within a DOP program, by analyzing the semantics of both the code artifacts and variability models to construct a directed dependency graph. We also consider how the source code history could be used to enhance the recall of detecting the affected artifacts given a change proposal. We evaluate our approach by means of five case studies on two different DOP SPLs.

关键词： Change impact analysis feature model variability model code assets delta-oriented programming

来源：评论

学校读者我要写书评

暂无评论

Behind Every Great Deep Learning Framework Is an Even Greater programming languages Concept (Keynote) 2018

Behind Every Great Deep Learning Framework Is an Even Greate...

引用

26th acm Joint Meeting on European Software Engineering conference (ESEC) / Symposium on the Foundations of Software Engineering (FSE)

作者： Meijer, Erik Delft Univ Technol Software Engn Res Grp Cloud Programming Delft Netherlands Facebook Infra Struct Org Menlo Pk CA 94025 USA

ISBN: (纸本)9781450355735

In many areas, such as image recognition, natural language processing, search, recommendation, autonomous cars, systems software and infrastructure, and even Software Engineering tools themselves, Software 2.0 (= programming using learned models) is quickly swallowing Software 1.0 (= programming using handcrafted algorithms). Where the Software 1.0 Engineer formally specifies their problem, carefully designs algorithms, composes systems out of subsystems or decomposes complex systems into smaller components, the Software 2.0 Engineer amasses training data and simply feeds it into an ML algorithm that will synthesize an approximation of the function whose partial extensional definition is that training data. Instead of code as the artifact of interest, in Software 2.0 it is all about the data where compilation of source code is replaced by training models with data. This new style of programming has far-reaching consequences for traditional software engineering practices. Everything we have learned about life cycle models, project planning and estimation, requirements analysis, program design, construction, debugging, testing, maintenance and implementation, ... runs the danger of becoming obsolete. One way to try to prepare for the new realities of software engineering is not to zero in on the differences between Software 1.0 and Software 2.0 but instead focus on their similarities. If you carefully look at what a neural net actually represents, you realize that in essence it is a pure function, from multi-dimensional arrays of floating point numbers to multi-dimensional arrays of floating point numbers (tensors). What is special about these functions is that they are differentiable (yes, exactly as you remember from middle school calculus), which allows them to be trained using back propagation. The programming language community has also discovered that there is a deep connection between back propagation and continuations. Moreover, when you look closely at how So

关键词： Machine Learning programming languages Functional programming Automatic Differentiation Differentiable programming Deep Learning Continuation Passing Style

来源：评论

学校读者我要写书评

暂无评论

IOTA: A Calculus for Internet of Things Automation

IOTA: A Calculus for Internet of Things Automation

引用

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

作者： Newcomb, Julie L. Chandra, Satish Jeannin, Jean-Baptiste Schlesinger, Cole Sridharan, Manu Univ Washington Paul G Allen Sch Comp Sci & Engn Seattle WA 98195 USA Samsung Res Amer Mountain View CA USA Facebook Menlo Pk CA USA Univ Michigan Ann Arbor MI 48109 USA Barefoot Networks Santa Clara CA USA Uber San Francisco CA USA

ISBN: (纸本)9781450355308

Programmatically controllable home devices are proliferating, ranging from lights, locks, and motion sensors to smart refrigerators, televisions, and cameras, giving end users unprecedented control over their environment. New domain-specific languages are emerging to supplant general purpose programming platforms as a means for end users to configure home automation. These languages, based on event-condition-action (ECA) rules, have an appealing simplicity. But programmatic control allows users write to programs with bugs, introducing the frustrations of software engineering with none of the tool support. The subtle semantics of the home automation domain-as well as the varying interfaces and implementation strategies that existing home automation platforms use-exacerbates the problem. In this work, we present the Internet of Things Automation (IOTA) calculus, the first calculus for the domain of home automation. Iota models an ECA language equipped with first-class notions of time, state, and device aggregation, and comes equipped with a precise semantics inspired by a careful analysis of five existing home automation platforms. We show that the IOTA calculus is useful by implementing two analyses from the software engineering literature, and expressive by encoding sixteen programs from these home automation platforms. Along the way, we highlight how the design of the IOTA semantics rules out subtle classes of bugs.

关键词： domain-specific languages language design and implementation

来源：评论

学校读者我要写书评

暂无评论

Super 8 languages for Making Movies (Functional Pearl)

引用

proceedings OF THE acm ON programming languageS-PacmPL 2017年第ICFP期1卷 1-29页

作者： Andersen, Leif Chang, Stephen Felleisen, Matthias Northeastern Univ PLT Boston MA 02115 USA

The Racket doctrine tells developers to create languages (as libraries) to narrow the gap between the terminology of a problem domain and general programming constructs. This pearl illustrates this doctrine with the creation of a relatively simple domain-specific language for editing videos. To produce the video proceedings of a conference, for example, video professionals traditionally use "non-linear" GUI editors to manually edit each talk, despite the repetitive nature of the process. As it turns out, the task of video editing naturally splits into a declarative phase and an imperative rendering phase at the end. Hence it is natural to create a functional-declarative language for the first phase, which reduces a lot of manual labor. The implementation of this user-facing DSL, dubbed Video, utilizes a second, internal DSL to implement the second phase, which is an interface to a general, low-level C library. Finally, we inject type checking into our Video language via another DSL that supports programming in the language of type formalisms. In short, the development of the video editing language cleanly demonstrates how the Racket doctrine naturally leads to the creation of language hierarchies, analogous to the hierarchies of modules found in conventional functional languages.

关键词： Domain-Specific language Declarative languages Video Editing Syntax Elaboration language Oriented design Movies Integrated Development Environment

来源：评论

学校读者我要写书评

暂无评论

CHERI JNI: Sinking the Java Security Model into the C 17

CHERI JNI: Sinking the Java Security Model into the C

引用

22nd acm International conference on Architectural Support for programming languages and Operating Systems (ASPLOS)

作者： Chisnall, David Davis, Brooks Gudka, Khilan Brazdil, David Joannou, Alexandre Woodruff, Jonathan Markettos, A. Theodore Maste, J. Edward Norton, Robert Son, Stacey Roe, Michael Moore, Simon W. Neumann, Peter G. Laurie, Ben Watson, Robert N. M. Univ Cambridge Cambridge England SRI Int Menlo Pk CA USA DeepMind Technol Ltd London England

ISBN: (纸本)9781450344654

Java provides security and robustness by building a high-level security model atop the foundation of memory protection. Unfortunately, any native code linked into a Java program - including the million lines used to implement the standard library - is able to bypass both the memory protection and the higher-level policies. We present a hardware-assisted implementation of the Java native code interface, which extends the guarantees required for Java's security model to native code. Our design supports safe direct access to buffers owned by the JVM, including hardware-enforced read-only access where appropriate. We also present Java language syntax to declaratively describe isolated compartments for native code. We show that it is possible to preserve the memory safety and isolation requirements of the Java security model in C code, allowing native code to run in the same process as Java code with the same impact on security as running equivalent Java code. Our approach has a negligible impact on performance, compared with the existing unsafe native code interface. We demonstrate a prototype implementation running on the CHERI microprocessor synthesized in FPGA.

关键词： cheri language security hardware security compartmentalization architecture memory protection java compilers capability systems sandboxing jni

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：