Publications 2008

International Conferences

  1. E. Balland, Y. Boichut, Thomas Genet, P.-E. Moreau. Towards an Efficient Implementation of Tree Automata Completion. In Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Lectures Notes in Computer Science, Volume 5140, Pages 67-82, 2008.
  2. Gilles Barthe, César Kunz, David Pichardie, Juli\'an Samborski Forlese. Preservation of Proof Obligations for Hybrid Certificates. In Proc.\ of the 6th IEEE International Conferences on Software Engineering and Formal Methods (SEFM'08), Pages 127-136, 2008.
  3. Gilles Barthe, Pierre Crégut, Benjamin Grégoire, Thomas Jensen, David Pichardie. The MOBIUS Proof Carrying Code infrastructure. In Proc.\ of the 6th International Symposium on Formal Methods for Components and Objects (FMCO'07), Lecture Notes in Computer Science, Volume 5382, Pages 1-24, 2008.
  4. Frédéric Besson, Thomas Jensen, T. Turpin. Computing stack maps with interfaces. In Proc. of the 22nd European Conference on Object-Oriented Programming (ECOOP 2008), LNCS, Volume 5142, Pages 642-666, 2008.
  5. B. Boyer, Thomas Genet, Thomas Jensen. Certifying a Tree Automata Completion Checker. In 4th International Joint Conference, IJCAR 2008, Lectures Notes in Computer Science, Volume 5195, Pages 347-362, 2008.
  6. David Cachera, Thomas Jensen, Arnaud Jobin, Pascal Sotin. Long-Run Cost Analysis by Approximation of Linear Operators over Dioids. In Algebraic Methodology and Software Technology, 12th International Conference, AMAST 2008, Lectures Notes in Computer Science, Volume 5140, Pages 122-138, 2008.
  7. A. Gotlieb, M. Petit. Constraint reasonning in Path-oriented Random Testing. In 32nd Annual IEEE International Computer Software and Applications Conference (COMPSAC'08), 4 pages, Turku, Finland, 2008.
  8. Olivier Heen, Thomas Genet, S. Geller, N. Prigent. An industrial and academical joint experiment on automated verification of a security protocol. In IFIP MWNS'08 Workshop, 2008.
  9. Laurent Hubert, Thomas Jensen, David Pichardie. Semantic foundations and inference of non-null annotations. In Proc.\ of the 10th International Conference on Formal Methods for Open Object-based Distributed Systems (FMOODS'08), Lecture Notes in Computer Science, Volume 5051, Pages 132-149, 2008.
  10. Laurent Hubert. A Non-Null annotation inferencer for Java bytecode. In Proc.\ of the Workshop on Program Analysis for Software Tools and Engineering (PASTE'08), Pages 36-42, 2008.
  11. J. Midtgaard, Thomas Jensen. A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. In Static Analysis, 15th International Symposium, SAS 2008, Lectures Notes in Computer Science, Volume 5079, Pages 347-362, 2008.
  12. David Pichardie. Building certified static analysers by modular construction of well-founded lattices. In Proc. of the 1st International Conference on Foundations of Informatics, Computing and Software (FICS'08), Electronic Notes in Theoretical Computer Science, Volume 212, Pages 225-239, 2008.

National Conferences

  1. Olivier Heen, Gilles Guette, Thomas Genet. Anonymity within trust communities. In SAR-SSI 2008, 3rd conference on security in network architectures and information systems, Nora Cuppens-Boulahia, Philippe Owezarski (eds.), Pages 183-195, 2008.
  2. J. Midtgaard, Thomas Jensen. A Calculational Approach to Control-Flow Analysis by Abstract Interpretation. In Proc. of the 15th Static Aanalysi Symposium, LNCS, Volume 5079, Pages 347-362, 2008.
  3. F. Charreteur, A. Gotlieb. Raisonnement à contraintes pour le test de bytecode Java. In quatrièmes Journées Francophones de Programmation par Contraintes (JFPC'08), Pages 11-20, Nantes, France, June 2008.

Misc

  1. David Pichardie. Les codes porteurs de preuve. pp. 8-9, 2008.
  2. Olivier Heen, Thomas Genet, E. Houssay. Votre protocole est-il vérifié?. pp. 58-68, September 2008.
  3. Thomas Genet. Le protocole cryptographique de paiement par carte bancaire. February 2008. download

Thesis

  1. Pascal Sotin. Quantitative Aspects of Program Analysis. PhD Thesis Université Rennes 1, December 2008.
  2. T. Turpin. Pruning program invariants, Élagage d'invariants de programmes. PhD Thesis Université Rennes 1, December 2008.
  3. M. Petit. Test statistique structurel par résolution de contraintes de choix probabiliste. PhD Thesis Université Rennes 1, July 2008.
  4. T. Denmat. Contraintes et abstractions pour la génération automatique de données de test. PhD Thesis Université Rennes 1, June 2008.