Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called view. The corresponding backward tran...
详细信息
ISBN:
(纸本)9781595938152
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called view. The corresponding backward transformation reflects changes in the view to the source. Its practically useful applications include replicated data synchronization, presentation-oriented editor development, tracing software development, and view updating in the database community. However, developing a bidirectional transformation is hard, because one has to give two mappings that satisfy the bidirectional properties for system consistency. In this paper, we propose a new framework for bidirectionalization that can automatically generate a useful backward transformation from a view function while guaranteeing that the two transformations satisfy the bidirectional properties. Our framework is based on two known approaches to bidirectionalization, namely the constant complement approach from the database community and the combinator approach from the programming language community, but it has three new features: ( 1) unlike the constant complement approach, it can deal with transformations between algebraic data structures rather than just tables;( 2) unlike the combinator approach, in which primitive bidirectional transformations have to be explicitly given, it can derive them automatically;( 3) it generates a view update checker to validate updates on views, which has not been well addressed so far. The new framework has been implemented and the experimental results show that our framework has promise.
These proceedings contain the papers presented at the 12th Annual Genetic and Evolutionary Computation Conference (GECCO-2010), held in Portland, USA, July 7-11, 2010. This year, we received 373 submissions, of which ...
详细信息
Over the last ten years, there has been a significant change in computing. After reaching the physical limits in integrated circuit technology, Moore's law (predicting an exponential growth of computing capacity o...
详细信息
ISBN:
(纸本)9781538678794
Over the last ten years, there has been a significant change in computing. After reaching the physical limits in integrated circuit technology, Moore's law (predicting an exponential growth of computing capacity over the years) has been maintained thanks to the replication of computing components (i.e., parallelization). Current computers now incorporate multiple processors, which are themselves multi-core, and come with technologies to increase the parallel capabilities of processors, like the Intel hyper-threading technology that implements two logical processors per core. This is the architecture present not only in today's servers or workstations, but also in portable and mobile devices as laptops, tablets, or mobile phones. It is accepted that this trend towards more and more parallel architectures will be maintained in the coming years.
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called view. The corresponding backward tran...
详细信息
Bidirectional transformation is a pair of transformations: a view function and a backward transformation. A view function maps one data structure called source onto another called view. The corresponding backward transformation reflects changes in the view to the source. Its practically useful applications include replicated data synchronization, presentation-oriented editor development, tracing software development, and view updating in the database community. However, developing a bidirectional transformation is hard, because one has to give two mappings that satisfy the bidirectional properties for system consistency. In this paper, we propose a new framework for bidirectionalization that can automatically generate a useful backward transformation from a view function while guaranteeing that the two transformations satisfy the bidirectional properties. Our framework is based on two known approaches to bidirectionalization, namely the constant complement approach from the database community and the combinator approach from the programming language community, but it has three new features: ( 1) unlike the constant complement approach, it can deal with transformations between algebraic data structures rather than just tables;( 2) unlike the combinator approach, in which primitive bidirectional transformations have to be explicitly given, it can derive them automatically;( 3) it generates a view update checker to validate updates on views, which has not been well addressed so far. The new framework has been implemented and the experimental results show that our framework has promise.
In this paper we present a new method that uses data-flow coherence constraints in definite logic programgeneration. We outline three main advantages of these constraints supported by our results: i) drastically prun...
详细信息
In this paper we present a new method that uses data-flow coherence constraints in definite logic programgeneration. We outline three main advantages of these constraints supported by our results: i) drastically pruning the search space (around 90%), ii) reducing the set of positive examples and reducing or even removing the need for the set of negative examples, and iii) allowing the induction of predicates that are difficult or even impossible to generate by other methods. Besides these constraints, the approach takes into consideration the program termination condition for recursive predicates. The paper outlines some theoretical issues and implementation aspects of our system for automatic logic program induction.
The convenience of considering industrial software systems as program families rather than unique programs is argued. Conventional computer aided program manufacturing methods are then discussed and some of their prob...
详细信息
The convenience of considering industrial software systems as program families rather than unique programs is argued. Conventional computer aided program manufacturing methods are then discussed and some of their problems are analysed. The paper shows how these problems may be essentially solved by conceiving, implementing and manufacturing programs as hierarchies of Multifunctional Modules or Abstract Data Types. It may be specially useful for applications where data amount and complexity are important.
Discusses the use of decision tables in solving large scale programming problems. Construction of an application program through the selection of certain source statements from a predefined file; Ideas behind the othe...
详细信息
Discusses the use of decision tables in solving large scale programming problems. Construction of an application program through the selection of certain source statements from a predefined file; Ideas behind the other historical approaches of solving programming problems.
A computer program to generate are welding robot program code from an input of part geometry and weld-description CAD-data and additional rules and parameters was developed for an Austrian manufacturer structural stee...
详细信息
A computer program to generate are welding robot program code from an input of part geometry and weld-description CAD-data and additional rules and parameters was developed for an Austrian manufacturer structural steel work. The system is needed because a large variety of products has to be manufactured in small batches, so that on-line programming (teach-in) becomes a serious cost factor and limits the throughput.
A key issue when using distributed computing environments is finding a planning strategy to execute tasks in order to use the computational resources efficiently. This article presents the application of Virtual Savan...
详细信息
ISBN:
(纸本)9781538678800
A key issue when using distributed computing environments is finding a planning strategy to execute tasks in order to use the computational resources efficiently. This article presents the application of Virtual Savant to solve the heterogeneous computing scheduling problem, a widely-studied problem with several real-world applications. Virtual Savant is a novel method that uses machine learning techniques to automatically generate programs that can be executed in parallel to solve a given problem. Experimental analysis is performed on a set of problem instances generated following methodologies from the related literature. Results show that Virtual Savant is able to outperform MinMin, a well-known heuristic for the studied problem, by up to 15% while showing good scalability properties when increasing the number of computing resources and the dimension of the problem instances.
Abstract: The issues of the automatic computations distributing in the translation of the NORMA language programs are considered in this paper. The load balancing between the nodes in multi node computer system is out...
详细信息
暂无评论