Team Lande

Members
Overall Objectives
Scientific Foundations
Software
New Results
Contracts and Grants with Industry
Dissemination
Bibliography

Bibliography

Major publications by the team in recent years

[1]
A. Banerjee, T. Jensen.
Control-flow analysis with rank-2 intersection types, in: Mathematical Structures in Computer Science, 2003, vol. 13, no 1, p. 87–124.
[2]
F. Besson, T. de Grenier de Latour, T. Jensen.
Interfaces for stack inspection, in: Journal of Functional Programming, 2005, vol. 15, no 2, p. 179–217.
[3]
F. Besson, T. Jensen, D. Pichardie.
Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Special Issue on Applied Semantics of Theoretical Computer Science, 2006, vol. 364, no 3, p. 273–291.
[4]
F. Besson, T. Jensen, D. Le Métayer, T. Thorn.
Model ckecking security properties of control flow graphs, in: Journal of Computer Security, 2001, vol. 9, p. 217–250.
[5]
B. Botella, A. Gotlieb, C. Michel.
Symbolic execution of floating-point computations, in: The Software Testing, Verification and Reliability journal, June 2006, vol. 16, no 2, p. 97–121.
[6]
D. Cachera, T. Jensen, D. Pichardie, V. Rusu.
Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, no 1, p. 56–78.
[7]
G. Feuillade, T. Genet, V. Viet Triem Tong.
Reachability Analysis over Term Rewriting Systems, in: Journal of Automated Reasoning, 2004, vol. 33, no 3–4, p. 341–383.
[8]
T. Genet, F. Klay.
Rewriting for Cryptographic Protocol Verification, in: Proc. of the 17th International Conference on Automated Deduction, LNAI, Springer-Verlag, 2000, vol. 1831, p. 271 – 290.
[9]
A. Gotlieb, T. Denmat, B. Botella.
Goal-oriented test data generation for pointer programs, in: Information and Software Technology, Sep. 2007, vol. 49, no 9-10, p. 1030–1044.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[10]
T. Denmat.
Contraintes et abstractions pour la génération automatique de données de test, Ph. D. Thesis, Université Rennes 1, June 2008.
[11]
M. Petit.
Test statistique structurel par résolution de contraintes de choix probabiliste, Ph. D. Thesis, Université Rennes 1, July 2008.
[12]
P. Sotin.
Quantitative Aspects of Program Analysis, Ph. D. Thesis, Université Rennes 1, December 2008.
[13]
T. Turpin.
Pruning program invariants, Élagage d'invariants de programmes, Ph. D. Thesis, Université Rennes 1, December 2008.

Articles in International Peer-Reviewed Journal

[14]
F. Besson, T. Jensen, G. Dufay, D. Pichardie.
Verifying Resource Access Control on Mobile Interactive Devices, in: Journal of Computer Security, To appear, 2009.

International Peer-Reviewed Conference/Proceedings

