Titlebook: Generative Programming and Component Engineering; ACM SIGPLAN/SIGSOFT Don Batory,Charles Consel,Walid Taha Conference proceedings 2002 Spr

胎兒

Program Generation, Termination, and Binding-Time Analysisility. However, several interesting and challenging problems remain to be solved before it becomes a reality. Solving them is also ., if we hope ever to elevate software engineering from its current state (a highly-developed handiwork) into a successful branch of engineering, capable of solving a wi

conception

宇宙你

Self Reflection for Adaptive Programmingric types often do not provide the required flexibility, which can be achieved with the use of metadata attached or extracted from objects by means of reflection. We present a general mechanism to support reflection in C++, exploiting template metaprogramming techniques. Metaclass objects are presen

爭論

DataScript- A Specification and Scripting Language for Binary Dataion language that uses DataScript types to describe the physical layout of data and a language binding that provides a simple programming interface to script binary data. A DataScript compiler generates Java libraries that are linked with DataScript scripts..DataScript specifications can be used to

Anticoagulant

去才蔑視

A Protocol Stack Development Tool Using Generative Programmingthey are usually not very good at capturing the behavioral aspects. Two important implementation problems result, namely, reprogramming similar behavior and configuration of crosscutting concerns. In this paper, we present an approach to solve the problems of reprogramming similar behavior and absen

BORE

失眠癥

Architectural Refactoring in Framework Evolution: A Case Studye management systems is being developed as a case study for the methodology research. The methodology revolves around a set of models for the domain, the functionality, the architecture, the design, and the code. These models reflect the common and variable features of the domain..Refactoring of sou

Exaggerate

Towards a Modular Program Derivation via Fusion and Tuplingediate data structures (fusion) followed by the elimination of redundant calls (tupling), we systematically realise both space and time efficient algorithms from naive specifications. We illustrate our approach using a well-known maximum segment sum (MSS) problem, and a less-known maximum segment pr

爭議的蘋果

Generative Programming for Embedded Software: An Industrial Experience Reportized to fit its limited memory and computing power. Generative programming is well suited for developing embedded software since it allows us to automatically produce variants of embedded software optimized for specific products. This paper reports on our experience in applying generative programmin