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

8th international conference on generative programming and component engineering

作者： Sanen, Frans Truyen, Eddy Joosen, Wouter Katholieke Univ Leuven Dept Comp Sci DistriNet B-3001 Heverlee Belgium

ISBN: (纸本)9781605584942

Mapping problem-space features into solution-space features is a fundamental configuration problem in software product line engineering. A configuration problem is defined as generating the most optimal combination of software features given a requirements specification and given a set of configuration rules. Current approaches however provide little support for expressing complex configuration rules between problem and solution space that support incomplete requirements specifications. In this paper, we propose an approach to model complex configuration rules based on a generalization of the concept of problem-solution feature interactions. these are interactions between solution-space features that only arise in specific problem contexts. the use of an existing tool to support our approach is also discussed: we use the DLV answer set solver to express a particular configuration problem as a logic program whose answer set corresponds to the optimal combinations of solution-space features. We motivate and illustrate our approach with a case study in the field of managing dynamic adaptations in distributed software, where the goal is to generate an optimal protocol for accommodating a given adaptation.

关键词： Algorithms design performance reliability Software product line engineering configuration knowledge problem-solution feature interactions default logic DLV distributed runtime adaptation

来源：评论

学校读者我要写书评

暂无评论

programming with C plus plus concepts

引用

SCIENCE OF COMPUTER programming 2010年第7期75卷 596-614页

作者： Jaervi, Jaakko Marcus, Mat Smith, Jacob N. Texas A&M Univ College Stn TX 77843 USA Adobe Syst Inc Seattle WA USA

this paper explores the definition, applications, and limitations of concepts and concept maps in C++, with a focus on library composition. We also compare and contrast concepts to adaptation mechanisms in other languages. Efficient, non-intrusive adaptation mechanisms are essential when adapting data structures to a library's API. Development with reusable components is a widely practiced method of building software. components vary in form, ranging from source code to non-modifiable binary libraries. the Concepts language features, slated to appear in the next version of C++, have been designed with such compositions in mind, promising an improved ability to create generic, non-intrusive, efficient, and identity-preserving adapters. We report on two cases of data structure adaptation between different libraries, and illustrate best practices and idioms. First, we adapt GUI widgets from several libraries, with differing APIs, for use with a generic layout engine. We further develop this example to describe the run-time concept idiom, extending the applicability of concepts to domains where run-time polymorphism is required. Second, we compose an image processing library and a graph algorithm library, by making use of a transparent adaptation layer, enabling the efficient application of graph algorithms to the image processing domain. We use the adaptation layer to realize a few key algorithms, and report little or no performance degradation. (C) 2009 Elsevier B.V. All rights reserved.

关键词： C plus Concepts Software libraries component adaptation Generic programming Polymorphism

来源：评论

学校读者我要写书评

暂无评论

Reusable, Generic Program Analyses and Transformations 09

Reusable, Generic Program Analyses and Transformations

引用

8th international conference on generative programming and component engineering

作者： Willcock, Jeremiah Lumsdaine, Andrew Quinlan, Daniel Indiana Univ Bloomington IN 47405 USA Lawrence Livermore Natl Lab Livermore CA USA

ISBN: (纸本)9781605584942

the optimizations in modern compilers are constructed for a predetermined set of primitive types. As a result, programmers are unable to exploit optimizations for user-defined types where these optimizations would be correct and beneficial. Moreover, because the set of optimizations is also fixed, programmers are unable to incorporate new optimizations into the compiler. To address these limitations, we apply the reuse methodologies from generic programming to compiler analyses and optimizations. To enable compilers to apply optimizations to classes of types rather than particular types, we define optimizations in terms of generic interface descriptions (similar to C++ concepts or Haskell type classes). By extending these interface descriptions to include associated program analysis and transformation fragments, we enable compilers to incorporate user-defined transformations and analyses. Since these transformations are explicitly associated with interface descriptions, they can be applied in generic fashion by the compiler. We demonstrate that classical compiler optimizations, when generalized using this framework, can apply to a broad range of types, both built-in and user-defined. Finally, we present an initial implementation, the principles of which are generalizable to other compilers.