[15]
E. Balland, Y. Boichut, T. 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, Springer-Verlag, 2008, vol. 5140, p. 67-82.
[16]
G. Barthe, P. Crégut, B. Grégoire, T. Jensen, D. 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, To appear, Springer-Verlag, 2008.
[17]
G. Barthe, C. Kunz, D. Pichardie, J. S. Forlese.
Preservation of Proof Obligations for Hybrid Certificates, in: Proc. of the 6th IEEE International Conferences on Software Engineering and Formal Methods (SEFM'08), To appear, IEEE Computer Society, 2008.
[18]
F. Besson, T. Jensen, T. Turpin.
Computing stack maps with interfaces, in: Proc. of the 22nd European Conference on Object-Oriented Programming (ECOOP 2008), LNCS, Springer-Verlag, 2008, vol. 5142, p. 642-666.
[19]
B. Boyer, T. Genet, T. Jensen.
Certifying a Tree Automata Completion Checker, in: 4th International Joint Conference, IJCAR 2008, Lectures Notes in Computer Science, Springer-Verlag, 2008, vol. 5195, p. 347–362.
[20]
D. Cachera, T. Jensen, A. Jobin, P. 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, Springer-Verlag, 2008, vol. 5140, p. 122-138.
[21]
A. Gotlieb, M. Petit.
Constraint reasonning in Path-oriented Random Testing, in: 32nd Annual IEEE International Computer Software and Applications Conference (COMPSAC'08), Turku, Finland, 4 pages, Jul. 2008.
[22]
O. Heen, T. Genet, S. Geller, N. Prigent.
An industrial and academical joint experiment on automated verification of a security protocol, in: IFIP MWNS'08 Workshop, 2008.
[23]
L. Hubert.
A Non-Null annotation inferencer for Java bytecode, in: Proc. of the Workshop on Program Analysis for Software Tools and Engineering (PASTE'08), To appear, ACM, 2008.
[24]
L. Hubert, T. Jensen, D. 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, Springer-Verlag, 2008, vol. 5051, p. 132-149.
[25]
D. 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, 2008, vol. 212, p. 225-239.

National Peer-Reviewed Conference/Proceedings

[26]
O. Heen, G. Guette, T. Genet.
Anonymity within trust communities, in: SAR-SSI 2008, 3rd conference on security in network architectures and information systems, N. Cuppens-Boulahia, P. Owezarski (editors), 2008, p. 183–195.
[27]
J. Midtgaard, T. Jensen.
A Calculational Approach to Control-Flow Analysis by Abstract Interpretation, in: Proc. of the 15th Static Aanalysi Symposium, LNCS, Springer Verlag, 2008, vol. 5079, p. 347-362.

Scientific Popularization

[28]
T. Genet.
Le protocole cryptographique de paiement par carte bancaire, Interstices, Février 2008
http://interstices.info/jcms/c_33835/le-protocole-cryptographique-de-paiement-par-carte-bancaire.
[29]
O. Heen, T. Genet, E. Houssay.
Votre protocole est-il vérifié?, Multi-system & Internet Security Cookbook, Diamond, Septembre 2008, vol. 39.

References in notes

[30]
The Coq Proof Assistant
http://coq.inria.fr/.
[31]
A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santos Santiago, M. Turuani, L. Viganò, L. Vigneron.
AVISPA – a tool for Automated Validation of Internet Security Protocols
http://www.avispa-project.org.
[32]
A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santos Santiago, M. Turuani, L. Viganò, L. Vigneron.
The AVISPA Tool for the automated validation of internet security protocols and applications, in: 17th International Conference on Computer Aided Verification, CAV'2005, Edinburgh, Scotland, K. Etessami, S. Rajamani (editors), Lecture Notes in Computer Science, Springer, 2005, vol. 3576, p. 281-285.
[33]
F. Besson.
Fast Reflexive Arithmetic Tactics the linear case and beyond, in: Types for Proofs and Programs (TYPES'06), LNCS, Springer-Verlag, 2007, vol. 4502, p. 48–62.
[34]
F. Besson, G. Dufay, T. Jensen.
A Formal Model of Access Control for Mobile Interactive Devices, in: 11th European Symposium On Research In Computer Security (ESORICS'06), Lecture Notes in Computer Science, Springer, 2006, vol. 4189.
[35]
F. Besson, T. Jensen, T. Turpin.
Small Witnesses for Abstract Interpretation-Based proofs, in: Proc. of 16th European Symposium on Programming (ESOP'07), LNCS, Springer, 2007, vol. 4421, p. 268–283.
[36]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Automatic Approximation for the Verification of Cryptographic Protocols, in: Proc. AVIS'2004, joint to ETAPS'04, Barcelona (Spain), 2004.
[37]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Automatic Verification of Security Protocols Using Approximations, in revision for Journal of Automated Reasoning, INRIA, 2005, no RR 5727
http://hal.inria.fr/inria-00070291/fr/.
[38]
Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, J. Mantovani, S. Mödersheim, L. Vigneron.
A High Level Protocol Specification Language for Industrial Security-Sensitive Protocols, in: Proceedings of Workshop on Specification and Automated Processing of Security Requirements (SAPS), Linz, Austria, Oesterreichische Computer Gesellschaft (Austrian Computer Society), 2004, vol. 180.
[39]
P. Cousot, R. Cousot.
Abstract Interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints, in: Proc. of 4th ACM Symposium on Principles of Programming Languages, ACM Press, New York, 1977, p. 238–252.
[40]
T. Genet.
Decidable Approximations of Sets of Descendants and Sets of Normal forms, in: Proc. 9th International Conference on Rewriting Techniques and Applications, LNCS, Springer-Verlag, 1998, vol. 1379, p. 151–165.
[41]
T. Genet, V. Viet Triem Tong.
Reachability Analysis of Term Rewriting Systems with Timbuk , in: Proc. of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LNAI, Springer-Verlag, 2001, vol. 2250, p. 691–702.
[42]
T. Genet, V. Viet Triem Tong.
Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation, Technical report, INRIA, 2002, no RR-4576
http://hal.inria.fr/inria-00072012.
[43]
Y. Glouche, T. Genet.
SPAN – A Security Protocol ANimator for AVISPA – User Manual, 2006
http://www.irisa.fr/lande/genet/span/, IRISA / Université de Rennes 1.
[44]
B. Grégoire, A. Mahboubi.
Proving Equalities in a Commutative Ring Done Right in Coq, in: Proc. of the 18th Int. Conference on Theorem Proving in Higher Order Logics, 2005, p. 98-113.
[45]
P.-C. Héam, Y. Boichut, O. Kouchnarenko, F. Oehl.
Improvements on the Genet and Klay Technique to Automatically Verify Security Protocols, in: Proc. of AVIS, 2004.
[46]
D. E. Knuth, P. B. Bendix.
Simple word problems in universal algebras, in: Computational Problems in Abstract Algebra, Oxford, J. Leech (editor), Pergamon Press, 1970, p. 263–297.
[47]
J. Meseguer, M. Palomino, N. Martí-Oliet.
Equational Abstractions, in: Proc. 19th CADE Conf., Miami Beach (Fl., USA), LNCS, Springer, 2003, vol. 2741, p. 2-16.
[48]
P.-E. Moreau, C. Ringeissen, M. Vittek.
A Pattern Matching Compiler for Multiple Target Languages, in: 12th Conference on Compiler Construction, Warsaw (Poland), G. Hedin (editor), LNCS, Springer-Verlag, May 2003, vol. 2622, p. 61–76.
[49]
F. Nielson, H. Nielson, C. Hankin.
Principles of Program Analysis, Springer, 1999.
[50]
H. R. Nielson, F. Nielson.
Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis, in: Proc. of the 24th ACM Symposium on Principles of Programming Language, ACM Press, 1997, p. 332-345.
[51]
F. Oehl, G. Cécé, O. Kouchnarenko, D. Sinclair.
Automatic Approximation for the Verification of Cryptographic Protocols, in: Proc. of FASE'03, LNCS, Springer, 2003, vol. 2629, p. 34-48.
[52]
F. Oehl, D. Sinclair.
Combining two approaches for the formal verification of cryptographic protocols, in: Proc. of ICLP Workshop on Specification, Analysis and Validation for Emerging technologies in computational logic, 2001.
[53]
T. Takai.
A Verification Technique Using Term Rewriting Systems and Abstract Interpretation, in: Proc. 15th RTA Conf., Aachen (Germany), LNCS, Springer, 2004, vol. 3091, p. 119-133.

previous
next