EN FR
EN FR


previous Previous | up Home


Bibliography

Major publications by the team in recent years
  • 1F. Besson, N. Bielova, T. Jensen.

    Hybrid Information Flow Monitoring Against Web Tracking, in: CSF - 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, United States, 2013. [ DOI : 10.1109/CSF.2013.23 ]

    http://hal.inria.fr/hal-00924138
  • 2F. Besson, T. Jensen, D. Pichardie.

    Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Theoretical Computer Science, 2006, vol. 364, no 3, pp. 273–291.
  • 3F. 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, pp. 642-666.
  • 4M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.

    A Trusted Mechanised JavaScript Specification, in: POPL 2014 - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States, November 2013.

    http://hal.inria.fr/hal-00910135
  • 5B. 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, pp. 347–362.
  • 6D. 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, pp. 589-624.
  • 7D. Cachera, T. Jensen, D. Pichardie, V. Rusu.

    Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, no 1, pp. 56–78.
  • 8D. Demange, V. Laporte, L. Zhao, D. Pichardie, S. Jagannathan, J. Vitek.

    Plan B: A Buffered Memory Model for Java, in: Proc. of the 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, ACM, 2013.

    http://hal.inria.fr/hal-00924716
  • 9T. Genet, V. Rusu.

    Equational Approximations for Tree Automata Completion, in: Journal of Symbolic Computation, 2010, vol. 45(5):574-597, May 2010, no 5, pp. 574-597.

    http://hal.inria.fr/inria-00495405
  • 10A. 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, pp. 1030–1044.
  • 11L. 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, pp. 101-115.

    http://hal.inria.fr/inria-00503953
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 12P.-E. Cornilleau.

    Certification of static analysis in many-sorted first-order logic, École normale supérieure de Cachan - ENS Cachan, March 2013.

    http://hal.inria.fr/tel-00846347
  • 13Z. Fu.

    Static analysis of numerical properties in the presence of pointers, Université Rennes 1 and Université européenne de Bretagne, July 2013.

    http://hal.inria.fr/tel-00918593

Articles in International Peer-Reviewed Journals

  • 14G. Barthe, D. Pichardie, T. Rezk.

    A certified lightweight non-interference Java bytecode verifier, in: Mathematical Structures in Computer Science, June 2013, vol. 23, no 5, pp. 1032-1081. [ DOI : 10.1017/S0960129512000850 ]

    http://hal.inria.fr/hal-00915189
  • 15N. Bielova.

    Survey on JavaScript Security Policies and their Enforcement Mechanisms in a Web Browser, in: Journal of Logic and Algebraic Programming, 2013, vol. 82, no 8, pp. 243-262. [ DOI : 10.1016/j.jlap.2013.05.001 ]

    http://hal.inria.fr/hal-00932730
  • 16D. Cachera, T. Jensen, A. Jobin, F. Kirchner.

    Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases, in: Science of Computer Programming, 2014, To appear.

    http://hal.inria.fr/hal-00932351

