EN FR
EN FR


previous Previous | up Home


Bibliography

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

    Proof-Carrying Code from Certified Abstract Interpretation to Fixpoint Compression, in: Theoretical Computer Science, 2006, vol. 364, no 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, no 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, no 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, no 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, no 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, no 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
Publications of the year

Doctoral Dissertations and Habilitation Theses

  • 10D. Demange.

    Semantic foundations of intermediate program representations, ENS Cachan, 2012.
  • 11A. Jobin.

    Diïdes et idéaux de polynômes en analyse statique, ENS Cachan, 2012.
  • 12D. Pichardie.

    Toward a Verified Software Toolchain for Java, ENS Cachan, 2012, Habilitation à Diriger des Recherches.

Articles in International Peer-Reviewed Journals

  • 13T. Jensen, F. Kirchner, D. Pichardie.

    Secure the Clones: Static Enforcement of Policies for Secure Object Copying, in: Logical Methods in Computer Science (LMCS), 2012, vol. 8, no 2.
  • 14J. Midtgaard, T. Jensen.

    Control Flow Analysis of Function Calls and Returns by Abstract Interpretation, in: Information and Computation, 2012, vol. 211, p. 49–76.

International Conferences with Proceedings

  • 15M. Abdalla, P.-A. Fouque, V. Lyubashevsky, M. Tibouchi.

    Tightly-Secure Signatures from Lossy Identification Schemes, in: Advances in Cryptology - EUROCRYPT 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7237, p. 572-590.

    http://www.di.ens.fr/~fouque
  • 16G. Barthe, D. Demange, D. Pichardie.

    A formally verified SSA-based middle-end - Static Single Assignment meets CompCert, in: Proc. of 21th European Symposium on Programming (ESOP 2012), Lecture Notes in Computer Science, Springer-Verlag, 2012, vol. 7211, p. 47-66.
  • 17F. Besson, P.-E. Cornilleau, R. Saillard.

    Walking through the Forest: a Fast EUF Proof-Checking Algorithm, in: Second International Workshop on Proof eXchange for Theorem Proving - PxTP 2012, 2012.
  • 18Y. Boichut, B. Boyer, T. Genet, A. Legay.

    Equational Abstraction Refinement for Certified Tree Regular Model Checking, in: ICFEM'12, Kyoto, Japon, LNCS, Springer-Verlag, 2012, no 7635, p. 299-315.

    http://hal.archives-ouvertes.fr/hal-00759149
  • 19D. Cachera, T. Jensen, A. Jobin, F. Kirchner.

    Inference of polynomial invariants for imperative programs: a farewell to Gröbner bases, in: SAS - 19th International Static Analysis Symposium - 2012, Deauville, France, September 2012, Projet Région Bretagne CertLogs.

    http://hal.inria.fr/hal-00758890
  • 20P.-E. Cornilleau.

    Prototyping Static Analysis Certification using Why3, in: Boogie 2012: Second International Workshop on Intermediate Verification Languages, 2012.
  • 21M. Daubignard, P.-A. Fouque, Y. Lakhnech.

    Generic Indifferentiability Proofs of Hash Designs, in: 25th IEEE Computer Security Foundations Symposium, CSF 2012, IEEE, 2012, p. 340-353.

    http://www.di.ens.fr/~fouque
  • 22P. Derbez, P.-A. Fouque, J. Jean.

    Faster Chosen-Key Distinguishers on Reduced-Round AES, in: Indocrypt 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7668, p. 225-243.

    http://www.di.ens.fr/~fouque
  • 23P.-A. Fouque, N. Guillermin, D. Leresteux, M. Tibouchi, J.-C. Zapalowicz.

    Attacking RSA-CRT Signatures with Faults on Montgomery Multiplication, in: Cryptographic Hardware and Embedded Systems - CHES 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7428, p. 447-462.

    http://www.di.ens.fr/~fouque
  • 24P.-A. Fouque, D. Leresteux, F. Valette.

    Using faults for buffer overflow effects, in: ACM Symposium on Applied Computing, SAC 2012, ACM, 2012, p. 1638-1639.

    http://www.di.ens.fr/~fouque
  • 25P.-A. Fouque, M. Tibouchi.

    Indifferentiable Hashing to Barreto-Naehrig Curves, in: LATINCRYPT 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7533, p. 1-17.

    http://www.di.ens.fr/~fouque
  • 26A. Hervieu, B. Baudry, A. Gotlieb.

    Managing Execution Environment Variability during Software Testing: an industrial experience, in: International Conference on Testing Software and Systems, Aalborg, Denmark, Springer, November 2012.

    http://hal.inria.fr/hal-00726137
  • 27J. Lu, Y. Wei, E. Pasalic, P.-A. Fouque.

    Meet-in-the-Middle Attack on Reduced Versions of the Camellia Block Cipher, in: International Workshop on Security, IWSEC 2012, Lecture Notes in Computer Science, Springer, 2012, vol. 7631, p. 197-215.

    http://www.di.ens.fr/~fouque

