Bibliography

• 1F. Besson, T. Jensen, D. Pichardie.
  
  Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Theoretical Computer Science, 2006, vol. 364, n^o 3, p. 273–291.
• 2F. 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.
• 3B. 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.
• 4D. 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, n^o 4, p. 589-624.
• 5D. Cachera, T. Jensen, D. Pichardie, V. Rusu.
  
  Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, n^o 1, p. 56–78.
• 6F. Charreteur, B. Botella, A. Gotlieb.
  
  Modelling dynamic memory management in Constraint-Based Testing, in: The Journal of Systems and Software, Nov. 2009, vol. 82, n^o 11, p. 1755–1766.
• 7T. Genet, V. Rusu.
  
  Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, n^o 5, p. 574-597.
  
  http://hal.inria.fr/inria-00495405
• 8A. Gotlieb, T. Denmat, B. Botella.
  
  Goal-oriented test data generation for pointer programs, in: Information and Software Technology, Sep. 2007, vol. 49, n^o 9-10, p. 1030–1044.
• 9L. 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

Doctoral Dissertations and Habilitation Theses

• 10M. Delahaye.
  
  Généralisation de chemins infaisables pour l'exécution symbolique dynamique, University of Rennes 1, 2011.
• 11A. Gotlieb.
  
  Contributions to Constraint-Based Testing, University of Rennes 1, 2011, Habilitation à Diriger des Recherches.
• 12N. Lazaar.
  
  Méthodologie et outil de test, de localisation de fautes et de correction automatique des programmes contraintes, University of Rennes 1, 2011.

Articles in International Peer-Reviewed Journal

• 13J. Midtgaard, T. Jensen.
  
  Control-Flow Analysis by Abstract Interpretation, in: Information and Computation, 2012.

International Conferences with Proceedings

• 14R. Bedin Franca, S. Blazy, D. Favre-Felix, X. Leroy, M. Pantel, J. Souyris.
  
  Formally verified optimizing compilation in ACG-based flight control software, in: ERTS2 congress, 2012, to appear.
• 15F. Besson, P.-E. Cornilleau, D. Pichardie.
  
  Modular SMT Proofs for Fast Reflexive Checking inside Coq, in: First International Conference on Certified Programs and Proofs, Kenting, Taïwan, Province De Chine, Lecture Notes in Computer Science, Springer-Verlag, 2011, vol. 7086, p. 151-166.
  
  http://hal.inria.fr/hal-00646960/en
• 16Y. Boichut, T.-B.-H. Dao, V. Murat.
  
  Characterizing Conclusive Approximations by Logical Formulae, in: Reachability Problems 2011, Gênes, Italy, G. Delzanno, I. Potapov (editors), 2011, vol. LNCS 6945.
  
  http://hal.inria.fr/inria-00606100/en
