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

Ziria: A DSL for wireless systems programming 15

Ziria: A DSL for wireless systems programming

proceedings of the Twentieth International conference on Architectural Support for programming languages and Operating Systems

作者： Stewart, Gordon Gowda, Mahanth Mainland, Geoffrey Radunović, Božidar Vytiniotis, Dimitrios Agulló, Cristina Luengo Princeton University United States UIUC United States Drexel University United States MSR Cambridge United States Universitat Politècnica de Catalunya Spain

ISBN: (纸本)9781450328357

Software-defined radio (SDR) brings the flexibility of software to wireless protocol design, promising an ideal platform for innovation and rapid protocol deployment. However, implementing modern wireless protocols on existing SDR platforms often requires careful hand-tuning of low-level code, which can undermine the advantages of software. Ziria is a new domain-specific language (DSL) that offers programming abstractions suitable for wireless physical (PHY) layer tasks while emphasizing the pipeline reconfiguration aspects of PHY programming. The Ziria compiler implements a rich set of specialized optimizations, such as lookup table generation and pipeline fusion. We also offer a novel-due to pipeline reconfiguration-algorithm to optimize the data widths of computations in Ziria pipelines. We demonstrate the programming flexibility of Ziria and the performance of the generated code through a detailed evaluation of a line-rate Ziria WiFi 802.11a/g implementation that is on par and in many cases outperforms a hand-tuned state-of-the-art C++ implementation on commodity CPUs. Copyright © 2015 acm.

关键词： Table lookup

来源：评论

学校读者我要写书评

暂无评论

Co-dfns: Ancient language, modern compiler 1

Co-dfns: Ancient language, modern compiler

引用

1st acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, ARRAY 2014 - Part of PLDI 2014

作者： Hsu, Aaron W. Indiana University United States

ISBN: (纸本)9781450329378

The APL language allows subject matter experts with no computer science experience to create large and complex software implementations of ideas without excessive software engineering and external development costs. The rapid increase in data sizes challenges existing APL systems, which are all interpreters, to scale with the domain expert's problem size. The Co-dfns project, currently in early development stages, focuses on delivering new language innovations and a high-performance compiler for modern APL that enables domain experts to scale their ideas to their data using modern hardware architectures. The Co-dfns language provides concise primitives that allow domain experts to utilize concurrency and explicit task parallelism in their code. The compiler addresses critical performance bottlenecks of the Dyalog APL interpreter, while maintaining strong integration and compatibility with existing APL workflows. Co-dfns will allow domain experts to scale their code more successfully without requiring them to rewrite critical portions of their code in other languages. Early benchmarking efforts indicate that even naive and unoptimized versions of the Co-dfns compiler compete well with Dyalog on code that naturally lends itself to APL.. Copyright © 2014 acm 978-1-4503-2937-8/14/06. 15.00.

关键词： Cost engineering

来源：评论

学校读者我要写书评

暂无评论

ADA: a tool for visualizing the architectural overview of open-source repositories 11

ADA: a tool for visualizing the architectural overview of op...

引用

11th acm sigplan International Workshop on the State Of the Art in Program Analysis, SOAP 2022, co-located with the 43rd acm sigplan International conference on programming language design and implementation, PLDI 2022

作者： Misu, Md Rakib Hossain Janjanin, Aleksandar Saša Bian, Zhiqiang Burlacu, Valentin-Sebastian Anteski, Naum University College London United Kingdom

ISBN: (纸本)9781450392747

Writing highly maintainable and efficient software code is becoming increasingly difficult, especially while following the rapid, agile development process and working in a distributed team. One of the key indicators of that inefficient software design is a high degree of code coupling, which leads to unwanted side-effects during refactoring and acts as a burden during future development. To alleviate these problems, we developed a visualization tool, ADA, that statically analyzes an open-source repository and seeks to address the issue of code coupling by providing developers with a powerful graphic representation. ADA showcases the relationships and the degree of inter-connectivity between the classes. ADA will ultimately guide developers to instantly locate the coupled area and assist them in decoupling it. © 2022 acm.

关键词： Software design

来源：评论

学校读者我要写书评

暂无评论

Verified Extraction from Coq to OCaml

引用

proceedings OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 52-75页

作者： Forster, Yannick Sozeau, Matthieu Tabareau, Nicolas INRIA Gallinette Project Team Nantes France

