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

Reflective Constraint Writing A Symbolic Viewpoint of Modeling Languages 25th

25th International Conference on Database and Expert Systems Applications (DEXA)

作者： Draheim, Dirk Univ Innsbruck Innsbruck Austria

ISBN: (纸本)9783662492147;9783662492130

In this article we show how to extend object constraint languages by reflection. We choose OCL (Object Constraint Language) and extend it by operators for reification and reflection. We show how to give precise semantics to the extended language OCLR by elaborating the necessary type derivation rules and value specifications. A driving force for the introduction of reflection capabilities into a constraint language is the investigation of semantics and pragmatics of modeling constructs. We exploit the resulting reflective constraint language in modeling domains including sets of sets of domain objects. We give precise semantics to UML power types. We carve out the notion of sustainable constraint writing which is about making models robust against unwanted updates. Reflective constraints are an enabler for sustainable constraint writing. We discuss the potential of sustainable constraint writing for emerging tools and technologies. For this purpose, we need to introduce a symbolic viewpoint of information system modeling.

关键词： Meta modeling Multi-level modeling Object constraint languages generative programming Database migration Schema evolution clabjects Modeling tools UML OCL Z GENOUPE

来源：评论

学校读者我要写书评

暂无评论

Feature Reuse Across Software Releases During Software Evolution 20

Feature Reuse Across Software Releases During Software Evolu...

引用

20th International Conference on New Trends in Intelligent Software Methodologies, Tools and Techniques (SoMeT)

作者： Boldak, Cezary Jarzabek, Stanislaw Seow, Junling Bialystok Tech Univ Fac Comp Sci Wiejska 45A PL-15351 Bialystok Poland Natl Univ Singapore Dept Comp Sci Singapore Singapore

ISBN: (纸本)9781643681955;9781643681948