• 17M. Carlier, A. Gotlieb.
  
  Filtering by ULP Maximum, in: Proc. of the IEEE Int. Conf. on Tools for Artificial Intelligence (ICTAI'11), Nov. 2011, Short paper, 4 pages.
• 18T. Jensen, F. Kirchner, D. Pichardie.
  
  Secure the Clones: Static Enforcement of Policies for Secure Object Copying, in: Proc. of 20th European Symposium on Programming (ESOP 2011), Lecture Notes in Computer Science, Springer-Verlag, 2011, vol. 6602, p. 317-337.
• 19N. Lazaar, A. Gotlieb, Y. Lebbah.
  
  A framework for the automatic correction of Constraint Programs, in: 4th IEEE International Conference on Software Testing, Validation and Verification (ICST'11), Berlin, Germany, Mar. 2011.

Conferences without Proceedings

• 20F. Besson, P.-E. Cornilleau, D. Pichardie.
  
  A Nelson-Oppen based Proof System using Theory Specific Proof Systems, in: Workshop on Proof eXchange for Theorem Proving (PxTP), 2011.
• 21F. Besson, P. Fontaine, L. Théry.
  
  A Flexible Proof Format for SMT: a Proposal, in: Workshop on Proof eXchange for Theorem Proving (PxTP), 2011.

Internal Reports

• 22G. Barthe, D. Demange, D. Pichardie.
  
  A formally verified SSA-based middle-end compiler, INRIA, October 2011.
  
  http://hal.inria.fr/inria-00634702/en
• 23D. Cachera, T. Jensen, A. Jobin, F. Kirchner.
  
  Fast inference of polynomial invariants for imperative programs, INRIA, May 2011, n^o RR-7627.
  
  http://hal.inria.fr/inria-00595783/en
• 24N. Lazaar, N. Aribi, A. Gotlieb, Y. Lebbah.
  
  Negation for Free!, INRIA, October 2011, n^o RR-7749.
  
  http://hal.inria.fr/inria-00629657/en

• 25The Coq Proof Assistant, 2009.
  
  http://coq.inria.fr/
• 26E. 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.
• 27E. 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.
• 28Andrew W. Appel.
  
  Foundational Proof-Carrying Code, in: Logic in Computer Science, J. Halpern (editor), IEEE Press, June 2001, 247 p, Invited Talk.
• 29Andrew W. Appel, Amy P. Felty.
  
  A Semantic Model of Types and Machine Instructions for Proof-Carrying Code, in: Principles of Programming Languages, ACM, 2000.
• 30D. 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.
• 31D. F. Bacon, P. F. Sweeney.
  
  Fast Static Analysis of C++ Virtual Function Calls, in: OOPSLA'96, 1996, p. 324-341.
• 32P. Baillot, P. Coppola, U. D. Lago.
  
  Light Logics and Optimal Reduction: Completeness and Complexity, in: LICS, 2007, p. 421-430.
• 33E. 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.
• 34G. 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.
• 35F. Besson, T. Jensen.
  
  Modular Class Analysis with DATALOG, in: SAS'2003, 2003, p. 19-36.
• 36F. Besson, T. Jensen, G. Dufay, D. Pichardie.
  
  Verifying Resource Access Control on Mobile Interactive Devices, in: Journal of Computer Security, 2010, vol. 18, n^o 6, p. 971-998.
  
  http://hal.inria.fr/inria-00537821
• 37D. 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.
• 38D. Cachera, T. Jensen, D. Pichardie, V. Rusu.
  
  Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, n^o 1, p. 56–78.
• 39D. 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.
• 40P. 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.
• 41A. 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
• 42G. Feuillade, T. Genet, V. Viet Triem Tong.
  
  Reachability Analysis over Term Rewriting Systems, in: Journal of Automated Reasoning, 2004, vol. 33, n^o 3–4, p. 341–383.
• 43C. Flanagan.
  
  Automatic software model checking via constraint logic., in: Sci. Comput. Program., 2004, vol. 50, n^o 1-3, p. 253-270.
• 44M. Fähndrich, K. R. M. Leino.
  
  Declaring and checking non-null types in an object-oriented language, in: OOPSLA, 2003, p. 302-312.
• 45T. Genet.
  
  Decidable Approximations of Sets of Descendants and Sets of Normal forms, in: RTA'98, LNCS, Springer, 1998, vol. 1379, p. 151–165.
• 46T. Genet, V. Viet Triem Tong.
  
  Reachability Analysis of Term Rewriting Systems with Timbuk, in: LPAR'01, LNAI, Springer, 2001, vol. 2250, p. 691-702.
• 47P. Godefroid.
  
  Compositional dynamic test generation., in: POPL'07, 2007, p. 47-54.
• 48D. Grove, C. Chambers.
  
  A framework for call graph construction algorithms, in: Toplas, 2001, vol. 23, n^o 6, p. 685–746.
• 49D. Grove, G. DeFouw, J. Dean, C. Chambers.
  
  Call graph construction in object-oriented languages, in: ACM SIGPLAN Notices, 1997, vol. 32, n^o 10, p. 108–124.
• 50M. Hofmann, S. Jost.
  
  Static prediction of heap space usage for first-order functional programs, in: POPL, 2003, p. 185-197.
• 51L. 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.
• 52L. 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.
• 53O. 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, n^o 1.
• 54V. 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.
• 55A. Milanova, A. Rountev, B. G. Ryder.
  
  Parameterized object sensitivity for points-to analysis for Java, in: ACM Trans. Softw. Eng. Methodol., 2005, vol. 14, n^o 1, p. 1–41.
• 56M. Naik, A. Aiken.
  
  Conditional must not aliasing for static race detection, in: POPL'07, ACM, 2007, p. 327-338.
• 57M. Naik, A. Aiken, J. Whaley.
  
  Effective static race detection for Java, in: PLDI'2006, ACM, 2006, p. 308-319.
• 58G. C. Necula.
  
  Proof-carrying code, in: Proceedings of POPL'97, ACM Press, 1997, p. 106–119.
• 59G. 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.
• 60F. Nielson, H. Nielson, C. Hankin.
  
  Principles of Program Analysis, Springer, 1999.
• 61J. Palsberg, M. Schwartzbach.
  
  Object-Oriented Type Inference, in: OOPSLA'91, 1991, p. 146-161.
• 62J. Palsberg, M. Schwartzbach.
  
  Object-Oriented Type Systems, John Wiley & Sons, 1994.
• 63D. Pichardie.
  
  Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certiés, Université Rennes 1, Rennes, France, dec 2005.
• 64A. 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.
• 65A. Podelski.
  
  Model Checking as Constraint Solving, in: SAS'00, 2000, p. 22-37.
• 66E. Rose.
  
  Lightweight Bytecode Verification, in: Journal of Automated Reasoning, 2003, vol. 31, n^o 3–4, p. 303–334.
• 67A. Sabelfeld, A. C. Myers.
  
  Language-based Information-Flow Security, in: IEEE Journal on Selected Areas in Communication, January 2003, vol. 21, n^o 1, p. 5–19.
• 68P. 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.
• 69F. Tip, J. Palsberg.
  
  Scalable propagation-based call graph construction algorithms, in: OOPSLA, 2000, p. 281-293.
• 70J. Whaley, M. S. Lam.
  
  Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, in: PLDI '04, ACM, 2004, p. 131–144.
• 71M. Wildmoser, A. Chaieb, T. Nipkow.
  
  Bytecode Analysis for Proof Carrying Code, in: Bytecode Semantics, Verification, Analysis and Transformation, 2005.
• 72M. 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.