National Conferences with Proceeding

  • 28S. Boulier, A. Schmitt.

    Formalisation de HOCore en Coq, in: JFLA - Journées Francophones des Langages Applicatifs - 2012, Carnac, France, February 2012.

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

Conferences without Proceedings

  • 29R. Bedin França, S. Blazy, D. Favre-Felix, X. Leroy, M. Pantel, J. Souyris.

    Formally verified optimizing compilation in ACG-based flight control software, in: ERTS2 2012: Embedded Real Time Software and Systems, Toulouse, France, AAAF, SEE, February 2012.

    http://hal.inria.fr/hal-00653367
  • 30T. Genet, Y. Salmon.

    Proving Reachability Properties on Term Rewriting Systems with Strategies, in: 2nd Joint International Workshop on Strategies in Rewriting, Proving and Programming, IWS'12, London, 2012.

Internal Reports

Other Publications

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

    http://coq.inria.fr/
  • 37E. 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.
  • 38E. 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.
  • 39Andrew W. Appel.

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

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

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

    Light Logics and Optimal Reduction: Completeness and Complexity, in: LICS, 2007, p. 421-430.
  • 44E. 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.
  • 45G. 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.
  • 46F. Besson, T. Jensen.

    Modular Class Analysis with DATALOG, in: SAS'2003, 2003, p. 19-36.
  • 47F. 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
  • 48D. 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.
  • 49D. 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.
  • 50D. 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.
  • 51P. 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.
  • 52A. 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
  • 53G. 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.
  • 54C. Flanagan.

    Automatic software model checking via constraint logic, in: Sci. Comput. Program., 2004, vol. 50, no 1-3, p. 253-270.
  • 55M. Fähndrich, K. R. M. Leino.

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

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

    Reachability Analysis of Term Rewriting Systems with Timbuk, in: LPAR'01, LNAI, Springer, 2001, vol. 2250, p. 691-702.
  • 58P. Godefroid.

    Compositional dynamic test generation, in: POPL'07, 2007, p. 47-54.
  • 59D. Grove, C. Chambers.

    A framework for call graph construction algorithms, in: Toplas, 2001, vol. 23, no 6, p. 685–746.
  • 60D. 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.
  • 61M. Hofmann, S. Jost.

    Static prediction of heap space usage for first-order functional programs, in: POPL, 2003, p. 185-197.
  • 62L. 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.
  • 63L. 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.
  • 64O. 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.
  • 65V. 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.
  • 66A. 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.
  • 67M. Naik, A. Aiken.

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

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

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

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

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

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

    Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certiés, Université Rennes 1, Rennes, France, dec 2005.
  • 75A. 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.
  • 76A. Podelski.

    Model Checking as Constraint Solving, in: SAS'00, 2000, p. 22-37.
  • 77E. Rose.

    Lightweight Bytecode Verification, in: Journal of Automated Reasoning, 2003, vol. 31, no 3–4, p. 303–334.
  • 78A. 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.
  • 79P. 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.
  • 80F. Tip, J. Palsberg.

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

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

    Bytecode Analysis for Proof Carrying Code, in: Bytecode Semantics, Verification, Analysis and Transformation, 2005.
  • 83M. 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 Previous | up Home