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

18th Annual conference on Object-Oriented programming, Systems, languages and Applications (OOPSLA 2003)

作者： Allen, E Bannet, J Cartwright, R Rice Univ Houston TX 77005 USA

This paper describes how to add first-class generic types including mixins - to strongly-typed 00 languages with nominal subtyping such as Java and C#. A generic type system is "first-class" if generic types can appear in any context where conventional types can appear. In this context, a mixin is simply a generic class that extends one of its type parameters, e.g., a class C that extends T. Although mixins of this form are widely used in C++ (via templates), they are clumsy and error-prone because C++ treats mixins as macros, forcing each mixin instantiation to be separately compiled and type-checked. The abstraction embodied in a mixin is never separately analyzed. Our formulation of mixins using first-class genericity accommodates sound local (class-by-class) type checking. A mixin can be fully type-checked given symbol tables for each of the classes that it directly references-the same context in which Java performs incremental class compilation. To our knowledge, no previous formal analysis of first-class genericity in languages with nominal type systems has been conducted, which is surprising because nominal subtyping has become predominant in mainstream object-oriented programming languages. What makes our treatment of first-class genericity particularly interesting and important is the fact that it can be added to the existing Java language without any change to the underlying Java Virtual Machine. Moreover, the extension is backward compatible with legacy Java source and class files. Although our discussion of a, practical implementation strategy focuses on Java, the same implementation techniques could be applied to other object-oriented languages such as C# or Eiffel that support incremental compilation, dynamic class loading, and nominal subtyping.

关键词： design languages

来源：评论

学校读者我要写书评

暂无评论

proceedings - 1st acm and IEEE International conference on Formal Methods and Models for Co-design, MEMOCODE 2003

Proceedings - 1st ACM and IEEE International Conference on F...

引用

1st acm and IEEE International conference on Formal Methods and Models for Co-design, MEMOCODE 2003

ISBN: (纸本)0769519237

The proceedings contain 31 papers. The topics discussed include: executable computational logics: combining formal methods and programming language based system design;from use cases to system implementation: statechart based co-design;goal-oriented requirements analysis for process control systems design;analyzing concurrency in computational networks;finding good counter-examples to aid design verification;high level verification for control intensive systems using predicate abstraction;formal verification of an Intel XScale processor model with scoreboarding, specialized execution pipelines, and imprecise data-memory exceptions;engineering changes in field modifiable architectures;hierarchical and incremental verification for system level design: challenges and accomplishments;and how to compute the refinement relation for parameterized systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Accurate garbage collection in an uncooperative environment

引用

acm sigplan NOTICES 2003年第2期38卷 256-262页

作者： Henderson, F Univ Melbourne Dept Comp Sci & Software Engn Melbourne Vic 3010 Australia

Previous attempts at garbage collection in uncooperative environments have generally used conservative or mostly-conservative approaches. We describe a technique for doing fully type-accurate garbage collection in an uncooperative environment, using a "shadow stack" to link structs of pointer-containing variables, together with the data or code needed to trace them. We have implemented this in the Mercury compiler, which generates C code, and present preliminary performance data on the overheads of this technique. We also show how this technique can be extended to handle multithreaded applications.

关键词： algorithms design experimentation measurement performance reliability languages garbage collection programming language implementation multithreading C

来源：评论

学校读者我要写书评

暂无评论

Software evolution - Background, theory, practice

Software evolution - Background, theory, practice

引用

Joint European conference on Theory and Practice of Software (ETAPS 2003)

作者： Lehman, MM Ramil, JF Middlesex Univ Sch Comp London N11 2NQ England Open Univ Fac Maths & Comp Dept Comp Milton Keynes MK7 6AA Bucks England

