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

GPCE'07 - 6th International conference on Generative programming and Component Engineering

作者： Pirkelbauer, Peter Solodkyy, Yuriy Stroustrup, Bjarne Texas A and M University College Station TX 77843-3112

ISBN: (纸本)9781595938558

Multiple dispatch - the selection of a function to be invoked based on the dynamic type of two or more arguments - is a solution to several classical problems in object-oriented programming. Open multi-methods generalize multiple dispatch towards open-class extensions, which improve separation of concerns and provisions for retroactive design. We present the rationale, design, implementation, and performance of a language feature, called open multi-methods, for C++. Our open multi-methods support both repeated and virtual inheritance. Our call resolution rules generalize both virtual function dispatch and overload resolution semantics. After using all information from argument types, these rules can resolve further ambiguities by using covariant return types. Great care was taken to integrate open multi-methods with existing C++ language features and rules. We describe a model implementation and compare its performance and space requirements to existing open multi-method extensions and workaround techniques for C++. Compared to these techniques, our approach is simpler to use, catches more user mistakes, and resolves more ambiguities through link-time analysis, runs significantly faster, and requires less memory. In particular, the runtime cost of calling an open multi method is constant and less than the cost of a double dispatch (two virtual function calls). Finally, we provide a sketch of a design for open multi-methods in the presence of dynamic loading and linking of libraries. Copyright © 2007 acm.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Can programming be liberated from the two-level style?: Multi-level programming with DeepJava

引用

acm sigplan NOTICES 2007年第10期42卷 229-243页

作者： Kuehne, Thomas Schreiber, Daniel Tech Univ Darmstadt Darmstadt Germany

Since the introduction of object-oriented programming few programming languages have attempted to provide programmers with more than objects and classes, i.e., more than two levels. Those that did, almost exclusively aimed at describing language properties - i. e., their metaclasses exert linguistic control on language concepts and mechanisms often in order to make the language extensible. In terms of supporting logical domain classification levels, however, they are still limited to two levels. In this paper we conservatively extend the object-oriented programming paradigm to feature an unbounded number of domain classification levels. We can therefore avoid the introduction of accidental complexity into programs caused by accommodating multiple domain levels within only two programming levels. We present a corresponding language design featuring "deep instantiation" and demonstrate its features with a running example. Finally, we outline the implementation of our compiler prototype and discuss the potentials of further developing our language design.

关键词： languages design domain metatypes ontological metamodeling deep characterization

来源：评论

学校读者我要写书评

暂无评论

design and implementation of a comprehensive real-time java virtual machine

Design and implementation of a comprehensive real-time java ...

引用

EMSOFT'07: 7th acm and IEEE International conference on Embedded Software

作者： Auerbach, Joshua Bacon, David F. Blainey, Bob Cheng, Perry Dawson, Michael Fulton, Mike Grove, David Hart, Darren Stoodley, Mark IBM Research IBM Linux Technology Center

ISBN: (纸本)9781595938251

The emergence of standards for programming real-time systems in Java has encouraged many developers to consider its use for systems previously only built using C, Ada, or assembly language. However, the RTSJ standard in isolation leaves many important problems unaddressed, and suffers from some serious problems in usability and safety. As a result, the use of Java for real-time programming has continued to be viewed as risky and adoption has been slow. In this paper we provide a description of IBM's new real-time Java virtual machine product, which combines Metronome real-time garbage collection, ahead-of-time compilation, and a complete implementation of the RTSJ standard, running on top of a custom real-time multiprocessor Linux kernel. We will describe the implementation of each of these components, including how they interacted both positively and negatively, and the extensions to previous work required to move it from research prototype to a system implementing the complete semantics of the Java language. The system has been adopted for hard real-time development of naval weapons systems and soft real-time telecommunications servers. We present measurements showing that the system is able to provide sub-millisecond worst-case garbage collection latencies, 50 microsecond Linux scheduling accuracy, and eliminate non-determinism due to JIT compilation. Copyright 2007 acm.

关键词： Software packages

来源：评论

学校读者我要写书评

