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

TLDI'05: 2005 acm sigplan International Workshop on Types in languages design and implementation

作者： Chang, Bor-Yuh Evan Chlipala, Adam Necula, George C. Schneck, Robert R. Department of Electrical Engineering and Computer Science University of California Berkeley Group in Logic and the Methodology of Science University of California Berkeley

ISBN: (纸本)1581139993

It is a common belief that certifying compilation, which typically verifies the well-typedness of compiler output, can be an effective mechanism for compiler debugging, in addition to ensuring basic safety properties. Bytecode verification is a fairly simple example of this approach and derives its simplicity in part by compiling to carefully crafted high-level bytecodes. In this paper, we seek to push this method to native assembly code, while maintaining much of the simplicity of bytecode verification. Furthermore, we wish to provide experimental confirmation that such a tool can be accessible and effective for compiler debugging. To achieve these goals, we present a type-based data-flow analysis or abstract interpretation for assembly code compiled from a Java-like language, and evaluate its bug-finding efficacy on a large set of student compilers. Copyright 2005 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Compressing Java class files

Proceedings of the ACM SIGPLAN Conference on Programming Lan...

引用

Proceedings of the acm sigplan conference on programming language design and implementation (pldi) 1999年 247-258页

作者： Pugh, William Univ of Maryland College Park MD United States

Java class files are often distributed as jar files, which are collections of individually compressed class files (and possibility other files). Jar files are typically about 1/2 the size of the original class files due to compression. I have developed a wire-code format for collections of Java class files. This format is typically 1/2 to 1/5 of the size of the corresponding compressed jar file (1/4 to 1/10 the size of the original class files).

关键词： Java programming language

来源：评论

学校读者我要写书评

暂无评论

Pluggable AOP - designing aspect mechanisms for third-party composition

Pluggable AOP - Designing aspect mechanisms for third-party ...

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Kojarski, Sergei Lorenz, David H. Department of Computer Science University of Virginia Charlottesville VA 22904-4740 United States Northeastern University University of Virginia

Studies of Aspect-Oriented programming (AOP) usually focus on a language in which a specific aspect extension is integrated with a base language. languages specified in this manner have a fixed, non-extensible AOP functionality. This paper argues the need for AOP to support the integration and use of multiple domain-specific aspect extensions together. We study the more general case of integrating a base language with a set of third-party aspect extensions for that language. We present a general mixin-based semantic framework for implementing dynamic aspect extensions in such a way that multiple, independently developed aspect mechanisms can be subject to third-party composition and work collaboratively. Principles governing the design of a collaborative aspect mechanism are aspectual effect exposure and implementation hiding. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

An open and shut typecase

An open and shut typecase

引用

TLDI'05: 2005 acm sigplan International Workshop on Types in languages design and implementation

作者： Vytiniotis, Dimitrios Washburn, Geoffrey Weirich, Stephanie Department of Computer and Information Science University of Pennsylvania United States

ISBN: (纸本)1581139993

Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the structure of types while with the second form polymorphic operations are defined for specific sets of types. In intensional type analysis operations are defined by induction on the structure of types. Therefore no new cases are necessary for user-defined types, because these types are equivalent to their underlying structure, However, intensional type analysis is "closed" to extension, as the behavior of the operations cannot be differentiated for the new types, thus destroying the distinctions that these types are designed to express. Haskell type classes on the other hand define polymorphic operations for sets of types. Operations defined by class instances are considered "open" - the programmer can add instances for new types without modifying existing code. However, the operations must be extended with specialized code for each new type, and it may be tedious or even impossible to add extensions that apply to a large universe of new types. Both approaches have their benefits, so it is important to let programmers decide which is most appropriate for their needs. In this paper, we define a language that supports both forms of ad-hoc polymorphism, using the same basic constructs. Copyright 2005 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Lazy code motion

Lazy code motion

引用

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Knoop, Jens Ruething, Oliver Steffen, Bernhard Christian-Albrechts-Univ Kiel Germany

ISBN: (纸本)0897914759

