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, n^o 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, 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.

[5]

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, n^o 11, p. 1755–1766, Special Issue: TAIC-PART 2007 and MUTATION 2007.

[6]

G. 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.

[7]

A. 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.

[8]

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

[9]

T. Genet.
Reachability Analysis of Rewriting for Software Verification, Université de Rennes 1, 2009, Habilitation à Diriger des Recherches.

Articles in International Peer-Reviewed Journal

[10]

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

[11]

S. Blazy, X. Leroy.
Mechanized semantics for the Clight subset of the C language, in: Journal of Automated Reasoning, 2009, vol. 43, n^o 3, p. 263-288.

[12]

T. Genet, V. Rusu.
Equational Tree Automata Completion, in: Journal of Symbolic Computation, 2010, To Appear.

[13]

A. Gotlieb.
TCAS software verification using Constraint Programming, in: The Knowledge Engineering Review, 2009, Under revision.

Articles in National Peer-Reviewed Journal

[14]

D. Cachera, D. Pichardie.
Programmation d'un interpréteur abstrait certifié en logique constructive, in: Technique et Science Informatiques (TSI), 2010, To appear.

International Peer-Reviewed Conference/Proceedings

[15]

F. Besson.
CPA beats oo-CFA, in: Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs, ACM, 2009, p. 1–6.

[16]

S. Blazy, B. Robillard, A. Appel.
Formal Verification of Coalescing Graph-Coloring Register Allocation, in: Proceedings of the 19th European Symposiumon Programming (ESOP 2010), Lecture Notes in Computer Science, Springer-Verlag, 2010, vol. 6012, 20 pages, to appear.

[17]

S. Blazy, B. Robillard.
Live-range Unsplitting for Faster Optimal Coalescing, in: Proceedings of the ACM SIGPLAN/SIGBED 2009 conference on Languages, Compilers, and Tools for Embedded Systems (LCTES 2009), ACM, 2009, p. 70–79
http://doi.acm.org/10.1145/1542452.1542462.

[18]

B. Boyer, T. Genet.
Verifying Temporal Regular properties of Abstractions of Term Rewriting Systems, in: Proc. of RULE'09, EPTCS, 2010, To Appear.

[19]

