Results 1 -
2 of
2
Exploiting Agents and Ontologies for Type- and Meaning-Safe Adaptation of Java Programs
"... Abstract—This paper discusses an application of intelligent software agents and ontologies to solve the problem of semiautomatic porting of Java programs. We have designed a system for aiding users to adapt Java code in a type- and meaning-safe way, when an application has to migrate to new librarie ..."
Abstract
- Add to MetaCart
Abstract—This paper discusses an application of intelligent software agents and ontologies to solve the problem of semiautomatic porting of Java programs. We have designed a system for aiding users to adapt Java code in a type- and meaning-safe way, when an application has to migrate to new libraries which are not fully compatible with the legacy ones. To achieve this, we propose an approach based on an integration of the two type-theoretic notions of subtyping and type isomorphism with ontology matching. While the former notions are needed to ensure flexible adaptation in the presence of typesafety, the latter supports the user to preserve the meaning of names that appear in the program to be adapted. Intelligent agents control the different components of the system and interact with other agents in order to provide the final user with the semi-automatic porting service he/she required. I.
Languages
"... In the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings, i.e., mappings that fail in matching the source and/or the target schema, is crucial. Corruption ..."
Abstract
- Add to MetaCart
In the contexts of data integration and data exchange, schema mappings are primarily used for query answering. As a consequence, their maintenance and, in particular, the detection of corrupted mappings, i.e., mappings that fail in matching the source and/or the target schema, is crucial. Corruption checking can be automatically performed by relying on an operation called type projection. This work describes an efficient algorithm for checking XML type projection, based on a characterization of type projection in terms of type simulation.