International Conferences with Proceedings

  • 17A. A. Amorim, N. Collins, A. DeHon, D. Demange, C. Hritcu, D. Pichardie, B. C. Pierce, R. Pollack, A. Tolmach.

    A Verified Information-Flow Architecture, in: 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL), San Diego, CA, United States, 2014, To appear. [ DOI : 10.1145/2535838.2535839 ]

    http://hal.inria.fr/hal-00918847
  • 18R. Bagnara, M. Carlier, R. Gori, A. Gotlieb.

    Symbolic Path-Oriented Test Data Generation for Floating-Point Programs, in: Proc. of the 6th IEEE Int. Conf. on Software Testing, Verification and Validation (ICST'13), Luxembourg, Luxembourg, 2013.

    http://hal.inria.fr/hal-00807884
  • 19F. Besson, N. Bielova, T. Jensen.

    Hybrid Information Flow Monitoring Against Web Tracking, in: CSF - 2013 IEEE 26th Computer Security Foundations Symposium, New Orleans, United States, 2013. [ DOI : 10.1109/CSF.2013.23 ]

    http://hal.inria.fr/hal-00924138
  • 20F. Besson, P.-E. Cornilleau, T. Jensen.

    Result Certification of Static Program Analysers with Automated Theorem Provers, in: VSTTE 2013 - Fifth Working Conference on Verified Software: Theories, Tools and Experiments, Atherthon, United States, 2013.

    http://hal.inria.fr/hal-00924167
  • 21S. Blazy, V. Laporte, A. Maroneze, D. Pichardie.

    Formal Verification of a C Value Analysis Based on Abstract Interpretation, in: SAS - 20th Static Analysis Symposium, Seattle, United States, M. Fahndrich, F. Logozzo (editors), Springer, 2013, vol. Lecture Notes in Computer Science, pp. 324-344.

    http://hal.inria.fr/hal-00812515
  • 22S. Blazy, A. Maroneze, D. Pichardie.

    Formal Verification of Loop Bound Estimation for WCET Analysis, in: VSTTE - Verified Software: Theories, Tools and Experiments, Menlo Park, United States, E. Cohen, A. Rybalchenko (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8164, pp. 281-303.

    http://hal.inria.fr/hal-00848703
  • 23S. Blazy, S. Riaud.

    Measuring the Robustness of Source Program Obfuscation - Studying the Impact of Compiler Optimizations on the Obfuscation of C Programs, in: Fourth ACM Conference on Data and Application Security and Privacy - SIGSAC ACM CODASPY 2014, San Antonio, United States, 2014.

    http://hal.inria.fr/hal-00927427
  • 24M. Bodin, A. Charguéraud, D. Filaretti, P. Gardner, S. Maffeis, D. Naudziuniene, A. Schmitt, G. Smith.

    A Trusted Mechanised JavaScript Specification, in: POPL 2014 - 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Diego, United States, November 2013.

    http://hal.inria.fr/hal-00910135
  • 25M. Bodin, A. Schmitt.

    A Certified JavaScript Interpreter, in: JFLA - Journées francophones des langages applicatifs, Aussois, France, D. Pous, C. Tasson (editors), Damien Pous and Christine Tasson, February 2013.

    http://hal.inria.fr/hal-00779459
  • 26D. Demange, V. Laporte, L. Zhao, D. Pichardie, S. Jagannathan, J. Vitek.

    Plan B: A Buffered Memory Model for Java, in: Proc. of the 40th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2013, Rome, Italy, ACM, 2013.

    http://hal.inria.fr/hal-00924716
  • 27T. Genet, T. Le Gall, A. Legay, V. Murat.

    Tree Regular Model Checking for Lattice-Based Automata, in: CIAA - 18th International Conference on Implementation and Application of Automata, Halifax, Canada, LNCS, Springer, 2013, vol. 7982.

    http://hal.inria.fr/hal-00924849
  • 28A. Gotlieb, T. Denmat, N. Lazaar.

    Constraint-based reachability, in: Infinity workshop 2012, Paris, France, 2013. [ DOI : 10.4204/EPTCS.107.4, Source: arXiv ]

    http://hal.inria.fr/hal-00807856
  • 29J. Kriener, A. King, S. Blazy.

    Proofs You Can Believe In. Proving Equivalences Between Prolog Semantics in Coq, in: 15th International Symposium on Principles and Practice of Declarative Programming (PPDP), Madrid, Spain, T. Schrijvers (editor), ACM, September 2013, pp. 37-48.

    http://hal.inria.fr/hal-00908848
  • 30I. Lanese, M. Lienhardt, C. Mezzina, A. Schmitt, J.-B. Stefani.

    Concurrent Flexible Reversibility, in: 22nd European Symposium on Programming, ESOP 2013, Rome, Italy, M. Felleisen, P. Gardner (editors), Lecture Notes in Computer Science (LNCS), Springer, March 2013, vol. 7792, pp. 370-390. [ DOI : 10.1007/978-3-642-37036-6_21 ]

    http://hal.inria.fr/hal-00811629
  • 31D. Marijan, A. Gotlieb, S. Sen, A. Hervieu.

    Practical Pairwise Testing for Software Product Lines, in: SPLC 2013, Tokyo, Japan, August 2013.

    http://hal.inria.fr/hal-00859438

National Conferences with Proceedings

  • 32M. Bodin, T. Jensen, A. Schmitt.

    Pretty-big-step-semantics-based Certified Abstract Interpretation, in: JFLA - 25ème Journées Francophones des Langages Applicatifs - 2014, Fréjus, France, January 2014.

    http://hal.inria.fr/hal-00927400

Scientific Books (or Scientific Book chapters)

  • 33X. Leroy, A. W. Appel, S. Blazy, G. Stewart.

    The CompCert memory model, in: Program Logics for Certified Compilers, A. W. Appel (editor), Cambridge University Press, April 2014.

    http://hal.inria.fr/hal-00905435

Books or Proceedings Editing

  • 34S. Blazy, C. Paulin-Mohring, D. Pichardie (editors)

    Interactive Theorem Proving - 4th International Conference, ITP 2013, Rennes, France, July 22-26, 2013. Proceedings, Lecture Notes in Computer Science, Springer, 2013, vol. 7998, 500 p. [ DOI : 10.1007/978-3-642-39634-2 ]

    http://hal.inria.fr/hal-00908865

Internal Reports

Other Publications

References in notes
  • 42The Coq Proof Assistant, 2009.

    http://coq.inria.fr/
  • 43E. 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, pp. 113-132.
  • 44E. 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, pp. 380-397.
  • 45Andrew W. Appel.

    Foundational Proof-Carrying Code, in: Logic in Computer Science, J. Halpern (editor), IEEE Press, June 2001, 247 p, Invited Talk.
  • 46Andrew W. Appel, Amy P. Felty.

    A Semantic Model of Types and Machine Instructions for Proof-Carrying Code, in: Principles of Programming Languages, ACM, 2000.
  • 47D. 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, pp. 34–49.
  • 48D. F. Bacon, P. F. Sweeney.

    Fast Static Analysis of C++ Virtual Function Calls, in: OOPSLA'96, 1996, pp. 324-341.
  • 49P. Baillot, P. Coppola, U. D. Lago.

    Light Logics and Optimal Reduction: Completeness and Complexity, in: LICS, 2007, pp. 421-430.
  • 50E. 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, pp. 67-82.
  • 51G. 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, pp. 125-140.
  • 52F. Besson, T. Jensen.

    Modular Class Analysis with DATALOG, in: SAS'2003, 2003, pp. 19-36.
  • 53F. 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, pp. 971-998.

    http://hal.inria.fr/inria-00537821
  • 54D. 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, pp. 122-138.
  • 55D. Cachera, T. Jensen, D. Pichardie, V. Rusu.

    Extracting a Data Flow Analyser in Constructive Logic, in: Theoretical Computer Science, 2005, vol. 342, no 1, pp. 56–78.
  • 56D. 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.
  • 57P. 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, pp. 238–252.
  • 58A. 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
  • 59G. Feuillade, T. Genet, V. Viet Triem Tong.

    Reachability Analysis over Term Rewriting Systems, in: Journal of Automated Reasoning, 2004, vol. 33, no 3–4, pp. 341–383.
  • 60M. Fähndrich, K. R. M. Leino.

    Declaring and checking non-null types in an object-oriented language, in: OOPSLA, 2003, pp. 302-312.
  • 61T. Genet.

    Decidable Approximations of Sets of Descendants and Sets of Normal forms, in: RTA'98, LNCS, Springer, 1998, vol. 1379, pp. 151–165.
  • 62T. Genet, V. Viet Triem Tong.

    Reachability Analysis of Term Rewriting Systems with Timbuk, in: LPAR'01, LNAI, Springer, 2001, vol. 2250, pp. 691-702.
  • 63D. Grove, C. Chambers.

    A framework for call graph construction algorithms, in: Toplas, 2001, vol. 23, no 6, pp. 685–746.
  • 64D. Grove, G. DeFouw, J. Dean, C. Chambers.

    Call graph construction in object-oriented languages, in: ACM SIGPLAN Notices, 1997, vol. 32, no 10, pp. 108–124.
  • 65M. Hofmann, S. Jost.

    Static prediction of heap space usage for first-order functional programs, in: POPL, 2003, pp. 185-197.
  • 66L. 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.
  • 67L. 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, pp. 132-149.
  • 68O. 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.
  • 69V. B. Livshits, M. S. Lam.

    Finding Security Errors in Java Programs with Static Analysis, in: Proc. of the 14th Usenix Security Symposium, 2005, pp. 271–286.
  • 70A. 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, pp. 1–41.
  • 71M. Naik, A. Aiken.

    Conditional must not aliasing for static race detection, in: POPL'07, ACM, 2007, pp. 327-338.
  • 72M. Naik, A. Aiken, J. Whaley.

    Effective static race detection for Java, in: PLDI'2006, ACM, 2006, pp. 308-319.
  • 73G. C. Necula.

    Proof-carrying code, in: Proceedings of POPL'97, ACM Press, 1997, pp. 106–119.
  • 74G. 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, pp. 248-260.
  • 75F. Nielson, H. Nielson, C. Hankin.

    Principles of Program Analysis, Springer, 1999.
  • 76J. Palsberg, M. Schwartzbach.

    Object-Oriented Type Inference, in: OOPSLA'91, 1991, pp. 146-161.
  • 77J. Palsberg, M. Schwartzbach.

    Object-Oriented Type Systems, John Wiley & Sons, 1994.
  • 78D. Pichardie.

    Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certiés, Université Rennes 1, Rennes, France, dec 2005.
  • 79A. D. Pierro, H. Wiklicky.

    Operator Algebras and the Operational Semantics of Probabilistic Languages, in: Electr. Notes Theor. Comput. Sci., 2006, vol. 161, pp. 131-150.
  • 80E. Rose.

    Lightweight Bytecode Verification, in: Journal of Automated Reasoning, 2003, vol. 31, no 3–4, pp. 303–334.
  • 81A. Sabelfeld, A. C. Myers.

    Language-based Information-Flow Security, in: IEEE Journal on Selected Areas in Communication, January 2003, vol. 21, no 1, pp. 5–19.
  • 82P. 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, pp. 153-167.
  • 83F. Tip, J. Palsberg.

    Scalable propagation-based call graph construction algorithms, in: OOPSLA, 2000, pp. 281-293.
  • 84J. Whaley, M. S. Lam.

    Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, in: PLDI '04, ACM, 2004, pp. 131–144.
  • 85M. Wildmoser, A. Chaieb, T. Nipkow.

    Bytecode Analysis for Proof Carrying Code, in: Bytecode Semantics, Verification, Analysis and Transformation, 2005.
  • 86M. 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, pp. 333–347.


previous Previous | up Home