关键词： Languages Performance Generic programming compiler optimization program analysis

来源：评论

学校读者我要写书评

暂无评论

Transactional Pointcuts Designation, Reification, and Advice of Interrelated Join Points 09

Transactional Pointcuts Designation, Reification, and Advice...

引用

8th international conference on generative programming and component engineering

作者： Sadat-Mohtasham, Hossein Hoover, H. James Univ Alberta Dept Comp Sci Software Engn Res Lab Edmonton AB T6G 2M7 Canada

ISBN: (纸本)9781605584942

Aspect-oriented mechanisms are characterized by their join point models. A join point model has three components: join points, which are elements of language semantics;"a means of identifying join points";and "a means of affecting the behaviour at those join points." A pointcut-advice model is a dynamic join point model in which join points are points in program execution. Pointcuts select a set of join points, and advice affects the behaviour of the selected join points. In this model, join points are typically selected and advised independently of each other. that is, the relationships between join points are not taken into account in join point selection and advice. In practice, join points are often not independent. Instead, they form part of a higher-level operation that implements the intent of the developer (e.g. managing a resource). there are natural situations in which join points should be selected only if they play a specific role in that operation. We propose a new join point model that takes join point interrelationships into account and allows the designation of more complex computations as join points. Based on the new model, we have designed an aspect-oriented construct called a transactional point-cut (transcut). Transcuts select sets of interrelated join points and reify them into higher-level join points that can be advised. they share much of the machinery and intuition of pointcuts, and can be viewed as their natural extension. We have implemented a transcuts prototype as an extension to the AspectJ language and integrated it into the abc compiler. We present an example where a transcut is applied to implement recommended resource handling practices in the presence of exceptions within method boundaries.

关键词： Design Languages Aspect-oriented programming Join Point Model Transactional Pointcut

来源：评论

学校读者我要写书评

暂无评论

Aspects of availability Enforcing timed properties to prevent denial of service

引用

SCIENCE OF COMPUTER programming 2010年第7期75卷 516-542页

作者： Fradet, Pascal Ha, Stephane Hong Tuan INRIA Grenoble Rhone Alpes F-38330 Montbonnot St Martin France CEA Saclay DRT LIST DTSI LSL F-91191 Gif Sur Yvette France INRIA Rennes Bretagne Atlantique F-35042 Rennes France

We propose a domain-specific aspect language to prevent denial of service caused by resource management. Our aspects specify availability policies by enforcing time limits in the allocation of resources. In our language, aspects can be seen as formal timed properties on execution traces. Programs and aspects are specified as timed automata and the weaving process as an automata product. the benefit of this formal approach is two-fold: the user keeps the semantic impact of weaving under control and (s)he can use a model-checker to optimize the woven program and verify availability properties. this article presents the main approach (programs, aspects, weaving) formally using timed safety automata. the specification of resources, optimizations and verification are sketched in a more intuitive fashion. Even if a concrete implementation remains as future work, we address some high-level implementation issues and illustrate the approach by small examples and a case study. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Aspect-oriented programming Availability Resource management Timed automata Weaving Denial of service

来源：评论

学校读者我要写书评

暂无评论

Design and evaluation of C plus plus open multi-methods

引用

SCIENCE OF COMPUTER programming 2010年第7期75卷 638-667页

作者： Pirkelbauer, Peter Solodkyy, Yuriy Stroustrup, Bjarne Texas A&M Univ College Stn TX 77843 USA

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, performance, programming guidelines, and experiences of working with 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. 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 work-around 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, is comparable in memory usage, and runs significantly faster. 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. (C) 2009 Elsevier B.V. All rights reserved.

关键词： Multi-methods Open-methods Multiple dispatch Binary method problem Augmenting method problem Object-oriented programming Generic programming C plus

来源：评论

学校读者我要写书评

暂无评论

Extracting component-oriented behaviour for self-healing enabling

Extracting component-oriented behaviour for self-healing ena...

引用