We present a bit-vector algorithm for the optimal and economical placement of computations within flow graphs, which is as efficient as standard uni-directional analyses. The point of our algorithm is the decomposition of the bi-directional structure of the known placement algorithms into a sequence of a backward and a forward analysis, which directly implies the efficiency result. Moreover, the new compositional structure opens the algorithm for modification: two further uni-directional analysis components exclude any unnecessary code motion. This laziness of our algorithm minimizes the register pressure, which has drastic effects on the run-time behaviour of the optimized programs in practice, where an economical use of registers is essential.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

XJ: Robust XML Processing in Java™

XJ: Robust XML Processing in Java™

引用

OOPSLA'05 - 20th Annual acm conference on Object-Oriented programming, Systems, languages, and Applications

作者： Bordawekar, Rajesh Burke, Michael Peshansky, Igor Raghavachari, Mukund Ibm T.J. Watson Research Center HawthorneNY United States

来源：评论

学校读者我要写书评

暂无评论

Bringing the WebAssembly Standard up to Speed with SpecTec

引用

PROCEEDINGS OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 1559-1584页

作者： Youn, Dongjun Shin, Wonho Lee, Jaehyun Ryu, Sukyoung Breitner, Joachim Gardner, Philippa Lindley, Sam Pretnar, Matija Rao, Xiaojia Watt, Conrad Rossberg, Andreas Korea Adv Inst Sci & Technol Daejeon South Korea Imperial Coll London London England Univ Edinburgh Edinburgh Midlothian Scotland Univ Ljubljana Ljubljana Slovenia Univ Cambridge Cambridge England

WebAssembly (Wasm) is a portable low-level bytecode language and virtual machine that has seen increasing use in a variety of ecosystems. Its specification is unusually rigorous - including a full formal semantics for the language - and every new feature must be specified in this formal semantics, in prose, and in the official reference interpreter before it can be standardized. With the growing size of the language, this manual process with its redundancies has become laborious and error-prone, and in this work, we offer a solution. We present SpecTec, a domain-specific language (DSL) and toolchain that facilitates both the Wasm specification and the generation of artifacts necessary to standardize new features. SpecTec serves as a single source of truth - from a SpecTec definition of the Wasm semantics, we can generate a typeset specification, including formal definitions and prose pseudocode descriptions, and a meta-level interpreter. Further backends for test generation and interactive theorem proving are planned. We evaluate SpecTecs ability to represent the latest Wasm 2.0 and show that the generated meta-level interpreter passes 100% of the applicable official test suite. We show that SpecTec is highly effective at discovering and preventing errors by detecting historical errors in the specification that have been corrected and ten errors in five proposals ready for inclusion in the next version of Wasm. Our ultimate aim is that SpecTec should be adopted by the Wasm standards community and used to specify future versions of the standard.

关键词： WebAssembly language specification executable prose DSL

来源：评论

学校读者我要写书评

暂无评论

GenSQL: A Probabilistic programming System for Querying Generative Models of Database Tables

引用

PROCEEDINGS OF THE acm ON programming languageS-PacmPL 2024年第PLDI期8卷 790-815页

作者： Huot, Mathieu Ghavami, Matin Lew, Alexander K. Schaechtle, Ulrich Freer, Cameron E. Shelby, Zane Rinard, Martin C. Saad, Feras A. Mansinghka, Vikash K. MIT Cambridge MA 02139 USA Digital Garage Tokyo Japan Carnegie Mellon Univ Pittsburgh PA USA