One of the central claims of fame of the COQ proof assistant is extraction, i.e., the ability to obtain efficient programs in industrial programming languages such as OCAML, Haskell, or Scheme from programs written in COQ's expressive dependent type theory. Extraction is of great practical usefulness, used crucially e.g., in the CompCert project. However, for such executables obtained by extraction, the extraction process is part of the trusted code base (TCB), as are COQ's kernel and the compiler used to compile the extracted code. The extraction process contains intricate semantic transformation of programs that rely on subtle operational features of both the source and target language. Its code has also evolved since the last theoretical exposition in the seminal PhD thesis of Pierre Letouzey. Furthermore, while the exact correctness statements for the execution of extracted code are described clearly in academic literature, the interoperability with unverified code has never been investigated formally, and yet is used in virtually every project relying on extraction. In this paper, we describe the development of a novel extraction pipeline from COQ to OCAML, implemented and verified in COQ itself, with a clear correctness theorem and guarantees for safe interoperability. We build our work on the METACOQ project, which aims at decreasing the TCB of COQ's kernel by re-implementing it in COQ itself and proving it correct w.r.t. a formal specification of COQ's type theory in COQ. Since OCAML does not have a formal specification, we make use of the MALFUNCTION project specifying the semantics of the intermediate language of the OCAML compiler. Our work fills some gaps in the literature and highlights important differences between the operational semantics of COQ programs and their extraction. In particular, we focus on the guarantees that can be provided for interoperability with unverified code, and prove that extracted programs of first-order data type are correct

关键词： Coq verified compilation extraction functional programming

来源：评论

学校读者我要写书评

暂无评论

Array operators using multiple dispatch a design methodology for array implementations in dynamic languages 1

Array operators using multiple dispatch a design methodology...

引用

1st acm sigplan International Workshop on Libraries, languages and Compilers for Array programming, ARRAY 2014 - Part of PLDI 2014

作者： Bezanson, Jeff Chen, Jiahao Karpinski, Stefan Shah, Viral Edelman, Alan MIT Computer Science and Artificial Intelligence Laboratory United States

ISBN: (纸本)9781450329378

Arrays are such a rich and fundamental data type that they tend to be built into a language, either in the compiler or in a large lowlevel library. Defining this functionality at the user level instead provides greater flexibility for application domains not envisioned by the language designer. Only a few languages, such as C++ and Haskell, provide the necessary power to define n-dimensional arrays, but these systems rely on compile-time abstraction, sacrificing some flexibility. In contrast, dynamic languages make it straightforward for the user to define any behavior they might want, but at the possible expense of performance. As part of the Julia language project, we have developed an approach that yields a novel trade-off between flexibility and compiletime analysis. The core abstraction we use is multiple dispatch. We have come to believe that while multiple dispatch has not been especially popular in most kinds of programming, technical computing is its killer application. By expressing key functions such as array indexing using multi-method signatures, a surprising range of behaviors can be obtained, in a way that is both relatively easy to write and amenable to compiler analysis. The compact factoring of concerns provided by these methods makes it easier for userdefined types to behave consistently with types in the standard library.. Copyright © 2014 acm 978-1-4503-2937-8/14/06. 15.00.

关键词： Static analysis

来源：评论

学校读者我要写书评

暂无评论

From Datalog Rules to Efficient Programs with Time and Space Guarantees 03

From Datalog Rules to Efficient Programs with Time and Space...

引用

Fifth acm sigplan conference on Principle and Practice of Declarative programming

作者： Liu, Yanhong A. Stoller, Scott D. Computer Science Department Stt. Univ. New York at Stony Brook Stony Brook NY 11794 United States

ISBN: (纸本)1581137052

This paper describes a method for transforming any given set of Datalog rules into an efficient specialized implementation with guaranteed worst-case time and space complexities, and for computing the complexities from the rules. The running time is optimal in the sense that only useful combinations of facts that lead to all hypotheses of a rule being simultaneously true are considered, and each such combination is considered exactly once. The associated space usage is optimal in that it is the minimum space needed for such consideration modulo scheduling optimizations that may eliminate some summands in the space usage formula. The transformation is based on a general method for algorithm design that exploits fixed-point computation, incremental maintenance of invariants, and combinations of indexed and linked data structures. We apply the method to a number of analysis problems, some with improved algorithm complexities and all with greatly improved algorithm understanding and greatly simplified complexity analysis.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

SPUR: A Trace-Based JIT Compiler for CIL 10

SPUR: A Trace-Based JIT Compiler for CIL

引用

conference on Object Oriented programming Systems, languages and Applications/SPLASH 2010

作者： Bebenita, Michael Brandner, Florian Fahndrich, Manuel Logozzo, Francesco Schulte, Wolfram Tillmann, Nikolai Venter, Herman Microsoft Research Redmond WA USA