This paper opens with a brief summary of some 30 years of study of the software evolution phenomenon. The results of those studies include the SPE program classification, a principle of software uncertainty and laws of E-type software evolution. The laws were termed so because they encapsulate phenomena largely independent of the people, the organisations and the domains involved in the evolution of the E-type systems studied. Recent studies have refined earlier conclusions, yielded practical guidelines for software evolution management and provide a basis for the formation of a theory of software evolution. Given the volume of published material and the extent of recent discussions on the topic (see, e.g., [Proc. ICSM, Montreal, 2002, p. 66]), this paper is restricted to an overview that exposes the significance of the evolution phenomenon and its study to the wider community, providing a basis for the future and, in particular, development of a theory of software evolution. (C) 2003 Elsevier B.V. All rights reserved.

关键词： software engineering software design and implementation safety/security in digital systems software evolution theory of software evolution laws of software evolution software uncertainty principle software process best practice assumptions maintenance

来源：评论

学校读者我要写书评

暂无评论

DAOP-ADL: An architecture description language for dynamic component and aspect-based development

引用

2nd International conference on Generative programming and Component Engineering, GPCE 2003

作者： Pinto, MÓnica Fuentes, Lidia Troya, Jose MarÍa Dpto. de Lenguajes y Ciencias de la Computación University of Málaga Málaga Spain

ISBN: (纸本)3540201025

Architecture description languages deal with the description, analysis and reuse of software architectures. This paper describes DAOP-ADL, a component- and aspect-based language to specify the architecture of an application in terms of components, aspects and a set of plug-compatibility rules between them. With the aim of connecting the specification of the application architecture to the implementation, we describe our language using XML and XML Schemas. The DAOP-ADL language was designed to be interpreted by DAOP, our own dynamic component- and aspect-oriented platform. DAOP provides a composition mechanism that plugs aspects into components dynamically at runtime. The software architect will use the DAOP-ADL language at design time to describe the architecture of the application. Later this architectural information is loaded into the DAOP platform, which needs it to establish the dynamic connections between autonomous components and aspects. Therefore, the use of DAOP-ADL closes the gap between design and implementation of component- and aspect-based applications. © Springer-Verlag Berlin Heidelberg 2003.

关键词： XML

来源：评论

学校读者我要写书评

暂无评论

implementation of a scripting language for VRML/X3D-based embodied agents

Implementation of a scripting language for VRML/X3D-based em...

引用

proceedings Web3D 2002 Symposium: 7th International conference on 3D Web Technology

作者： Huang, Zhisheng Eliëns, Anton Visser, Cees Intelligent Multimedia Group Div. of Mathematics and Comp. Sci. Vrije University Amsterdam Amsterdam Netherlands

Embodied agents or humanoid avatars may effectively be used to communicate with human users. Currently there is a wide range of specification formalisms and scripting languages for embodied agents, many of which are of a somewhat ad hoc nature lacking clear semantics. In this paper, we discuss the implementation of a scripting language for humanoid avatars in VRML/X3D-based environments. The scripting language STEP is based on dynamic logic, which provides a clear semantics for complex behavioral patterns. Moreover, the implementation of STEP is realized in a platform that extends VRML/X3D with distributed logic programming (DLP), which provides the computational support necessary to realize such complex behavioral patterns as well as the interaction with a (rich media) 3D environment. As an application example, we will discuss the development of an instructional VR for Tai Chi (the Chinese art of movement), illustrating how our approach allows for the creation of reusable libraries of behavioral patterns. We will discuss some implementation issues, in particular how to realize parallel actions and synchronization within an environment.

关键词： Virtual reality

来源：评论

学校读者我要写书评

暂无评论

implementation of alternative pacing in an introductory programming sequence 03

Implementation of alternative pacing in an introductory prog...

引用

4th conference on Information Technology Curriculum, CITC4 2003

作者： Whittington, Keith J. Bills, Dianne P. Hill, Lawrence W. Information Technology Department Rochester Institute of Technology RochesterNY14623 United States

ISBN: (纸本)1581137702