暂无评论

Architectural design via declarative programming

Architectural design via declarative programming

引用

9th International conference on Enterprise Information Systems (ICEIS 2007)

作者： Pereira, Luis Moniz Viegas, Ruben Duarte Univ Nova Lisboa Fac Ciencias & Tecnol Monte De Caparica Portugal

ISBN: (纸本)9789728865894

Problem solving by declarative theory building can be an extremely effective method for porting concepts and knowledge from the problem domain to the solution domain, by allowing the implementation of complete procedural constructs and enabling to produce sound solutions. If conveniently expressed, such a theory may be directly coded into a declarative programming language. If expressed within the paradigm of logic programming, then the theory itself represents the very procedure to obtain its desired solutions. The illustrative case study considered here is the obtention of architectural layouts from an adjacency graph: Given a list of imposed adjacencies among a set of planar rectangular spaces (represented by the graph's nodes), the goal is to generate all permissible layouts schemas on the plane which respect the adjacencies, and to determine the minimal modular dimensions of such a set of spaces. Another aim of this article is also to show the guidelines of an effective translation of the theory constructed to solve the proposed problem in Logic programming, making use of the combined power of two different semantics and their implementations, namely the Well Founded Semantics and the Stable Models one.

关键词： architectural design declarative design support system solution generation by constraint solving logic programming for design

来源：评论

学校读者我要写书评

暂无评论

Regularly annotated set constraints

引用

acm sigplan NOTICES 2007年第6期42卷 331-341页

作者： Kodumal, John Aiken, Alex Univ Calif Berkeley Coverity Inc Berkeley CA 94720 USA Stanford Univ Stanford CA 94305 USA

A general class of program analyses are a combination of context-free and regular language reachability. We define regularly annotated set constraints, a constraint formalism that captures this class. Our results extend the class of reachability problems expressible naturally in a single constraint formalism, including such diverse applications as interprocedural dataflow analysis, precise type-based flow analysis, and pushdown model checking.

关键词： set constraints context-free language reachability flow analysis annotated inclusion constraints pushdown model checking

来源：评论

学校读者我要写书评

暂无评论

Combining events and threads for scalable network services - implementation and evaluation of monadic, application-level concurrency primitives

引用

acm sigplan NOTICES 2007年第6期42卷 189-199页

作者： Li, Peng Zdancewic, Steve Univ Penn Philadelphia PA 19104 USA

This paper proposes to combine two seemingly opposed programming models for building massively concurrent network services: the event-driven model and the multithreaded model. The result is a hybrid design that offers the best of both worlds-the ease of use and expressiveness of threads and the flexibility and performance of events. This paper shows how the hybrid model can be implemented entirely at the application level using concurrency monads in Haskell, which provides type-safe abstractions for both events and threads. This approach simplifies the development of massively concurrent software in a way that scales to real-world network services. The Haskell implementation supports exceptions, symmetrical multiprocessing, software transactional memory, asynchronous I/O mechanisms and application-level network protocol stacks. Experimental results demonstrate that this monad-based approach has good performance: the threads are extremely lightweight (scaling to ten million threads), and the I/O performance compares favorably to that of Linux NPTL.

关键词： languages design experimentation performance measurement event thread concurrency networking programming scalability implementation monad haskell

来源：评论

学校读者我要写书评

暂无评论

Adding delimited and composable control to a production programming environment

引用

acm sigplan NOTICES 2007年第9期42卷 165-176页

作者： Flatt, Matthew Yu, Gang Findler, Robert Bruce Felleisen, Matthias Univ Utah Salt Lake City UT 84112 USA Chinese Acad Sci Inst Software Beijing 100864 Peoples R China Univ Chicago Chicago IL 60637 USA Northeastern Univ Boston MA 02115 USA

Operators for delimiting control and for capturing composable continuations litter the landscape of theoretical programming language research. Numerous papers explain their advantages, how the operators explain each other (or don't), and other aspects of the operators' existence. Production programming languages, however, do not support these operators, partly because their relationship to existing and demonstrably useful constructs-such as exceptions and dynamic binding-remains relatively unexplored. In this paper, we report on our effort of translating the theory of delimited and composable control into a viable implementation for a production system. The report shows how this effort involved a substantial design element, including work with a formal model, as well as significant practical exploration and engineering. The resulting version of PLT Scheme incorporates the expressive combination of delimited and composable control alongside dynamic-wind, dynamic binding, and exception handling. None of the additional operators subvert the intended benefits of existing control operators, so that programmers can freely mix and match control operators.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

A 64-bit Stream Processor Architecture for Scientific Applications 07

A 64-bit Stream Processor Architecture for Scientific Applic...

引用

34th Annual International Symposium on Computer Architecture

作者： Yang, Xuejun Yan, Xiaobo Xing, Zuocheng Deng, Yu Jiang, Jiang Zhang, Ying Natl Univ Def Technol Natl Lab Paralleling & Distributed Proc Sch Comp Changsha 410073 Hunan Peoples R China

ISBN: (纸本)9781595937063

Stream architecture is a novel microprocessor architecture with wide application potential. But as for whether it can be used efficiently in scientific computing, many issues await further study. This paper first gives the design and implementation of a 64-bit stream processor, FT64 (Fei Teng 64), for scientific computing. The carrying out of 64-bit extension design and scientific computing oriented optimization are described in such aspects as instruction set architecture, stream controller, micro controller, ALU cluster, memory hierarchy and interconnection interface here. Second, two kinds of communications as message passing and stream communications are put forward. An interconnection based on the communications is designed for FT64-based high performance computers. Third, a novel stream programming language, SF95 (Stream FORTRAN95), and its compiler, SF95Compiler (Stream FORTRAN95 Compiler), are developed to facilitate the development of scientific applications. Finally, nine typical scientific application kernels are tested and the results show the efficiency of stream architecture for scientific computing.

关键词： stream processor architecture program language compiler scientific application high performance computing

来源：评论

学校读者我要写书评

暂无评论

A certified type-preserving compiler from lambda calculus to assembly language

引用

acm sigplan NOTICES 2007年第6期42卷 54-65页

作者： Chlipala, Adam Univ Calif Berkeley Berkeley CA 94720 USA

We present a certified compiler from the simply-typed lambda calculus to assembly language. The compiler is certified in the sense that it comes with a machine-checked proof of semantics preservation, performed with the Coq proof assistant. The compiler and the terms of its several intermediate languages are given dependent types that guarantee that only well-typed programs are representable. Thus, type preservation for each compiler pass follows without any significant "proofs" of the usual kind. Semantics preservation is proved based on denotational semantics assigned to the intermediate languages. We demonstrate how working with a type-preserving compiler enables type-directed proof search to discharge large parts of our proof obligations automatically.

关键词： languages verification compiler verification interactive proof assistants dependent types denotational semantics

来源：评论

学校读者我要写书评

暂无评论

Mace: language support for building distributed systems

引用

acm sigplan NOTICES 2007年第6期42卷 179-188页

作者： Killian, Charles Anderson, James W. Braud, Ryan Jhala, Ranjit Vahdat, Amin Univ Calif San Diego La Jolla CA 92093 USA

Building distributed systems is particularly difficult because of the asynchronous, heterogeneous, and failure-prone environment where these systems must run. Tools for building distributed systems must strike a compromise between reducing programmer effort and increasing system efficiency. We present Mace, a C++ language extension and source-to-source compiler that translates a concise but expressive distributed system specification into a C++ implementation. Mace overcomes the limitations of low-level languages by providing a unified framework for networking and event handling, and the limitations of high-level languages by allowing programmers to write program components in a controlled and structured manner in C++. By imposing structure and restrictions on how applications can be written, Mace supports debugging at a higher level, including support for efficient model checking and causal-path debugging. Because Mace programs compile to C++, programmers can use existing C++ tools, including optimizers, profilers, and debuggers to analyze their systems.

关键词： languages reliability performance Mace domain specific languages model checking debugging distributed systems concurrency event driven programming

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：