ISBN: (纸本)9781450302036

Tracing just-in-time compilers (TJITs) determine frequently executed traces (hot paths and loops) in running programs and focus their optimization effort by emitting optimized machine code specialized to these traces. Prior work has established this strategy to be especially beneficial for dynamic languages such as JavaScript, where the TJIT interfaces with the interpreter and produces machine code from the JavaScript trace. This direct coupling with a JavaScript interpreter makes it difficult to harness the power of a TJIT for other components that are not written in JavaScript, e. g., the DOM implementation or the layout engine inside a browser. Furthermore, if a TJIT is tied to a particular high-level language interpreter, it is difficult to reuse it for other input languages as the optimizations are likely targeted at specific idioms of the source language. To address these issues, we designed and implemented a TJIT for Microsoft's Common Intermediate language CIL (the target language of C#, VisualBasic, F#, and many other languages). Working on CIL enables TJIT optimizations for any program compiled to this platform. In addition, to validate that the performance gains of a TJIT for JavaScript do not depend on specific idioms of JavaScript that are lost in the translation to CIL, we provide a performance evaluation of our JavaScript runtime which translates JavaScript to CIL and then runs on top of our CIL TJIT.

关键词： design languages Performance dynamic compilation tracing just-in-time CIL JavaScript

来源：评论

学校读者我要写书评

暂无评论

language support for connector abstractions 17th

引用

17th European conference on Object-Oriented programming (ECOOP 2003)

作者： Aldrich, J Sazawal, V Chambers, C Notkin, D Univ Washington Dept Comp Sci & Engn Seattle WA 98195 USA

ISBN: (纸本)3540405313

Software connectors are increasingly recognized as an important consideration in the design and implementation of object-oriented software systems. Connectors can be used to communicate across a distributed system, coordinate the activities of several objects, or adapt one object's interface to the interface of another. Mainstream object-oriented languages, however, do not provide explicit support for connectors. As a result, connection code is intermingled with application code, making it difficult to understand, evolve, and reuse connection mechanisms. In this paper, we add language support for user-defined connectors to the ArchJava language. Our design enables a wide range of connector abstractions, including caches, events, streams, and remote method calls. Developers can describe both the run-time semantics of connectors and the typechecking semantics. The connector abstraction supported by ArchJava cleanly separates reusable connection code from application logic, making the semantics of connections more explicit and allowing engineers to easily change the connection mechanisms used in a program. We evaluate the expressiveness and the engineering benefits of our design in a case study applying ArchJava to the PlantCare ubiquitous computing application.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

A demonstration of JPie: An environment for live software construction in Java

A demonstration of JPie: An environment for live software co...

引用

18th Annual acm sigplan conference on Object-Oriented programming, Systems, languages, and Applications, OOPSLA'03

作者： Goldman, Kenneth J. Computer Science and Engineering Washington University St. Louis MO United States

ISBN: (纸本)1581137516

JPie is a tightly integrated development environment supporting live object-oriented software construction in Java. JPie embodies the notion of a dynamic class whose signature and implementation can be modified at run time, with changes taking effect immediately upon existing instances of the class. The result is complete elimination of the edit-compile-test cycle. JPie users create and modify class definitions through direct manipulation of visual representations of program abstractions. This support is provided without modification of the language or run-time system. In this demonstration, we illustrate central features of JPie through the construction of a sample application. These include dynamic declaration of instance variables and methods, dynamic modification of method bodies and threads, dynamic user interface construction and event handling, and on-the-fly exception handling in JPie's integrated thread-oriented debugger.

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Charm++: A portable concurrent object oriented system based on C++ 8

Charm++: A portable concurrent object oriented system based ...

引用

8th Annual conference on Object-Oriented programming Systems, languages, and Applications, OOPSLA 1993

作者： Kale, Laxmikant V. Krishnan, Sanjeev Department of Computer Science University of Illinois Urbana-Champaign United States

ISBN: (纸本)0897915879

We describe Charm++, an object oriented portable parallel programming language based on C++. Its design philosophy, implementation, sample applications and their performance on various parallel machines are described. Charm++ is an explicitly parallel language consisting of C++ with a few extensions. It provides a clear separation between sequential and parallel objects. The execution model of Charm++ is message driven, thus helping one write programs that are latencytolerant. The language supports multiple inheritance, dynamic binding, overloading, strong typing, and reuse for parallel objects. Charm++ provides specific modes for sharing information between parallel objects. Extensive dynamic load balancing strategies are provided. It is based on the Charm parallel programming system, and its runtime system implementation reuses most of the runtime system for Charm. © 1993 acm.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：