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

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

作者： Imbusch, Oliver Langhammer, Falk Von Walter, Guido Living Pages Research GmbH Kolosseumstrasse 1a Munich80469 Germany

Organic programming (OP) is our proposed and already emerging programming model which overcomes some of the limitations of current practice in software development in general and of object-oriented programming (OOP) in particular. Ercatons provide an implementation of the model. In some respects, OP is less than a (new) programming language, in others, it is more. An "ercato machine"implements the ideas discussed and has been used to validate the concepts described *** programming is centered around the concept of a true "Thing". A thing in an executing software system is bound to behave the way an autonomous object does in our real world, or like a cell does in an organism. Software objects do not. Therefore, traditional software systems must be planned ahead like in a centrally planned economy while with OP, software systems grow. This fact is traced back to be the root why current software development often fails to meet our expectations when it comes to large-scale projects. OP should then be able to provide the means to make software development achieve what other engineering dis-ciplines have achieved a long time ago: that project effort scales sub-linearly with *** OP we introduce a new term because we hope that the approach we are pursuing is radical enough to justify this. © 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Aspectual Caml: an aspect-oriented functional language

引用

acm sigplan NOTICES 2005年第9期40卷 320-330页

作者： Masuhara, H Tatsuzawa, H Yonezawa, A Univ Tokyo Grad Sch Arts & Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan Univ Tokyo Dept Comp Sci Tokyo Japan

We propose an aspect-oriented programming (AOP) language called Aspectual Caml based on a strongly-typed functional language Objective Caml with two AOP mechanisms similar to those in AspectJ language. This paper describes the design and implementation issues of those AOP mechanisms that give us insights into the interaction between AOP features and common features in strongly-typed functional languages such as type inference, polymorphic types and curried functions. We implemented a prototype compiler of the language and used the language for separating crosscutting concerns in application programs, including for separating descriptions of a type system from compiler descriptions.

关键词： aspect-oriented programming objective Caml pointcut and advice

来源：评论

学校读者我要写书评

暂无评论

Essential language support for generic programming

引用

acm sigplan NOTICES 2005年第6期40卷 73-84页

作者： Siek, J Lumsdaine, A Indiana Univ Open Syst Lab Bloomington IN 47405 USA

Concepts are an essential language feature for generic programming in the large. Concepts allow for succinct expression of constraints on type parameters of generic algorithms, enable systematic organization of problem domain abstractions, and make generic algorithms easier to use. In this paper we present the design of a type system and semantics for concepts that is suitable for non-type-inferencing languages. Our design shares much in common with the type classes of Haskell, though our primary influence is from best practices in the C++ community, where concepts are used to document type requirements for templates in generic libraries. Concepts include a novel combination of associated types and same-type constraints that do not appear in type classes, but that are similar to nested types and type sharing in ML.

关键词： generic programming polymorphism C++ standard ML Haskell

来源：评论

学校读者我要写书评

暂无评论

Introducing acm sigplan International Workshop on Adaptive Self-Tuning Computing Systems for the Exaflop Era

ACM International Conference Proceeding Series

引用

acm International conference Proceeding Series 2011年 iii-iv页

作者： Fursin, Grigori Hundt, Robert Mars, Jason Kashnikov, Yuriy UVSQ France Google CA United States University of Virginia United States

来源：评论

学校读者我要写书评

暂无评论

X10: An object-oriented approach to Non-Uniform Cluster Computing

X10: An object-oriented approach to Non-Uniform Cluster Comp...

引用

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

作者： Charles, Philippe Grothoff, Christian Saraswat, Vijay Donawa, Christopher Kielstra, Allan Ebcioglu, Kemal Von Praun, Christoph Sarkar, Vivek IBM T.J. Watson Research Center P.O. Box 704 Yorktown Heights NY 10598 United States UCLA Computer Science Department Boelter Hall Los Angeles CA 90095 United States IBM Toronto Laboratory 8200 Warden Avenue Markham ON L6G 1C7 Canada