7th IEEE international conference and Workshop on engineering of Autonomic and Autonomous Systems, EASe 2010

作者： Bakera, Marco Wagner, Christian Margaria, Tiziana Vassev, Emil Hincheyz, Mike Steffen, Bernhard Universität Potsdam Department of Service and Software Engineering Potsdam Germany University College Dublin Ireland University of Limerick Ireland Technische Universität Dortmund Department of Programming Systems Dortmund Germany

ISBN: (纸本)9780769540047

Rich and multifaceted domain specific specification languages like the Autonomic System Specification Language (ASSL) help to design reliable systems with self-healing capabilities. the GEAR game-based Model Checker has been used successfully to investigate in depth properties of the ESA ExoMars Rover. We show here how to enable GEAR's game-based verification techniques for ASSL via systematic model extraction from a behavioral subset of the language, and illustrate it on a description of the Voyager II space mission. this way, we close the gap between the design-time and the run-time techniques provided in the SHADOWS platform for self-healing of concurrency, performance, and functional issues. © 2010 IEEE.

关键词： Specification languages

来源：评论

学校读者我要写书评

暂无评论

GPCE'09 - Proceedings of the 8th international ACM SIGPLAN conference on generative programming and component engineering: Foreword

GPCE'09 - Proceedings of the 8th International ACM SIGPLAN C...

引用

GPCE'09 - Proceedings of the 8th international ACM SIGPLAN conference on generative programming and component engineering 2009年 iii页

作者： Siek, Jeremy Fischer, Bernd University of Colorado Boulder CO United States University of Southampton Southampton United Kingdom

来源：评论

学校读者我要写书评

暂无评论

Synthesis-Based Loose programming

Synthesis-Based Loose Programming

引用

7th international conference on the Quality of Information and Communications Technology (QUATIC)

作者： Lamprecht, Anna-Lena Naujokat, Stefan Margaria, Tiziana Steffen, Bernhard Tech Univ Dortmund Chair Programming Syst D-44227 Dortmund Germany Univ Potsdam Chair Serv & Software Engn D-14882 Potsdam Germany

ISBN: (纸本)9780769542416

In this paper we present loose programming, an approach designed to enable process developers to design their application-specific processes in an intuitive style. Key to this approach is the concept of loose specification, a graphical formalism that allows developers to express their processes just by sketching them as kinds of flow graphs without caring about types, precise knowledge about the available process components or the availability of resources. they only have to specify the rough process flow graphically in terms of ontologically defined 'semantic' entities. these loose specifications are then concretized to fully executable process code automatically by means of a combination of 1) data-flow analysis, ensuring the availability of the required resources, 2) temporal logic-based process synthesis, resolving type conflicts and taking care of correct component instantiation, and 3) model checking, to ensure global intents and invariants expressed in temporal logic.

关键词： application-specific processes data flow analysis data flow analysis data-flow analysis flow graphs graphical formalism intuitive style loose specification loose specification model checking process developers software engineering synthesis synthesis based loose programming temporal logic-based process synthesis

来源：评论

学校读者我要写书评

暂无评论

the Gentle Art of Levitation

The Gentle Art of Levitation

引用

15th ACM SIGPLAN international conference on Functional programming

作者： Chapman, James Dagand, Pierre-Evariste McBride, Conor Morris, Peter Tallinn Univ Technol Inst Cybernet Tallinn Estonia Univ Strathclyde Glasgow G1 1XQ Lanark Scotland Univ Nottingham Nottingham NG7 2RD England

ISBN: (纸本)9781605587943

We present a closed dependent type theory whose inductive types are given not by a scheme for generative declarations, but by encoding in a universe. Each inductive datatype arises by interpreting its description-a first-class value in a datatype of descriptions. Moreover, the latter itself has a description. Datatype-generic programming thus becomes ordinary programming. We show some of the resulting generic operations and deploy them in particular, useful ways on the datatype of datatype descriptions itself. Simulations in existing systems suggest that this apparently self-supporting setup is achievable without paradox or infinite regress.

关键词： Design Languages theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：