This article presents GenSQL, a probabilistic programming system for querying probabilistic generative models of database tables. By augmenting SQL with only a few key primitives for querying probabilistic models, GenSQL enables complex Bayesian inference workflows to be concisely implemented. GenSQL's query planner rests on a unified programmatic interface for interacting with probabilistic models of tabular data, which makes it possible to use models written in a variety of probabilistic programming languages that are tailored to specific workflows. Probabilistic models may be automatically learned via probabilistic program synthesis, hand-designed, or a combination of both. GenSQL is formalized using a novel type system and denotational semantics, which together enable us to establish proofs that precisely characterize its soundness guarantees. We evaluate our system on two case real-world studies-an anomaly detection in clinical trials and conditional synthetic data generation for a virtual wet lab-and show that GenSQL more accurately captures the complexity of the data as compared to common baselines. We also show that the declarative syntax in GenSQL is more concise and less error-prone as compared to several alternatives. Finally, GenSQL delivers a 1.7-6.8x speedup compared to its closest competitor on a representative benchmark set and runs in comparable time to hand-written code, in part due to its reusable optimizations and code specialization.

关键词： generative modeling Bayesian data science probabilistic query language

来源：评论

学校读者我要写书评

暂无评论

design and implementation of HoME

Design and implementation of HoME

引用

acm sigplan '92 conference on programming language design and implementation, pldi 1992

作者： Ogata, Kazuhiro Kurihara, Satoshi Inari, Mikio Doi, Norihisa Keio Univ Yokohama Japan

ISBN: (纸本)0897914759

HoME is a version of Smalltalk which can be efficiently executed on a multiprocessor and can be executed in parallel by combining a Smalltalk process with a Mach thread and executing the process on the thread. HoME is nearly the same as ordinary Smalltalk except that multiple processes may execute in parallel. Thus, almost all applications running on ordinary Smalltalk can be executed on HoME without changes in their code. HoME was designed and implemented based on the following fundamental policies: (1) theoretically, an infinite number of processes can become active;(2) the moment a process is scheduled, it becomes active;(3) no process switching occurs;(4) HoME is equivalent to ordinary Smalltalk except for the previous three policies. The performance of the current implementation of HoME running on OMRON LUNA-88K, which had four processors, was measured by benchmarks which execute in parallel with multiple processes. In all benchmarks, the results showed that HoME's performance is much better than HPS on the same workstation.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

EXOCHI: Architecture and programming Environment for A Heterogeneous Multi-core Multithreaded System 07

EXOCHI: Architecture and Programming Environment for A Heter...

引用

conference on programming language design and implementation

作者： Wang, Perry H. Collins, Jamison D. Chinya, Gautham N. Jiang, Hong Tian, Xinmin Girkar, Milind Yang, Nick Y. Lueh, Guei-Yuan Wang, Hong Intel Corp Microprocessor Technol Labs Microarchitecture Res Lab Santa Clara CA 95051 USA

ISBN: (纸本)9781595936332

Future mainstream microprocessors will likely integrate specialized accelerators, such as GPUs, onto a single die to achieve better performance and power efficiency. However, it remains a keen challenge to program such a heterogeneous multi-core platform, since these specialized accelerators feature ISAs and functionality that are significantly different from the general purpose CPU cores. In this paper. we present EXOCHI: (1) Exoskeleton Sequencer (EXO), an architecture to represent heterogeneous accelerators as ISA-based MIMD architecture resources, and a shared virtual memory heterogeneous multithreaded program execution model that tightly couples specialized accelerator cores with general purpose CPU cores, and (2) C for Heterogeneous Integration (CHI), an integrated C/C++ programming environment that supports accelerator-specific inline assembly and domain-specific languages. The CHI compiler extends the OpenMP pragma for heterogeneous multithreading programming, and produces a single fat binary with code sections corresponding to different instruction sets. The runtime can judiciously spread parallel Computation across the heterogenous cores to optimize performance and power. We have prototyped the EXO architecture on a physical heterogeneous platform consisting of an Intel (R) Core (TM) 2 Duo Processor and an 8-core 32-thread Intel (R) Graphics Media Accelerator X3000. In addition. we have implemented the CHI integrated programming environment with the Intel (R) C++ Compiler, runtime toolset. and debugger. On the EXO prototype system, we have enhanced a suite of production-quality media kernels for video and image processing to utilize the accelerator through the CHI programming interface, achieving significant speedup (1.41x to 10.97x) over execution on the IA32 CPU alone.

关键词： Heterogeneous multi-cores GPU OpenMP

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：