It is now well established that the device scaling predicted by Moore's Law is no longer a viable option for increasing the clock frequency of future uniprocessor systems at the rate that had been sustained during the last two decades. As a result, future systems are rapidly moving from uniprocessor to multiprocessor configurations, so as to use parallelism instead of frequency scaling as the foundation for increased compute capacity. The dominant emerging multiprocessor structure for the future is a Non- Uniform Cluster Computing (NUCC) system with nodes that are built out of multi-core SMP chips with non-uniform memory hierarchies, and interconnected in horizontally scalable cluster configurations such as blade servers. Unlike previous generations of hardware evolution, this shift will have a major impact on existing software. Current OO language facilities for concurrent and distributed programming are inadequate for addressing the needs of NUCC systems because they do not support the notions of non-uniform data access within a node, or of tight coupling of distributed nodes. We have designed a modern object-oriented programming language, X10, for high performance, high productivity programming of NUCC systems. A member of the partitioned global address space family of languages, X10 highlights the explicit reification of locality in the form of places;lightweight activities embodied in async, future, foreach, and ateach constructs;a construct for termination detection (finish);the use of lock-free synchronization (atomic blocks);and the manipulation of cluster-wide global data structures. We present an overview of the X10 programming model and language, experience with our reference implementation, and results from some initial productivity comparisons between the X10 and JAVA™ languages. Copyright 2005 acm.

关键词： Object oriented programming

来源：评论

学校读者我要写书评

暂无评论

Reliable and efficient programming abstractions for wireless sensor networks

引用

acm sigplan NOTICES 2007年第6期42卷 200-210页

作者： Kothari, Nupur Gummadi, Ramakrishna Millstein, Todd Govindan, Ramesh Univ So Calif Los Angeles CA 90089 USA Univ Calif Los Angeles Los Angeles CA 90024 USA

It is currently difficult to build practical and reliable programming systems out of distributed and resource-constrained sensor devices. The state of the art in today's sensornet programming is centered around a component-based language called nesC. nesC is a node-level language-a program is written for an individual node in the network-and nesC programs use the services of an operating system called TinyOS. We are pursuing an approach to programming sensor networks that significantly raises the level of abstraction over this practice. The critical change is one of perspective: rather than writing programs from the point of view of an individual node, programmers implement a central program that conceptually has access to the entire network. This approach pushes to the compiler the task of producing node-level programs that implement the desired behavior. We present the Pleiades programming language, its compiler, and its runtime. The Pleiades language extends the C language with constructs that allow programmers to name and access node-local state within the network and to specify simple forms of concurrent execution. The compiler and runtime system cooperate to implement Pleiades programs efficiently and reliably. First, the compiler employs a novel program analysis to translate Pleiades programs into message-efficient units of work implemented in nesC. The Pleiades runtime system orchestrates execution of these units, using TinyOS services, across a network of sensor nodes. Second, the compiler and runtime system employ novel locking, deadlock detection, and deadlock recovery algorithms that guarantee serializability in the face of concurrent execution. We illustrate the readability, reliability and efficiency benefits of the Pleiades language through detailed experiments, and demonstrate that the Pleiades implementation of a realistic application performs similar to a hand-coded nesC version that contains more than ten times as much code.

关键词： performance design languages reliability experimentation wireless sensor networks macroprogramming energy efficiency serializability deadlocks

来源：评论

学校读者我要写书评

暂无评论

Quipper: A Scalable Quantum programming language 13

Quipper: A Scalable Quantum Programming Language

引用

acm sigplan conference on programming language design and implementation

作者： Alexander S. Green Peter LeFanu Lumsdaine Neil J. Ross Peter Selinger Benoit Valiron Dalhousie University Institute of Advanced Studies University of Pennsylvania

ISBN: (纸本)9781450320146

