Aspects dynamiques de XML et spécification des interfaces de services web avec PEWS. (Dynamic aspects of XML and web service interface specification with PEWS)

Nous nous interessons par le probleme de la semantique des mises a jour et de la coherence des bases de donnees dans differents contextes comme les documents XML et les services web. En effet, des difficultes particulieres sont a prevoir lors de la mise a jour d'une base ayant des contraintes a respecter, car, des donnees originalement coherentes par rapport aux contraintes peuvent devenir incoherentes suite aux mises a jour. Dans une premiere partie de notre travail, nous considerons la mise a jour et le maintien de la coherence d'une base de donnees XML par rapport au type (ou schema) ainsi que par rapport aux contraintes d'integrite. Nous abordons ce probleme de differentes manieres. Tout d'abord, nous proposons une procedure de validation incrementale par rapport aux contraintes, evitant de revalider les parties du document qui n'ont pas ete touchees par les mises a jour. Cette approche traite aussi bien le cas des contraintes de schema que le cas des contraintes d'integrite. Dans ce cadre, les listes de mises a jour qui violent la validite sont rejetees. Quand la validation incrementale echoue, c'est-a-dire, quand une mise a jour viole le type, deux propositions de traitement sont faites\,: (A) Une routine de correction est activee pour adapter le document XML au type tout en prenant en compte la mise a jour. La mise a jour a donc une priorite par rapport aux donnees deja stockees. (B) Une routine propose une adaptation du type du document, de facon a accepter le document mis a jour en preservant la validite des autres documents originalement valides et non soumis a la mise a jour. Dans ce cas, la mise a jour est prioritaire et les contraintes peuvent etre modifiees. Une deuxieme partie du travail considere la construction d'une plate-forme d'aide a la specification, a l'implementation et a la manipulation de services. L'idee de pouvoir specifier et modifier des compositions de services nous a amene a la definition du langage PEWS (\textit{Path Expressions for Web Services}), ayant une semantique formelle bien definie et permettant la specification du comportement des interfaces des services web simples ou composes. Pour pouvoir tester statiquement des proprietes liees a la composition des services, nous proposons l'utilisation de la theorie des traces et les graphes de dependances.

[1]  Nicolas Spyratos,et al.  Update Rules in Datalog Programs , 1998, J. Log. Comput..

[2]  Ronald Fagin,et al.  Armstrong Databases for Functional and Inclusion Dependencies , 1983, Inf. Process. Lett..

[3]  Kaizhong Zhang,et al.  Simple Fast Algorithms for the Editing Distance Between Trees and Related Problems , 1989, SIAM J. Comput..

[4]  W.M.P. van der Aalst,et al.  Analyzing BPEL processes using Petri nets , 2005 .

[5]  Wenfei Fan,et al.  Consistency of XML Specifications , 2005, Inconsistency Tolerance.

[6]  Xiang Fu,et al.  Conversation specification: a new approach to design and analysis of e-service composition , 2003, WWW '03.

[7]  Giovanna Guerrini,et al.  Impact of XML schema evolution on valid documents , 2005, WIDM '05.

[8]  Georg Gottlob,et al.  Conjunctive queries over trees , 2004, JACM.

[9]  Béatrice Bouchou-Markhoff,et al.  Conservative extensions of regular languages , 2004, XXIV International Conference of the Chilean Computer Science Society.

[10]  Sten F. Andler,et al.  Predicate path expressions , 1979, POPL.

[11]  Michael Benedikt,et al.  Adding Updates to XQuery: Semantics, Optimization, and Static Analysis , 2005, XIME-P.

[12]  Jan Chomicki,et al.  History-less checking of dynamic integrity constraints , 1992, [1992] Eighth International Conference on Data Engineering.

[13]  Christopher Ré,et al.  XQuery!: An XML Query Language with Side Effects , 2006, EDBT Workshops.

[14]  Marcelo Arenas,et al.  A normal form for XML documents , 2004, TODS.

[15]  Wenfei Fan,et al.  Reasoning about keys for XML , 2003, Inf. Syst..

