Papers

@InProceedings{BCDH-epar,
  author =       {Fran{\c c}oise Baude and Denis Caromel and Christian Delb{\'e} and Ludovic Henrio},
  title =        {An Hybrid Message Logging-CIC Protocol for Constrained Checkpointability},
  booktitle =    {Proceedings of Europar 2005},
  publisher =     {Springer-Verlag},
  year =         2005
}

@Book{CH-book,
  author =     {Denis Caromel and Ludovic Henrio},
  title =     {A Theory of Distributed Objects},
  publisher =     {Springer-Verlag},
  key =         {3-540-20866-6},
  year =         2004
}

@InProceedings{BBCHHLM05,
  author =      {Laurent Baduel  and Françoise Baude and Denis Caromel and
     Ludovic Henrio and Fabrice Huet and Stéphane Lanteri and Matthieu Morel },
  title =      {Grid Components Techniques: Composing, Gathering, and Scattering},
  booktitle =      {Coupled Problems 2005, Computational Methods for Coupled Problems
                in Science and Engineering, an ECCOMAS Thematic Conference},
  year =      2005,
  address =      {Santorini, Greece},
  month =      {may}
}

Article{BCDH-TSI,
  author =   {Fran{\c c}oise Baude and Denis Caromel and Christian Delb{\'e} and Ludovic Henrio},
  title =        {Un protocole de tol{\'e}rance aux pannes pour objets actifs non-pr{\'e}emptifs},
  journal =  {Technique et Science Informatiques (TSI)},
  year =         {2006}
}

@Misc{DH04RR,
 author = {Fran\c{c}oise Baude and Denis Caromel and Christian Delb{\'e} and Ludovic Henrio},
title = {A Fault Tolerance protocol for {ASP} calculus : Design and Proof}, 
howpublished = {Research Report, INRIA Sophia Antipolis},
  year = 2004,
note = {RR-5246},   month = {June}
}

@InProceedings{HeSeSz:jfla04,
  author        = {Ludovic Henrio Bernard Paul Serpette and Szablocs Szentes},
  title         = {Algorithmes et compléxités de la réduction statique minimale},
  year          = 2004,
  month         = jan,
  pages = {155--168},
  booktitle     = {Actes des journ{\'e}es JFLA},
  address       = {Sainte-Marie-de-Ré, France}
   ABSTRACT = {
  La réduction statique minimale (RSM) est l'analyse de flot de
  contrôle d'ordre 0 (0CFA). Cet article présente une série
  d'algorithmes résolvant cette analyse ainsi que leurs complexités
  respectives.
  Même si cette analyse est souvent annoncée comme étant calculable en un temps
  cubique par rapport à la taille du programe étudié, un algorithme complet
  atteignant cette complexité n'est pas si évident. Avec le lambda-calcul
  comme langage de description des programmes, nous commençons par un
  algorithme naïf et, pas à pas, nous aboutissons à celui qui s'exécute,
  dans le pire des cas, en un temps cubique.
  Nous donnerons les exemples qui prouvent que ces complexités maximales
  peuvent être atteintes.
}
}

@TechReport{HeSeSz03RR,
  author =      {Ludovic Henrio Bernard Paul Serpette and Szablocs Szentes},
  title =      {Implementation and Complexity of the Lowest Statuc Reduction},
  institution =  {INRIA Sophia Antipolis},
  month         = dec,
  year =      2003,
  note =      {RR-5034},
  url = {ftp://ftp-sop/pub/rapport/RR5034.ps.gz}
}


@InProceedings{CHSPOPL04,
   author = {Denis Caromel and Ludovic Henrio and Bernard Paul Serpette},
   title = {Asynchronous and deterministic objects},
   booktitle = {Proceedings of the 31st ACM SIGPLAN-SIGACT symposium on Principles of programming languages},
   year = {2004},
   isbn = {1-58113-729-X},
   pages = {123--134},
   location = {Venice, Italy},
   doi = {http://doi.acm.org/10.1145/964001.964012},
   publisher = {ACM Press},
}


@TechReport{CHS03RR,
  author =      {Denis Caromel and Ludovic Henrio and Bernard Serpette},
  title =      {Asynchronous Sequential Processes},
  institution =  {INRIA Sophia Antipolis},
  year =      2003,
  note =      {RR-4753},
url = {ftp://ftp-sop/oasis/publications/2003/RRCHS.ps.gz}
}


@InProceedings{ HeSe:jfla03,
  author        = {Ludovic Henrio and Bernard Paul Serpette},
  title         = {A Parametrized Polyvariant Bytecode Verifier},
  year          = 2003,
  month         = jan,
  booktitle     = {Actes des journ{\'e}es JFLA},
  address       = {Chamrousse, France}
ABSTRACT = {
This paper presents a bytecode verifier based on an abstract
small-step semantics.
It is described with transition rules on abstract states of a
virtual machine.
By construction, the bytecode verifier is polyvariant: more than
one abstract state can be constructed for a given program point.
We separate each abstract step into two substeps:
a join step which can merge some abstract states and
an operational step which computes the effect of a specific
instruction on a state.
We give properties needed for these two steps in order
to obtain the soundness of the bytecode verifier.
We define a simple abstract join step definition allowing full
polymorphism of subroutines.
Finally, by choosing a dedicated representation of abstract stacks, we will see
that our bytecode verifier is able to perform a type check of recursion.}
}

@INPROCEEDINGS{henrio:esmart01,
  AUTHOR = {Denis Caromel, Ludovic Henrio, Bernard Serpette},
  TITLE = {Context Inference for Static Analysis of Java Card Object Sharing},
  BOOKTITLE = {Proceedings e-Smart 2001},
  PUBLISHER = {Springer-Verlag},
  YEAR = 2001,
  ABSTRACT = {This article presents an analysis to statically check the Java Card
sharing policy.  From the program text, both the violation and the
guaranty of correctness can be detected in certain cases avoiding
Run-time exception.
Using type inference techniques,a specific inference algorithm is proposed in order
to achieve such result. The current implementation is outlined, and
experimental results are given on a benchmark program.}
}

@Article{Attali2001,
  author = 	 "Isabelle Attali and Denis Caromel and Carine Courbis and
                  Ludovic Henrio and Henrik Nilsson",
  title = 	 "An Integrated Development Environment for {Java Card}",
  journal =	 "Computer Networks",
  year =	 2001,
  note =	 "Journal version of \cite{Attali2000b}"
}