The field of quantum algorithms is vibrant. Still, there is currently a lack of programming languages for describing quantum computation on a practical scale, i.e., not just at the level of toy problems. We address this issue by introducing Quipper, a scalable, expressive, functional, higher-order quantum programming language. Quipper has been used to program a diverse set of non-trivial quantum algorithms, and can generate quantum gate representations using trillions of gates. It is geared towards a model of computation that uses a classical computer to control a quantum device, but is not dependent on any particular model of quantum hardware. Quipper has proven effective and easy to use, and opens the door towards using formal methods to analyze quantum algorithms.

关键词： Quipper Quantum programming languages

来源：评论

学校读者我要写书评

暂无评论

A race-free hardware modeling language

A race-free hardware modeling language

引用

3rd acm and IEEE International conferenceon Formal Methods and Models for Co-design, MEMOCODE'05

作者： Schaumont, Patrick Shukla, Sandeep Verbauwhede, Ingrid UCLA Virginia Tech UCLA KUL

ISBN: (纸本)0780392272

We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We derive a set of four rules under which a network of such FSMDs satisfies the Kahn principle. When applying those rules, GEZEL programs will be determinate and a designer will thus obtain race-free hardware. We define extended FSMD networks as FSMD networks for which some components are user-defined and not specified as FSMDs. An important result is that the determinate properties of the FSMD network are also valid for the extended FSMD network provided that the user-defined components are determinate. Most hardware description languages do not have this determinacy. Their simulation semantics are dependent on simulator implementation, and on a run-time race resolution mechanism. We therefore position GEZEL as a model of computation that RTL designers should have in mind while creating RTL models. In fact, we can generate SystemC and other HDL code from GEZEL models, thereby guaranteeing the determinacy in the generated HDL code. © 2005 IEEE.

关键词： Computer programming languages

来源：评论

学校读者我要写书评

暂无评论

Finding Optimum Abstractions in Parametric Dataflow Analysis 13

Finding Optimum Abstractions in Parametric Dataflow Analysis

引用

acm sigplan conference on programming language design and implementation

作者： Xin Zhang Mayur Naik Hongseok Yang Georgia Institute of Technology University of Oxford

ISBN: (纸本)9781450320146

We propose a technique to efficiently search a large family of abstractions in order to prove a query using a parametric dataflow analysis. Our technique either finds the cheapest such abstraction or shows that none exists. It is based on counterexample-guided abstraction refinement but applies a novel meta-analysis on abstract counterexample traces to efficiently find abstractions that are incapable of proving the query. We formalize the technique in a generic framework and apply it to two analyses: a type-state analysis and a thread-escape analysis. We demonstrate the effectiveness of the technique on a suite of Java benchmark programs.

关键词： Dataflow analysis CEGAR Abstraction refinement Optimum abstraction Impossibility Under-approximation languages Verification data flow analysis language Probability Verification Abstraction Parametric

来源：评论

学校读者我要写书评

暂无评论

Terra: A Multi-Stage language for High-Performance Computing 13

Terra: A Multi-Stage Language for High-Performance Computing

引用

acm sigplan conference on programming language design and implementation

作者： Zachary DeVito James Hegarty Alex Aiken Pat Hanrahan Jan Vitek Stanford University Purdue University

ISBN: (纸本)9781450320146

High-performance computing applications, such as auto-tuners and domain-specific languages, rely on generative programming techniques to achieve high performance and portability. However, these systems are often implemented in multiple disparate languages and perform code generation in a separate process from program execution, making certain optimizations difficult to engineer. We leverage a popular scripting language, Lua, to stage the execution of a novel low-level language, Terra. Users can implement optimizations in the high-level language, and use built-in constructs to generate and execute high-performance Terra code. To simplify meta-programming, Lua and Terra share the same lexical environment, but, to ensure performance, Terra code can execute independently of Lua's runtime. We evaluate our design by reimplementing existing multi-language systems entirely in Terra. Our Terra-based auto-tuner for BLAS routines performs within 20% of ATLAS, and our DSL for stencil computations runs 2.3x faster than hand-written C.

关键词： Lua Staged computation DSL design Performance

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：