[16]  Susan B. Davidson,et al.  Validating Constraints in XML , 2002 .

[17]  Béatrice Bouchou-Markhoff,et al.  Extending Tree Automata to Model XML Validation Under Element and Attribute Constraints , 2003, ICEIS.

[18]  J. Hopcroft,et al.  Reasoning about Xml Schema Languages Using Formal Language Theory , 2000 .

[19]  Denis Lugiez,et al.  XML schema, tree logic and sheaves automata , 2003, Applicable Algebra in Engineering, Communication and Computing.

[20]  David H. Akehurst,et al.  Validating BPEL Specifications using OCL , 2004 .

[21]  Gabriel M. Kuper,et al.  Structural properties of XPath fragments , 2003, Theor. Comput. Sci..

[22]  Masako Takahashi,et al.  Generalizations of Regular Sets and Their Applicatin to a Study of Context-Free Languages , 1975, Inf. Control..

[23]  Piergiorgio Bertoli,et al.  Planning and Monitoring Web Service Composition , 2004, AIMSA.

[24]  Derick Wood,et al.  Regular Tree Languages Over Non-Ranked Alphabets , 1998 .

[25]  Frank Neven,et al.  DTDs versus XML schema: a practical study , 2004, WebDB '04.

[26]  Wenfei Fan,et al.  Integrity constraints for XML , 2000, PODS.

[27]  Murali Mani,et al.  Taxonomy of XML schema languages using formal language theory , 2005, TOIT.

[28]  Denio Duarte Une méthode pour l'évolution des schémas XML préservant la validité des documents , 2005 .

[29]  James W. Thatcher,et al.  Generalized finite automata theory with an application to a decision problem of second-order logic , 1968, Mathematical systems theory.

[30]  Béatrice Bouchou-Markhoff,et al.  Updates and Incremental Validation of XML Documents , 2003, DBPL.

[31]  Béatrice Bouchou-Markhoff,et al.  Incremental string correction: Towards correction of XML documents , 2005, Stringology.

[32]  Djelloul Ziadi,et al.  Passage d'une expression rationnelle à un automate fini non-déterministe , 1997 .

[33]  Béatrice Bouchou-Markhoff,et al.  Incremental Constraint Checking for XML Documents , 2004, XSym.

[34]  Boi Faltings,et al.  Large scale, type-compatible service composition , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[35]  Mirian Halfeld Ferrari Alves,et al.  Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator) , 2007, J. Algorithms.

[36]  Maarten Marx,et al.  Conditional XPath, the first order complete XPath dialect , 2004, PODS.

[37]  Denis Debarbieux,et al.  Modélisation et requêtes des documents semi-structurés : exploitation de la structure de graphe. (Using Graph Structure for XML querying) , 2005 .

