A first course in computability
A first course in computability
Building an object-oriented database system: the story of 02
Building an object-oriented database system: the story of 02
Version models for software configuration management
ACM Computing Surveys (CSUR)
Foundation for object/relational databases: the third manifesto
Foundation for object/relational databases: the third manifesto
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Software configuration management: a roadmap
Proceedings of the Conference on The Future of Software Engineering
Comparative analysis of six XML schema languages
ACM SIGMOD Record
MSL — a model for W3C XML schema
Proceedings of the 10th international conference on World Wide Web
xlinkit: a consistency checking and smart link generation service
ACM Transactions on Internet Technology (TOIT)
Introduction to the Theory of Computation
Introduction to the Theory of Computation
A Guided Tour of Relational Databases and Beyond
A Guided Tour of Relational Databases and Beyond
Database Systems Concepts
Implementing Lazy Database Updates for an Object Database System
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Consistency Checking of Financial Derivatives Transactions
NODe '02 Revised Papers from the International Conference NetObjectDays on Objects, Components, Architectures, Services, and Applications for a Networked World
Consistency management with repair actions
Proceedings of the 25th International Conference on Software Engineering
Hi-index | 0.00 |
Individual organisations as well as industry consortia are currently defining application and domain-specific languages using the eXtended Markup Language (XML) standard of the World Wide Web Consortium (W3C). The paper shows that XML languages differ in significant aspects from generic software engineering artifacts and that they therefore require a specific approach to version and configuration management. When an XML language evolves, consistency between the language and its instance documents needs to be preserved in addition to the internal consistency of the language itself. We propose a definition for compatibility between versions of XML languages that takes this additional need into account. Compatibility between XML languages in general is undecidable. We argue that the problem can become tractable using heuristic methods if the two languages are related in a version history. We propose to evaluate the method by using different versions of the Financial products Markup Language (FpML), in the definition of which we participate.