• Summary
• LIFO Members (Directory)
• Research Teams
• CA
• GAMoC
• LMV
• Pamda
• SDS
• Research Actions
• Doctoral Research
• Seminars and Events
• Seminars (french)
• Events at LIFO
• Events out of LIFO
• Publications and Software
• Publications
• Doctoral and Habil. Theses
• Research Reports
• Software
• Technology transfer

• Contacts/Reaching LIFO
• Who's who at LIFO
• Coming to LIFO
• Teaching
• CS Department
• CS Technical Department
• INSA Centre-Val de Loire

Contact

LIFO - Bâtiment IIIA
Rue Léonard de Vinci
B.P. 6759
F-45067 ORLEANS Cedex 2

Email: contact.lifo
Tel: +33 (0)2 38 41 99 29
Fax: +33 (0)2 38 41 71 37

Go to Research Reports of Year : 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018

LIFO Research Report for Year 2012

RR-2012-01 Implementation of exponential and parametrized algorithms in the AGAPE project
P. Berthomé, J.-F. Lalande, V. Levorato
Date : 2012-01-30
Abstract Download

RR-2012-02 Weak Inclusion for recursive XML Types (full version)
Joshua Amavi, Jacques Chabin, Pierre Réty
Date : 2012-05-07
Abstract Download

RR-2012-03 An axiom system for XML and an algorithm for filtering XFD
Joshua Amavi, Mirian Halfeld Ferrari
Date : 2012-12-31
Abstract Download

---

Abstracts of Research Reports

RR-2012-01 Implementation of exponential and parametrized algorithms in the AGAPE project
P. Berthomé, J.-F. Lalande, V. Levorato
Abstract : This technical report describes the implementation of exact and parametrized exponential algorithms, developed during the French ANR Agape during 2010-2012. The developed algorithms are distributed under the CeCILL license and have been written in Java using the Jung graph library.
Keywords : graphs, exponential algorithms

RR-2012-02 Weak Inclusion for recursive XML Types (full version)
Joshua Amavi, Jacques Chabin, Pierre Réty
Abstract : Considering that the unranked tree languages L(G) and L(G') are those defined by given possibly-recursive XML types G and G', this paper proposes a method to verify whether L(G) is “approximatively” included in L(G'). The approximation consists in weakening the father-children relationships. Experimental results are discussed, showing the efficiency of our method in many situations.
Keywords : XML type, regular unranked-tree grammar, approximative inclusion.

RR-2012-03 An axiom system for XML and an algorithm for filtering XFD
Joshua Amavi, Mirian Halfeld Ferrari
Abstract : XML has become the de facto format for data exchange. A web application expected to deal with XML documents conceived on the basis of divers sets of (local) constraints would be expected to test documents with respect to all non contradictory constraints imposed by these original (local) sources. The goal of this paper is to introduce an optimized algorithm for computing the maximal set of XML functional dependencies (XFD) over multiple systems. The basis of our method is a sound and complete axiom system which is provided for relative XFD allowing two kinds of equality. This paper covers important theoretical and applied aspects of XFD. Not only do we present proofs and algorithms but we also show the result of some experiments that emphasize the interest of our approach.
Keywords : XML, Functional dependencies, XFD, constraints, interoperability