D. Cachera, D. Pichardie.
Comparing Techniques for Certified Static Analysis, in: Proc. of the 1st NASA Formal Methods Symposium (NFM'09), NASA Ames Research Center, 2009, p. 111-115.

[20]

F. Dabrowski, D. Pichardie.
A Certified Data Race Analysis for a Java-like Language, in: Proc. of 22nd International Conference on Theorem Proving in Higher Order Logics (TPHOLs'09), Lecture Notes in Computer Science, Springer-Verlag, 2009, vol. 5674, p. 212-227.

[21]

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.

[22]

A. Gotlieb, M. Petit.
Towards a Theory for Testing Non-terminating Programs, in: 33nd Annual IEEE International Computer Software and Applications Conference (COMPSAC'09), Seattle, USA, Jul. 2009, 6 pages.

[23]

G. Guette, O. Heen.
A TPM-based Architecture for Improved Security and Anonymity in Vehicular Ad hoc Networks, in: In International Vehicular Networking Conference (IEEE VNC 2009), 2009.

[24]

O. Heen, G. Guette, T. Genet.
On the Unobservability of a Trust Relation in Mobile Ad Hoc Networks, in: WISTP 2009 3rd edition, LNCS, Springer, 2009, vol. 5746.

[25]

L. Hubert, D. Pichardie.
Soundly Handling Static Fields: Issues, Semantics and Analysis, in: Proc. of the 4th International Workshop on Bytecode Semantics, Verification, Analysis and Transformation (BYTECODE'09), Electronic Notes in Theoretical Computer Science, 2009, vol. 253, n^o 5, p. 15–30.

[26]

J. Midtgaard, T. Jensen.
Control-flow analysis of function calls and returns by abstract interpretation, in: Proceedings of the 14th ACM international conference on Functional programming, ACM, 2009, p. 287–298.

Scientific Books (or Scientific Book chapters)

[27]

F. Besson, D. Cachera, T. Jensen, D. Pichardie.
Certified Static Analysis by Abstract Interpretation, in: Foundations of Security Analysis and Design V, FOSAD 2007/2008/2009 Tutorial Lectures, Lecture Notes in Computer Science, Springer-Verlag, 2009, vol. 5705, p. 223-257.

Internal Reports

[28]

D. Demange, T. Jensen, D. Pichardie.
A Provably Correct Stackless Intermediate Representation For Java Bytecode, INRIA, 2009, n^o RR-7021
http://hal.inria.fr/inria-00414099/en/, Research Report.

[29]

T. Turpin, F. Besson, T. Jensen.
Computing the Least Fix-point Semantics of Logic Programs Using BDDs, INRIA, 2009, n^o 7107, Research Report.

References in notes

[30]

The Coq Proof Assistant, 2009
http://coq.inria.fr/.

[31]

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.

[32]

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.

[33]

A. W. Appel.
Foundational Proof-Carrying Code, in: Logic in Computer Science, J. Halpern (editor), IEEE Press, June 2001, 247 p, Invited Talk.

[34]

A. W. Appel, Amy P. Felty.
A Semantic Model of Types and Machine Instructions for Proof-Carrying Code, in: Principles of Programming Languages, ACM, 2000.

[35]

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.

[36]

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.

[37]

D. F. Bacon, P. F. Sweeney.
Fast Static Analysis of C++ Virtual Function Calls, in: OOPSLA'96, 1996, p. 324-341.

[38]

P. Baillot, P. Coppola, U. D. Lago.
Light Logics and Optimal Reduction: Completeness and Complexity, in: LICS, 2007, p. 421-430.

[39]

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.

[40]

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.

[41]

F. Besson, T. P. Jensen.
Modular Class Analysis with DATALOG, in: SAS'2003, 2003, p. 19-36.

[42]

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.

[43]

Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Automatic Verification of Security Protocols Using Approximations, INRIA, 2005, n^o RR 5727, Research Report.

[44]

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.

[45]

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.

[46]

D. 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.

[47]

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.

[48]

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.

[49]

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.

[50]

M. Fähndrich, K. R. M. Leino.
Declaring and checking non-null types in an object-oriented language, in: OOPSLA, 2003, p. 302-312.

[51]

C. Flanagan.
Automatic software model checking via constraint logic., in: Sci. Comput. Program., 2004, vol. 50, n^o 1-3, p. 253-270.

[52]

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

[53]

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.

[54]

T. Genet, V. Viet Triem Tong.
Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation, INRIA, 2002, n^o RR-4576, Technical report.

[55]

P. Godefroid.
Compositional dynamic test generation., in: POPL'07, 2007, p. 47-54.

[56]

D. Grove, C. Chambers.
A framework for call graph construction algorithms, in: Toplas, 2001, vol. 23, n^o 6, p. 685–746.

[57]

D. 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.

[58]

M. Hofmann, S. Jost.
Static prediction of heap space usage for first-order functional programs, in: POPL, 2003, p. 185-197.

[59]

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.

[60]

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.

[61]

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, n^o 1.

[62]

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.

[63]

J. Meseguer, M. Palomino, N. Martí-Oliet.
Equational abstractions, in: TCS, 2008, vol. 403, n^o 2-3, p. 239-264.

[64]

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.

[65]

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, n^o 1, p. 1–41.

[66]

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.

[67]

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

[68]

M. Naik, A. Aiken, J. Whaley.
Effective static race detection for Java, in: PLDI'2006, ACM, 2006, p. 308-319.

[69]

G. Necula.
Proof-carrying code, in: Proceedings of POPL'97, ACM Press, 1997, p. 106–119.

[70]

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.

[71]

F. Nielson, H. Nielson, C. Hankin.
Principles of Program Analysis, Springer, 1999.

[72]

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.

[73]

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.

[74]

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.

[75]

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

[76]

J. Palsberg, M. Schwartzbach.
Object-Oriented Type Systems, John Wiley & Sons, 1994.

[77]

D. Pichardie.
Interprétation abstraite en logique intuitionniste : extraction d'analyseurs Java certiés, Université Rennes 1, Rennes, France, dec 2005, Ph. D. Thesis.

[78]

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.

[79]

A. Podelski.
Model Checking as Constraint Solving, in: SAS'00, 2000, p. 22-37.

[80]

E. Rose.
Lightweight Bytecode Verification, in: Journal of Automated Reasoning, 2003, vol. 31, n^o 3–4, p. 303–334.

[81]

A. 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.

[82]

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.

[83]

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.

[84]

F. Tip, J. Palsberg.
Scalable propagation-based call graph construction algorithms, in: OOPSLA, 2000, p. 281-293.

[85]

J. Whaley, M. S. Lam.
Cloning-based context-sensitive pointer alias analysis using binary decision diagrams, in: PLDI '04, ACM, 2004, p. 131–144.

[86]

M. Wildmoser, A. Chaieb, T. Nipkow.
Bytecode Analysis for Proof Carrying Code, in: Bytecode Semantics, Verification, Analysis and Transformation, 2005.

[87]

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.