[38]  Wing Lok Yeung,et al.  Mapping WS-CDL and BPEL into CSP for Behavioural Specification and Verification of Web Services , 2006, 2006 European Conference on Web Services (ECOWS'06).

[39]  Derick Wood,et al.  Regular tree and regular hedge languages over unranked alphabets , 2001 .

[40]  Gabriel M. Kuper,et al.  Updating Logical Databases , 1986, Adv. Comput. Res..

[41]  Georg Gottlob,et al.  Monadic datalog and the expressive power of languages for web information extraction , 2002, JACM.

[42]  Elke A. Rundensteiner,et al.  Automating the transformation of XML documents , 2001, WIDM '01.

[43]  Gottfried Vossen,et al.  Monotonic complements for independent data warehouses , 2001, The VLDB Journal.

[44]  Raman Kazhamiakin,et al.  Static Verification of Control and Data inWeb Service Compositions , 2006, 2006 IEEE International Conference on Web Services (ICWS'06).

[45]  Xiang Fu,et al.  Realizability of conversation protocols with message contents , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[46]  Martin A. Musicante,et al.  Extending an XML Type using Updated Data , 2009 .

[47]  Cheikh Ba,et al.  Composing Web Services with PEWS: A Trace-Theoretical Approach , 2006, 2006 European Conference on Web Services (ECOWS'06).

[48]  Ahmed Cheriat Une Méthode de correction de la structure de documents XML dans le cadre d'une validation incrémentale , 2006 .

[49]  Georg Gottlob,et al.  The complexity of XPath query evaluation , 2003, PODS.

[50]  Albert R. Meyer,et al.  Cosmological lower bound on the circuit complexity of a small problem in logic , 2002, JACM.

[51]  Martin Grohe,et al.  The complexity of first-order and monadic second-order logic revisited , 2004, Ann. Pure Appl. Log..

[52]  Sébastien Limet,et al.  Tree Tuple Languages from the Logic Programming Point of View , 2006, Journal of Automated Reasoning.

[53]  Martti Penttonen,et al.  Towards automating of document structure transformations , 2002, DocEng '02.

[54]  Antoni W. Mazurkiewicz,et al.  Introduction to Trace Theory , 1995, The Book of Traces.

[55]  Miroslaw Malek,et al.  Current solutions for Web service composition , 2004, IEEE Internet Computing.

[56]  Thomas Schwentick,et al.  Numerical document queries , 2003, PODS.

[57]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[58]  Mark Levene,et al.  A guided tour of relational databases and beyond , 1999 .

[59]  Jianwen Su,et al.  E-services: a look behind the curtain , 2003, PODS.

[60]  Dan Suciu,et al.  Data on the Web: From Relations to Semistructured Data and XML , 1999 .

[61]  Derick Wood,et al.  One-Unambiguous Regular Languages , 1998, Inf. Comput..

[62]  Boualem Benatallah,et al.  A Petri Net-based Model for Web Service Composition , 2003, ADC.

[63]  M. de Rijke,et al.  Semantic characterizations of navigational XPath , 2005, SGMD.

[64]  Mirian Halfeld Ferrari Alves,et al.  Efficient maintenance of temporal data warehouses , 2000, Proceedings 2000 International Database Engineering and Applications Symposium (Cat. No.PR00789).

[65]  Chengfei Liu,et al.  Functional Dependencies, from Relational to XML , 2003, Ershov Memorial Conference.

[66]  Mírian Halfeld Ferrari Alves Règles pour les mises a jour des bases de données déductives , 1996 .

[67]  Annapaola Marconi,et al.  Automated synthesis of composite BPEL4WS Web services , 2005, IEEE International Conference on Web Services (ICWS'05).

[68]  Béatrice Bouchou-Markhoff,et al.  Contraintes d'intégrité pour XML. Visite guidée par une syntaxe homogène , 2009, Tech. Sci. Informatiques.

[69]  Stanley M. Selkow,et al.  The Tree-to-Tree Editing Problem , 1977, Inf. Process. Lett..

[70]  J. Büchi Weak Second‐Order Arithmetic and Finite Automata , 1960 .

[71]  Mirian Halfeld Ferrari Alves,et al.  Incremental Maintenance of Data Warehouses Based on Past Temporal Logic Operators , 2004, J. Univers. Comput. Sci..

[72]  James W. Thatcher,et al.  Characterizing Derivation Trees of Context-Free Grammars through a Generalization of Finite Automata Theory , 1967, J. Comput. Syst. Sci..

[73]  Daniela Berardi,et al.  Automatic Composition of e-Services , 2003 .

[74]  Gwen Salaün,et al.  Describing and reasoning on Web services using process algebra , 2004, Proceedings. IEEE International Conference on Web Services, 2004..

[75]  Cheikh Ba,et al.  PEWS: A New Language for Building Web Service Interfaces , 2005, J. Univers. Comput. Sci..

[76]  Béatrice Bouchou-Markhoff,et al.  Integrating Correction into Incremental Validation , 2006, BDA.

[77]  Giuseppe Castagna,et al.  Type-based XML projection , 2006, VLDB.

[78]  Leonid Libkin,et al.  Logics for Unranked Trees: An Overview , 2005, Log. Methods Comput. Sci..

[79]  S. Krishnan,et al.  2 XLANG : Web Services for Business Process Design , 2002 .

[80]  Thomas Schwentick,et al.  XML: Model, Schemas, Types, Logics, and Queries , 2003, Logics for Emerging Applications of Databases.

[81]  Cheikh Ba,et al.  Dependence graphs for verifications of web service compositions with PEWS , 2008, SAC '08.

[82]  Junhu Wang,et al.  Removing XML Data Redundancies Using Functional and Equality-Generating Dependencies , 2005, ADC.

[83]  Gabriel M. Kuper,et al.  A unified constraint model for XML , 2001, WWW '01.

[84]  Béatrice Bouchou-Markhoff,et al.  Schema Evolution for XML: A Consistency-Preserving Approach , 2004, MFCS.

[85]  Wolfgang Thomas,et al.  Automata on Infinite Objects , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.

[86]  Wolfgang Thomas,et al.  Languages, Automata, and Logic , 1997, Handbook of Formal Languages.

[87]  Ahmed Cheriat,et al.  Efficient Constraint Validation for Updated XML Databases , 2007 .

[88]  Hussein Zedan,et al.  Augmenting semantic web service descriptions with compositional specification , 2004, WWW '04.

[89]  John Doner,et al.  Tree Acceptors and Some of Their Applications , 1970, J. Comput. Syst. Sci..

[90]  Tok Wang Ling,et al.  Designing Functional Dependencies for XML , 2002, EDBT.

[91]  Wenfei Fan,et al.  On verifying consistency of XML specifications , 2002, PODS.

[92]  Béatrice Bouchou-Markhoff,et al.  XML Document Correction: Incremental Approach Activated by Schema Validation , 2006, 2006 10th International Database Engineering and Applications Symposium (IDEAS'06).

[93]  Michael Schrefl,et al.  Generalized Inclusion Dependencies in XML , 2004, APWeb.

[94]  Chengfei Liu,et al.  Strong functional dependencies and their application to normal forms in XML , 2004, TODS.

[95]  Pascal Caron,et al.  Characterization of Glushkov automata , 2000, Theor. Comput. Sci..

[96]  Matjaz B. Juric,et al.  Business process execution language for web services , 2004 .

[97]  Martin A. Musicante,et al.  Expressing Workflow Patterns for Web Services: The Case of PEWS , 2006, J. Univers. Comput. Sci..

[98]  Wenfei Fan,et al.  XML constraints: specification, analysis, and applications , 2005, 16th International Workshop on Database and Expert Systems Applications (DEXA'05).

[99]  Michael A. Bodie The Book of Sax: The Simple API for XML , 2002 .

[100]  Richard J. Lipton,et al.  On the complexity of intersecting finite state automata , 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

[101]  Giorgio Ghelli,et al.  Commutativity Analysis in XML Update Languages , 2007, ICDT.

[102]  Yannis Papakonstantinou,et al.  Incremental validation of XML documents , 2003, TODS.

[103]  John F. Roddick,et al.  Evolution and change in data management — issues and directions , 2000, SGMD.

[104]  Kemal Oflazer,et al.  Error-tolerant Finite-state Recognition with Applications to Morphological Analysis and Spelling Correction , 1995, CL.

[105]  Tarek Melliti,et al.  Verifying Correctness of Web Services Choreography , 2006, 2006 European Conference on Web Services (ECOWS'06).

[106]  Emmanuel Coquery,et al.  Compatibility and Replaceability Analysis of Timed Web Services Protocols , 2009, 2009 Second International Conference on Computer and Electrical Engineering.

[107]  Ronald Fagin,et al.  On the semantics of updates in databases , 1983, PODS.

[108]  Oded Shmueli,et al.  Efficient Schema-Based Revalidation of XML , 2004, EDBT.

[109]  Derick Wood,et al.  Balanced Context-Free Grammars, Hedge Grammars and Pushdown Caterpillar Automata , 2004, Extreme Markup Languages®.

[110]  Kuo-Chung Tai,et al.  The Tree-to-Tree Correction Problem , 1979, JACM.