Software evolution relies on storing component versions along with delta-changes in a repository of a version control tool such a centralized CVS in old days, or decentralized Git today. Code implementing various software features (e.g., requirements) often spreads over multiple software components, and across multiple versions of those components. Not having a clear picture of feature implementation and evolution may hinder software reuse which most often is concerned with feature reuse across system releases, and components are just means to that end. Much research on feature location shows how important and difficult is to find feature-related code buried in program components post mortem. We propose to avoid creating the problem in the first place, by explicating feature-related code in component versions at the time of their implementation. To do that, we complement traditional version control approach with generative mechanisms. We describe salient features of such an approach realized in ART (Adaptive Reuse Technology, http://***), and explain its role in easing comprehending software evolution and feature reuse. Advanced commercial version control tools make a step towards easing the evolution problems addressed in this paper. Our approach is an alternative way of addressing the same problem on quite a different ground.

关键词： Software evolution software configuration management generative programming software reuse

来源：评论

学校读者我要写书评

暂无评论

An Automated Approach to Generating Efficient Constraint Solvers

An Automated Approach to Generating Efficient Constraint Sol...

引用

34th International Conference on Software Engineering (ICSE)

作者： Balasubramaniam, Dharini Jefferson, Christopher Kotthoff, Lars Miguel, Ian Nightingale, Peter Univ St Andrews Sch Comp Sci St Andrews Fife Scotland

ISBN: (纸本)9781467310673

Combinatorial problems appear in numerous settings, from timetabling to industrial design. Constraint solving aims to find solutions to such problems efficiently and automatically. Current constraint solvers are monolithic in design, accepting a broad range of problems. The cost of this convenience is a complex architecture, inhibiting efficiency, extensibility and scalability. Solver components are also tightly coupled with complex restrictions on their configuration, making automated generation of solvers difficult. We describe a novel, automated, model-driven approach to generating efficient solvers tailored to individual problems and present some results from applying the approach. The main contribution of this work is a solver generation framework called Dominion, which analyses a problem and, based on its characteristics, generates a solver using components chosen from a library. The key benefit of this approach is the ability to solve larger and more difficult problems as a result of applying finer-grained optimisations and using specialised techniques as required.

关键词： generative programming constraint solvers software architecture model-driven development

来源：评论

学校读者我要写书评

暂无评论

Let's modularize the data model specifications of the ObjectLens in VisualWorks/Smalltalk

Let's modularize the data model specifications of the Object...

引用

14th International Smalltalk Conference

作者： Prasse, Michael Collogia Unternehmungsberatung AG D-50678 Cologne Germany

ISBN: (纸本)9783540718352

The ObjectLens framework of VisualWorks maps objects to tables. This mapping is described in a data mapping model, which itself is specified in one dataModelSpec method. This method is monolithic and defines the whole data model of an application. This is a suitable approach to start with. However, when the business area extends to a set of similar applications, like a software product family, each of these applications needs its own data model specification. All specifications of the product family would be quite similar but there is no appropriate reuse-mechanism, which could be used. Consequently, the monolithic design specifications lead to a high degree of redundancy, which complicates software development and maintenance. Therefore, this paper describes an approach, which leads to a separation of the monolithic data model specifications. The main idea is to define the mappings of each class in the class itself using inheritance and generate the whole specification from a list of single class data models. In this way, declarative and generative programming techniques are combined.

关键词： ObjectLens smalltalk VisualWorks design pattern software product families OR-mapping generative programming

来源：评论

学校读者我要写书评

暂无评论

Compilation and Code Optimization for Data Analytics

Compilation and Code Optimization for Data Analytics

引用

作者： Amir SHAIKHHA ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE

学位级别：博士

The trade-offs between the use of modern high-level and low-level programming languages in constructing complex software artifacts are well known. High-level languages allow for greater programmer productivity: abstraction and genericity allow for the same functionality to be implemented with significantly less code compared to low-level languages. Modularity, object-orientation, functional programming, and powerful type systems allow programmers not only to create clean abstractions and protect them from leaking, but also to define code units that are reusable and easily composable, and software architectures that are adaptable and extensible. The abstraction, succinctness, and modularity of high-level code help to avoid software bugs and facilitate debugging and maintenance. The use of high-level languages comes at a performance cost: increased indirection due to abstraction, virtualization, and interpretation, and superfluous work, particularly in the form of tempory memory allocation and deallocation to support objects and encapsulation. As a result of this, the cost of high-level languages for performance-critical systems may seem prohibitive. The vision of abstraction without regret argues that it is possible to use high-level languages for building performance-critical systems that allow for both productivity and high perfor- mance, instead of trading off the former for the latter. In this thesis, we realize this vision for building different types of data analytics systems. Our means of achieving this is by employing compilation. The goal is to compile away expensive language features – to compile high-level code down to efficient low-level code.

关键词： High-level programming languages Domain-specific languages Program synthesis Query processing generative programming Optimizing compilers Abstraction without regret Database optimization Data analytics

来源：评论

学校读者我要写书评

暂无评论

Program Analysis and Compilation Techniques for Speeding up Transactional Database Workloads

Program Analysis and Compilation Techniques for Speeding up ...

引用

作者： Mohammad DASHTI RAHMAT ABADI ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE

学位级别：博士

There is a trend towards increased specialization of data management software for perfor- mance reasons. The improved performance not only leads to a more efficient usage of the underlying hardware and cuts the operation costs of the system, but also is a game-changing competitive advantage for many emerging application domains such as high-frequency algo- rithmic trading, clickstream analysis, infrastructure monitoring, fraud detection, and online advertising to name a few. In this thesis, we study the automatic specialization and optimization of database appli- cation programs – sequences of queries and updates, augmented with control flow constructs as they appear in database scripts, user-defined functions (UDFs), transactional workloads and triggers in languages such as PL/SQL. We propose to build online transaction processing (OLTP) systems around a modern compiler infrastructure. We show how to build an optimizing compiler for transaction programs using generative programming and state-of-the-art com- piler technology, and present techniques for aggressive code inlining, fusion, deforestation, and data structure specialization in the domain of relational transaction programs. We also identify and explore the key optimizations that can be applied in this domain. In addition, we study the advantage of using program dependency analysis and restructuring to enable the concurrency control algorithms to achieve higher performance. Traditionally, optimistic concurrency control algorithms, such as optimistic Multi-Version Concurrency Control (MVCC), avoid blocking concurrent transactions at the cost of having a validation phase. Upon failure in the validation phase, the transaction is usually aborted and restarted from scratch. The "abort and restart" approach becomes a performance bottleneck for use cases with high contention objects or long running transactions. In addition, restarting from scratch creates a negative feedback loop in the system, because the system

关键词： transaction processing program analysis compilation techniques transaction repair generative programming program optimization functional programming compiler staging data structure specialization deforestation partial evaluation

来源：评论

学校读者我要写书评

暂无评论

A generative framework for managed services

引用

3rd International Conference on generative programming and Component Engineering

作者： Peyton, L Rajwani, A Univ Ottawa Sch Informat Technol & Engn Ottawa ON K1N 6N5 Canada

ISBN: (纸本)3540235809

We identify a special category of applications that manage delivery of services by reporting and configuring services based on data collected in the delivery of services. Managed delivery has typically been an aspect of software systems entangled in domain specific application logic. generative approaches, and in particular domain specific languages, have attempted to release application logic from such aspects. We demonstrate that such aspects can be considered applications in their own right. For managed delivery of services, key elements of a generative approach are the domain specialist, reports, metrics, data model, configuration parameters, rules, and template-based generation.

关键词： generative programming templates rules data model metrics managed services

来源：评论

学校读者我要写书评

暂无评论

Functional Pearl: A SQL to C Compiler in 500 Lines of Code 2015

Functional Pearl: A SQL to C Compiler in 500 Lines of Code

引用

20th ACM SIGPLAN International Conference on Functional programming (ICFP)

作者： Rompf, Tiark Amin, Nada Ecole Polytech Fed Lausanne Lausanne Switzerland

ISBN: (纸本)9781450336697

We present the design and implementation of a SQL query processor that outperforms existing database systems and is written in just about 500 lines of Scala code - a convincing case study that high-level functional programming can handily beat C for systems-level programming where the last drop of performance matters. The key enabler is a shift in perspective towards generative programming. The core of the query engine is an interpreter for relational algebra operations, written in Scala. Using the open-source LMS Framework (Lightweight Modular Staging), we turn this interpreter into a query compiler with very low effort. To do so, we capitalize on an old and widely known result from partial evaluation known as Futamura projections, which state that a program that can specialize an interpreter to any given input program is equivalent to a compiler. In this pearl, we discuss LMS programming patterns such as mixed-stage data structures (e.g. data records with static schema and dynamic field components) and techniques to generate low-level C code, including specialized data structures and data loading primitives.

关键词： SQL Query Compilation Staging generative programming Futamura Projections

来源：评论

学校读者我要写书评

暂无评论

An Extensible Framework for Annotation-based Parameter Passing in Distributed Object Systems

An Extensible Framework for Annotation-based Parameter Passi...

引用

作者： Gopal, Sriram Virginia Tech | University

Modern distributed object systems pass remote parameters based on their runtime type. This design choice limits the expressiveness, readability, and maintainability of distributed applications. While a rich body of research is concerned with middleware extensibility, modern distributed object systems do not offer programming facilities to extend their remote parameter passing semantics. Thus, extending these semantics requires understanding and modifying the underlying middleware implementation. This thesis addresses these design shortcomings by presenting (i) a declarative and extensible approach to remote parameter passing that decouples parameter passing from parameter types, and (ii) a plugin-based framework, DeXteR, that enables the programmer to extend the native set of remote parameter passing semantics, without having to understand or modify the underlying middleware implementation. DeXteR treats remote parameter passing as a distributed cross-cutting concern. It uses generative and aspect-oriented techniques, enabling the implementation of different parameter passing semantics as reusable application-level plugins that work with application, system, and third-party library classes. The flexibility and expressiveness of the framework is validated by implementing several non-trivial parameter passing semantics as DeXteR plugins. The material presented in this thesis has been accepted for publication at the ACM/USENIX Middleware 2008 conference.

关键词： Declarative programming Extensible Middleware Metadata Aspect Oriented programming (AOP) generative programming Thesis

来源：评论

学校读者我要写书评

暂无评论

Orchestrating Masses of Sensors: A Design-Driven Development Approach

引用

ACM SIGPLAN NOTICES 2016年第3期51卷 117-120页

作者： Kabac, Milan Consel, Charles Inria Bordeaux Bordeaux France Univ Bordeaux Bordeaux France

This paper proposes a design-driven development approach that is dedicated to the domain of orchestration of masses of sensors. The developer declares what an application does using a domain specific language (DSL). Our compiler processes domain-specific declarations to generate a customized programming framework that guides and supports the programming phase.

关键词： generative programming domain-specific languages programming frameworks sensors pervasive computing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：