Team celtique

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

Bibliography

Major publications by the team in recent years

[1]
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.
[2]
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.
[3]
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.
[4]
D. Cachera, T. Jensen, A. Jobin, P. Sotin.
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids, in: Mathematical Structures in Computer Science, 2010, vol. 20, no 4, p. 589-624.
[5]
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.
[6]
F. Charreteur, B. Botella, A. Gotlieb.
Modelling dynamic memory management in Constraint-Based Testing, in: The Journal of Systems and Software, Nov. 2009, vol. 82, no 11, p. 1755–1766, Special Issue: TAIC-PART 2007 and MUTATION 2007.
[7]
T. Genet, V. Rusu.
Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, no 5, p. 574-597.
http://hal.inria.fr/inria-00495405
[8]
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.
[9]
A. Gotlieb.
EUCLIDE: A Constraint-Based Testing platform for critical C programs, in: 2th International Conference on Software Testing, Validation and Verification (ICST'09), Denver, CO, Apr. 2009.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[10]
B. Boyer.
Réécriture d'automates certifiée pour la vérification de modèle, Université Européenne de Bretagne, Déc 2010.
[11]
D. Cachera.
Analyses statiques : certifier et quantifier, École normale supérieure de Cachan, 2010, Habilitation à Diriger des Recherches.
[12]
F. Charreteur.
Modélisation par contraintes de programmes en bytecode Java pour la génération automatique de tests, Université Européenne de Bretagne, Mar 2010.
http://hal.inria.fr/tel-00497785
[13]
L. Hubert.
Foundations and Implementation of a Tool Bench for Static Analysis of Java Bytecode Programs, Université de Rennes 1, December 2010.

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, 2010, vol. 18, no 6, p. 971-998.
http://hal.inria.fr/inria-00537821
[15]
D. Cachera, T. Jensen, A. Jobin, P. Sotin.
Long-Run Cost Analysis by Approximation of Linear Operators over Dioids, in: Mathematical Structures in Computer Science, 2010, vol. 20, no 4, p. 589-624.
[16]
T. Genet, V. Rusu.
Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, no 5, p. 574-597.
http://hal.inria.fr/inria-00495405

International Peer-Reviewed Conference/Proceedings

[17]
F. Besson, T. Jensen, D. Pichardie, T. Turpin.
Certified Result Checking for Polyhedral Analysis of Bytecode Programs, in: Proc. of the 5th International Symposium on Trustworthy Global Computing (TGC 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, To appear.
http://hal.inria.fr/inria-00537816
[18]
S. Blazy, B. Robillard, A. W. Appel.
Formal Verification of Coalescing Graph-Coloring Register Allocation, in: 19th European Symposium on Programming (ESOP), Chypre Paphos, Springer, Mar 2010, vol. 6012, p. 145-164.
http://hal.inria.fr/inria-00477689
[19]
D. Cachera, A. Jobin.
Injecting Abstract Interpretations into Linear Cost Models, in: 8th Workshop on Quantitative Aspects of Programming Languages (QAPL), Paphos, EPTCS, 2010.
[20]
D. Cachera, D. Pichardie.
A Certified Denotational Abstract Interpreter, in: Proc. of International Conference on Interactive Theorem Proving (ITP-10), Lecture Notes in Computer Science, Springer-Verlag, 2010, vol. 6172, p. 9-24.
http://hal.inria.fr/inria-00537810
[21]
M. Carlier, C. Dubois, A. Gotlieb.
Constraint Reasonning in FOCALTEST, in: 5rd International Conference on Software and Data Technologies (ICSOFT'10), Athens, Greece, Jul. 2010.
[22]
F. Charreteur, A. Gotlieb.
Constraint-Based Test Input Generation for Java Bytecode, in: Proc. of the 21st IEEE Int. Symp. on Softw. Reliability Engineering (ISSRE'10), San Jose, CA, USA, Nov. 2010.
[23]
M. Delahaye, B. Botella, A. Gotlieb.
Explanation-based generalization of infeasible path, in: 3rd IEEE International Conference on Software Testing, Validation and Verification (ICST'10), Paris, France, Apr. 2010.
[24]
D. Demange, T. Jensen, D. Pichardie.
A Provably Correct Stackless Intermediate Representation for Java Bytecode, in: 8th Asian Symposium on Programming Languages and Systems (APLAS), Lecture Notes in Computer Science, Springer-Verlag, 2010, vol. 6461.
http://hal.inria.fr/inria-00537815
[25]
A. Gotlieb, M. Leconte, B. Marre.
Constraint Solving on Modular Integers, in: Proc. of the 9th Int. Workshop on Constraint Modelling and Reformulation (ModRef'10), co-located with CP'2010, St Andrews, Scotland, Sept. 2010.
[26]
L. Hubert, N. Barré, F. Besson, D. Demange, T. Jensen, V. Monfort, D. Pichardie, T. Turpin.
Sawja: Static Analysis Workshop for Java, in: 1st International Conference on Formal Verification of Object-Oriented Software (FoVeOOS), Lecture Notes in Computer Science, Springer-Verlag, 2010.
http://hal.inria.fr/inria-00504047
[27]
L. Hubert, T. Jensen, V. Monfort, D. Pichardie.
Enforcing Secure Object Initialization in Java, in: 15th European Symposium on Research in Computer Security (ESORICS), Lecture Notes in Computer Science, Springer, 2010, vol. 6345, p. 101-115.
http://hal.inria.fr/inria-00503953
[28]
H. Kirchner, K. Florent, C. Kirchner.
Constraint Based Strategies, in: 18th International Workshop on Functional and Constraint Logic Programming - WFLP 2009, Brésil Brasilia, Springer Berlin / Heidelberg, 2010, vol. 5979, p. 13-26.
http://hal.inria.fr/inria-00494531
[29]
N. Lazaar, A. Gotlieb, Y. Lebbah.
Fault Localization in Constraint Programs, in: 22th Int. Conf. on Tools with Artificial Intelligence (ICTAI'2010), Arras, France, Oct. 2010.
[30]
N. Lazaar, A. Gotlieb, Y. Lebbah.
On Testing Constraint Programs, in: 16th Int. Conf. on Principles and Practices of Constraint Programming (CP'2010), St Andrews, Scotland, Sept. 2010.

National Peer-Reviewed Conference/Proceedings

[31]
G. Hiet, F. Guihéry, G. Guiheux, D. Pichardie, C. Brunette.
Sécurité de la plate-forme d'exécution Java : limites et propositions d'améliorations, in: Proc. of Symposium sur la sécurité des technologies de l'information et des communications (SSTIC 2010), 2010.
http://hal.inria.fr/inria-00537820

Workshops without Proceedings

[32]
F. Besson.
On using an inexact floating-point LP solver for deciding linear arithmetic in an SMT solver, in: 8th International Workshop on Satisfiability Modulo Theories, 2010.
http://hal.inria.fr/inria-00517308

Internal Reports

[33]
Y. Boichut, B. Boyer, T. Genet, A. Legay.
Fast Equational Abstraction Refinement for Regular Tree Model Checking, INRIA, Jul 2010.
http://hal.inria.fr/inria-00501487

References in notes

[34]
The Coq Proof Assistant, 2009.
http://coq.inria.fr/
[35]
E. Albert, P. Arenas, S. Genaim, G. Puebla, D. Zanardini.
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode, in: FMCO, 2007, p. 113-132.
[36]
E. Albert, G. Puebla, M. Hermenegildo.
Abstraction-Carrying Code, in: Proc. of 11th Int. Conf. on Logic for Programming Artificial Intelligence and Reasoning (LPAR'04), Springer LNAI vol. 3452, 2004, p. 380-397.
[37]
A. W. Appel.
Foundational Proof-Carrying Code, in: Logic in Computer Science, J. Halpern (editor), IEEE Press, June 2001, 247 p, Invited Talk.
[38]
Andrew W. Appel, Amy P. Felty.
A Semantic Model of Types and Machine Instructions for Proof-Carrying Code, in: Principles of Programming Languages, ACM, 2000.
[39]
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: CAV'2005, LNCS, Springer, 2005, vol. 3576, p. 281-285.
[40]
D. Aspinall, L. Beringer, M. Hofmann, Hans-Wolfgang. Loidl, A. Momigliano.
A Program Logic for Resource Verification, in: In Proceedings of the 17th International Conference on Theorem Proving in Higher-Order Logics, (TPHOLs 2004), volume 3223 of LNCS, Springer, 2004, p. 34–49.
[41]
D. F. Bacon, P. F. Sweeney.
Fast Static Analysis of C++ Virtual Function Calls, in: OOPSLA'96, 1996, p. 324-341.
[42]
P. Baillot, P. Coppola, U. D. Lago.
Light Logics and Optimal Reduction: Completeness and Complexity, in: LICS, 2007, p. 421-430.
[43]
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.
[44]
G. Barthe, D. Pichardie, T. Rezk.
A Certified Lightweight Non-Interference Java Bytecode Verifier, in: Proc. of 16th European Symposium on Programming (ESOP'07), Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 4421, p. 125-140.
[45]
F. Besson, T. Jensen.
Modular Class Analysis with DATALOG, in: SAS'2003, 2003, p. 19-36.
[46]
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.
[47]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Automatic Verification of Security Protocols Using Approximations, INRIA, 2005, no RR 5727.
[48]
A. Bouajjani, P. Habermehl, A. Rogalewicz, T. Vojnar.
Abstract Regular Tree Model Checking, in: ENTCS, 2006, vol. 149, no 1, p. 37-48.
[49]
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.
[50]
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.
[51]
D. Cachera, T. Jensen, D. Pichardie, G. Schneider.
Certified Memory Usage Analysis, in: Proc. of 13th International Symposium on Formal Methods (FM'05), LNCS, Springer-Verlag, 2005.
[52]
E. M. Clarke.
Counterexample-Guided Abstraction Refinement, in: TIME, IEEE Computer Society, 2003, 7 p.
[53]
P. Cousot, R. Cousot.
Abstract Interpretation: a Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, in: Proc. of POPL'77, 1977, p. 238–252.
[54]
A. Ermedahl, C. Sandberg, J. Gustafsson, S. Bygde, B. Lisper.
Loop Bound Analysis based on a Combination of Program Slicing, Abstract Interpretation, and Invariant Analysis, in: Seventh International Workshop on Worst-Case Execution Time Analysis, (WCET'2007), July 2007.
http://www.mrtc.mdh.se/index.php?choice=publications&id=1317
[55]
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.
[56]
C. Flanagan.
Automatic software model checking via constraint logic., in: Sci. Comput. Program., 2004, vol. 50, no 1-3, p. 253-270.
[57]
M. Fähndrich, K. R. M. Leino.
Declaring and checking non-null types in an object-oriented language, in: OOPSLA, 2003, p. 302-312.
[58]
T. Genet.
Decidable Approximations of Sets of Descendants and Sets of Normal forms, in: RTA'98, LNCS, Springer, 1998, vol. 1379, p. 151–165.
[59]
T. Genet, V. Viet Triem Tong.
Reachability Analysis of Term Rewriting Systems with Timbuk, in: LPAR'01, LNAI, Springer, 2001, vol. 2250, p. 691-702.
[60]
T. Genet, V. Viet Triem Tong.
Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation, INRIA, 2002, no RR-4576.
[61]
P. Godefroid.
Compositional dynamic test generation., in: POPL'07, 2007, p. 47-54.
[62]
D. Grove, C. Chambers.
A framework for call graph construction algorithms, in: Toplas, 2001, vol. 23, no 6, p. 685–746.
[63]
D. Grove, G. DeFouw, J. Dean, C. Chambers.
Call graph construction in object-oriented languages, in: ACM SIGPLAN Notices, 1997, vol. 32, no 10, p. 108–124.
[64]
M. Hofmann, S. Jost.
Static prediction of heap space usage for first-order functional programs, in: POPL, 2003, p. 185-197.
[65]
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), ACM, 2008, To appear.
[66]
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.
[67]
O. Lhoták, L. J. Hendren.
Evaluating the benefits of context-sensitive points-to analysis using a BDD-based implementation, in: ACM Trans. Softw. Eng. Methodol., 2008, vol. 18, no 1.
[68]
V. B. Livshits, M. S. Lam.
Finding Security Errors in Java Programs with Static Analysis, in: Proc. of the 14th Usenix Security Symposium, 2005, p. 271–286.
[69]
J. Meseguer, M. Palomino, N. Martí-Oliet.
Equational abstractions, in: TCS, 2008, vol. 403, no 2-3, p. 239-264.
[70]
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.
[71]
A. Milanova, A. Rountev, B. G. Ryder.
Parameterized object sensitivity for points-to analysis for Java, in: ACM Trans. Softw. Eng. Methodol., 2005, vol. 14, no 1, p. 1–41.
[72]
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, May 2003, vol. 2622, p. 61-76.
http://www.loria.fr/~moreau/Papers/MoreauRV-CC2003.ps.gz
[73]
M. Naik, A. Aiken.
Conditional must not aliasing for static race detection, in: POPL'07, ACM, 2007, p. 327-338.
[74]
M. Naik, A. Aiken, J. Whaley.
Effective static race detection for Java, in: PLDI'2006, ACM, 2006, p. 308-319.
[75]
G. C. Necula.
Proof-carrying code, in: Proceedings of POPL'97, ACM Press, 1997, p. 106–119.
[76]
G. C. Necula, R. R. Schneck.
A Sound Framework for Untrusted Verification-Condition Generators., in: Proc. of 18th IEEE Symp. on Logic In Computer Science (LICS 2003), 2003, p. 248-260.
[77]
F. Nielson, H. Nielson, C. Hankin.
Principles of Program Analysis, Springer, 1999.
[78]
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.
[79]
F. Oehl, D. Sinclair.
Combining two approaches for the formal verification of cryptographic protocols, in: Proceedings of ICLP Workshop on Specification, Analysis and Validation for Emerging technologies in computational logic, 2001.
[80]
J. Palsberg, M. Schwartzbach.
Object-Oriented Type Inference, in: OOPSLA'91, 1991, p. 146-161.
[81]
J. Palsberg, M. Schwartzbach.
Object-Oriented Type Systems, John Wiley & Sons, 1994.
[82]
D. Pichardie.
Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certiés, Université Rennes 1, Rennes, France, dec 2005.
[83]
A. D. Pierro, H. Wiklicky.
Operator Algebras and the Operational Semantics of Probabilistic Languages, in: Electr. Notes Theor. Comput. Sci., 2006, vol. 161, p. 131-150.
[84]
A. Podelski.
Model Checking as Constraint Solving, in: SAS'00, 2000, p. 22-37.
[85]
E. Rose.
Lightweight Bytecode Verification, in: Journal of Automated Reasoning, 2003, vol. 31, no 3–4, p. 303–334.
[86]
A. Sabelfeld, A. C. Myers.
Language-based Information-Flow Security, in: IEEE Journal on Selected Areas in Communication, January 2003, vol. 21, no 1, p. 5–19.
[87]
P. Sotin, D. Cachera, T. Jensen.
Quantitative Static Analysis over semirings: analysing cache behaviour for Java Card, in: 4th International Workshop on Quantitative Aspects of Programming Languages (QAPL 2006), Electronic Notes in Theoretical Computer Science, Elsevier, 2006, vol. 164, p. 153-167.
[88]
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.
[89]
F. Tip, J. Palsberg.
Scalable propagation-based call graph construction algorithms, in: OOPSLA, 2000, p. 281-293.
[90]
J. Whaley, M. S. Lam.
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, in: PLDI '04, ACM, 2004, p. 131–144.
[91]
M. Wildmoser, A. Chaieb, T. Nipkow.
Bytecode Analysis for Proof Carrying Code, in: Bytecode Semantics, Verification, Analysis and Transformation, 2005.
[92]
M. Wildmoser, T. Nipkow, G. Klein, S. Nanz.
Prototyping Proof Carrying Code, in: Exploring New Frontiers of Theoretical Informatics, IFIP 18th World Computer Congress, TC1 3rd Int. Conf. on Theoretical Computer Science (TCS2004), J.-J. Levy, E. W. Mayr, J. C. Mitchell (editors), Kluwer Academic Publishers, August 2004, p. 333–347.

previous
next