Lifo - Laboratoire d'Informatique Fondamentale d'orléans INSA Centre Val de Loire Université d'Orléans Université d'Orléans

Lifo > Les rapports de recherche du LIFO en 2008

 English Version



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 70 11
Fax: +33 (0)2 38 41 71 37



Accéder aux Rapports de l'année : 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017

Les rapports de recherche du LIFO en 2008


RR-2008-01 Abstract geometrical computation: beyond the Blum, Shub and Small model with accumulation
Jérôme Durand-Lose
Date : 2008-05-23
Résumé Télécharger

RR-2008-02 Dynamic Data Redistribution for Join Queries on Heterogeneous Shared Nothing Architecture
Mohamad AL HAJJ HASSAN et Mostafa BAMHA
Date : 2008-04-25
Résumé Télécharger

RR-2008-03 Equational and Cap Unification for Intrusion Analysis
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch
Date : 2008-04-03
Résumé Télécharger

RR-2008-04 Extrapol: Dependent Types and Effects for System Security
David Teller
Date : 2008-12-04
Résumé Télécharger

RR-2008-05 On Normal Partitions in Cubic Graphs
J.L. Fouquet and J.M. Vanherpe
Date : 2008-10-03
Résumé Télécharger

RR-2008-06 On Fan Raspaud Conjecture
J.L. Fouquet and J.M. Vanherpe
Date : 2008-10-03
Résumé Télécharger

RR-2008-07 On Parsimonious Edge-colouring of Graphs with Maximum Degree three
J.L. Fouquet and J.M. Vanherpe
Date : 2008-10-03
Résumé Télécharger

RR-2008-08 Kaiser-Raspaud Conjecture on Cubic Graphs with few Vertices
J.L. Fouquet and J.M. Vanherpe
Date : 2008-10-03
Résumé Télécharger

RR-2008-09 A Necessary and Sufficient Condition for Pattern Containment
Barbara FILA-KORDY
Date : 2008-11-18
Résumé Télécharger

RR-2008-10 Catch me if you can: Looking for type-safe, hierarchical, lightweight, polymorphic and efficient error management in OCaml
David Teller, Arnaud Spiwack, Till Varoquaux
Date : 2008-11-27
Résumé Télécharger


Résumés des rapports de recherche


RR-2008-01 Abstract geometrical computation: beyond the Blum, Shub and Small model with accumulation
Jérôme Durand-Lose
Résumé :
Mot(s) Clé(s) :

RR-2008-02 Dynamic Data Redistribution for Join Queries on Heterogeneous Shared Nothing Architecture
Mohamad AL HAJJ HASSAN et Mostafa BAMHA
Résumé :
Mot(s) Clé(s) :

RR-2008-03 Equational and Cap Unification for Intrusion Analysis
Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michael Rusinowitch
Résumé : We address the insecurity problem for cryptographic protocols, for an active intruder and a bounded number of sessions. By modeling each protocol step as a rigid Horn clause, and the intruder abilities as an equational theory over a convergent rewrite system, the problem of active intrusion is formulated as a Cap Unification problem. Cap Unification is an extension of Equational Unification: we look for a cap to be placed on a given set of terms, so that it unifies with a given term modulo the equational theory. We give a decision procedure for Cap Unification when the convergent system defining the intruder abilities is dwindling, with some additional assumptions satisfied by usual protocols. We also present briefly a possible way of extending the approach to the (non-dwindling) theory of Homomorphic Encryption.
Mot(s) Clé(s) : Rewriting, Unification, Protocol, Secrecy Analysis

RR-2008-04 Extrapol: Dependent Types and Effects for System Security
David Teller
Résumé : In the realm of security, one of the largest challenges is to determine what effects the execution of a program may have on the target system. While numerous tools permit extraction of these effects either during the execution of a program (dynamic analysis) or after its execution (trace analysis), the extraction of effects before the execution (static analysis of effects) from system-level software is largely ignored. In this document, we introduce a technique for this purpose. By extending the theory of types and effects, we demonstrate how to statically determine the set of system calls performed by a program or a library function, as well as their respective targets resources, from a C source code. Two implementations are proposed, one in Java and the other one in OCaml. While this is an on-going work, preliminary results are promising.
Mot(s) Clé(s) :

RR-2008-05 On Normal Partitions in Cubic Graphs
J.L. Fouquet and J.M. Vanherpe
Résumé :
Mot(s) Clé(s) :

RR-2008-06 On Fan Raspaud Conjecture
J.L. Fouquet and J.M. Vanherpe
Résumé :
Mot(s) Clé(s) :

RR-2008-07 On Parsimonious Edge-colouring of Graphs with Maximum Degree three
J.L. Fouquet and J.M. Vanherpe
Résumé :
Mot(s) Clé(s) :

RR-2008-08 Kaiser-Raspaud Conjecture on Cubic Graphs with few Vertices
J.L. Fouquet and J.M. Vanherpe
Résumé :
Mot(s) Clé(s) :

RR-2008-09 A Necessary and Sufficient Condition for Pattern Containment
Barbara FILA-KORDY
Résumé : In this paper we introduce an approach that allows to handle the containment problem for the fragment XP(/,//,[ ],*) of XPath. Using rewriting techniques we define a necessary and sufficient condition for pattern containment. This rewrite view is then adapted to query evaluation on XML documents, and remains valid even if the documents are given in a compressed form, as dags.
Mot(s) Clé(s) : pattern containment, rewriting, XPath query, XML compressed document, query evaluation

RR-2008-10 Catch me if you can: Looking for type-safe, hierarchical, lightweight, polymorphic and efficient error management in OCaml
David Teller, Arnaud Spiwack, Till Varoquaux
Résumé : This is the year 2008 and ML-style exceptions are everywhere. Most modern languages, whether academic or industrial, feature some variant of this mechanism. Languages such as Java even feature static coverage-checking for such exceptions, something not available for ML languages, at least not without resorting to external tools. In this document, we demonstrate a design principle and a tiny library for managing errors in a functional manner, with static coverage-checking, automatically-inferred, structurally typed and hierarchical exceptional cases, with a reasonable run-time penalty. Our work is based on OCaml and features monads, polymorphic variants, compile-time code rewriting and trace elements of black magic.
Mot(s) Clé(s) : Exceptions, OCaml, ML, Polymorphic variants, Safety, Monads, Staged compilation, Optimisation