Appropriately placing freshmen students into introductory programming courses can be problematic. Performance in high school coursework, SAT scores, AP courses, and even pretesting can be poor predictors of success for individuals. Yet, putting all students through the same curricular experience is not a good solution. Contention can develop between students who quickly grasp concepts and those who take longer to learn. However, experience has shown that performance in the first college programming course can be a predictor of future success. In the 2001-2 academic year, the Information Technology Department at the Rochester Institute of Technology began teaching a three-term introductory programming sequence in studio format. One unexpected benefit of this approach was the ability to quickly and accurately assess how well students were learning programming concepts (Hill et al, 2002). In the 2002-3 academic year, this assessment was used to design flexibility into the beginning programming sequence. A new curriculum was implemented that uses performance in the first course for placement in subsequent courses. All students took the same first programming course. Based on their performance, successful students were advised into one of two "second course" options, either the standard second course or an alternatively paced two-course sequence. The new two-term sequence included a review of the more difficult material from the first course along with the material from the standard second course, but taught at a slower pace. A questionnaire was given to all students who opted into the alternate-paced sequence for their feedback. The slower presentation pace and the time for additional projects in the alternative course sequence have proven to be a benefit to students. Copyright 2003 acm.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

CDuce: an XML-centric general-purpose language 03

CDuce: an XML-centric general-purpose language

引用

proceedings of the eighth acm sigplan international conference on Functional programming

作者： Véronique Benzaken Giuseppe Castagna Alain Frisch Université Paris-Sud Orsay France CNRS Département d'Informatique Paris France

ISBN: (纸本)9781581137569

We present the functional language CDuce, discuss some design issues, and show its adequacy for working with XML documents. Distinctive features of CDuce are a powerful pattern matching, first class functions, overloaded functions, a very rich type system (arrows, sequences, pairs, records, intersections, unions, differences), precise type inference for patterns and error localization, and a natural interpretation of types as sets of values. We also outline some important implementation issues; in particular, a dispatch algorithm that demonstrates how static type information can be used to obtain very efficient compilation schemas..

关键词： type systems XML CDuce XML-processing

来源：评论

学校读者我要写书评

暂无评论

Taming the IXP network processor 03

引用

proceedings of the acm sigplan 2003 conference on programming language design and implementation

作者： Lal George Matthias Blume Network Speed Technologies Inc Toyota Technological Institute at Chicago

ISBN: (纸本)9781581136623

We compile Nova, a new language designed for writing network processing applications, using a back end based on integer-linear programming (ILP) for register allocation, optimal bank assignment, and spills. The compiler's optimizer employs CPS as its intermediate representation; some of the invariants that this IR guarantees are essential for the formulation of a practical ILP *** and George used a similar ILP-based technique for the IA32 to decide which variables reside in registers but deferred the actual assignment of colors to a later phase. We demonstrate how to carry over their idea to an architecture with many more banks, register aggregates, variables with multiple simultaneous register assignments, and, very importantly, one where bank- and register-assignment cannot be done in isolation from each other. Our approach performs well in practise---without causing an explosion in size or solve time of the generated integer linear programs.

关键词： bank assignment network processors integer linear programming programming languages code generation Intel IXA register allocation

来源：评论

学校读者我要写书评

暂无评论

The design, implementation, and evaluation of a compiler algorithm for CPU energy reduction 03

引用

proceedings of the acm sigplan 2003 conference on programming language design and implementation

作者： Chung-Hsing Hsu Ulrich Kremer Rutgers The State University of New Jersey

ISBN: (纸本)9781581136623

This paper presents the design and implementation of a compiler algorithm that effectively optimizes programs for energy usage using dynamic voltage scaling (DVS). The algorithm identifies program regions where the CPU can be slowed down with negligible performance loss. It is implemented as a source-to-source level transformation using the SUIF2 compiler infrastructure. Physical measurements on a high-performance laptop show that total system (i.e., laptop) energy savings of up to 28% can be achieved with performance degradation of less than 5% for the SPECfp95 benchmarks. On average, the system energy and energy-delay product are reduced by 11% and 9%, respectively, with a performance slowdown of 2%. It was also discovered that the energy usage of the programs using our DVS algorithm is within 6% from the theoretical lower bound. To the best of our knowledge, this is one of the first work that evaluates DVS algorithms by physical measurements.

关键词： energy savings dynamic voltage scaling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：