1. B. Botella, A. Gotlieb, and C. Michel. Symbolic execution of floating-point computations. The Software Testing, Verification and Reliability journal, 2006. Note: To appear. Keyword(s): Symbolic execution, Floating-point computations, Automatic test data generation, Constraint solving. [Abstract] [bibtex-entry]

1. F. Besson, T. de Grenier de Latour, and T. Jensen. Interfaces for stack inspection. Journal of Functional Programming, 15(2):179--217, 2005. [WWW ] [Abstract] [bibtex-entry]



2. David Cachera, Thomas Jensen, David Pichardie, and Vlad Rusu. Extracting a Data Flow Analyser in Constructive Logic. Theoretical Computer Science, 2005. [Abstract] [bibtex-entry]



3. David Cachera and Katell Morin-Allory. Verification of safety properties for parameterized regular systems. Trans. on Embedded Computing Systems, 4(2):228--266, 2005. [Abstract] [bibtex-entry]

1. L. Langevine, P. Deransart, and M. Ducassé. A Generic Trace Schema for the Portability of CP(FD) Debugging Tools. In J. Vancza, K. Apt, F. Fages, F. Rossi, and P. Szeredi, editors, Recent advances in Constraint Programming, pages 171--195. Springer-Verlag, Lecture Notes in Artificial Intelligence 3010, 2004. [bibtex-entry]



2. Hervé Debar, Benjamin Morin, Frédéric Cuppens, Fabien Autrel, Ludovic Mé, Bernard Vivinis, Salem Benferhat, Mireille Ducassé, and Rodolphe Ortalo. Corrélation d'alertes en détection d'intrusions. Technique et Science Informatiques, 23(3):323--358, 2004. [bibtex-entry]



3. M. Eluard and T. Jensen. Vérification du contrôle d'accès dans des cartes à puce multi-application. Technique et Science Informatiques, 23(3):323--358, 2004. [bibtex-entry]



4. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Journal of Automated Reasoning, 33 (3-4):341-383, 2004. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [Abstract] [bibtex-entry]



5. T. Jensen and J.-L. Lanet. Modélisation et vérification dans les cartes à puce. Revue d'électricité et de l'électronique, 6/7:89--94, 2004. [bibtex-entry]



6. Gerardo Schneider. Computing Invariance Kernels of Polygonal Hybrid Systems. Nordic Journal of Computing, 11(2):194--210, 2004. [POSTSCRIPT ] Keyword(s): hybrid system, differential inclusion, SPDI, invariance kernel, phase portrait. [bibtex-entry]

1. Rémi Douence, Pascal Fradet, and Mario Südholt. Trace-Based Aspects. In Mehmet Aksit et al., editor, Aspect-Oriented Software Development. Addison-Wesley, 2003. [bibtex-entry]



2. A. Banerjee and T. Jensen. Control-flow analysis with rank-2 intersection types. Mathematical Structures in Computer Science, 13(1):87--124, 2003. [bibtex-entry]



3. Rémi Douence and Pascal Fradet. The next 700 Krivine Machines. Higher-Order and Symbolic Computation, 2003. Note: \toappear. [bibtex-entry]



4. F. Spoto and T. Jensen. Class Analyses as Abstract Interpretations of Trace Semantics. ACM Transactions on Programming Languages and Systems (TOPLAS), 25(5):578--630, 2003. [bibtex-entry]

1. T. Jensen. Types in program analysis. In Torben Mogensen, David Schmidt, and I. Hal Sudborough, editors, The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones, Lecture Notes in Computer Science 2566, pages 204--222. Springer-Verlag, 2002. [bibtex-entry]



2. E. Denney and T. Jensen. Correctness of Java Card method lookup via logical relations. Theoretical Computer Science, 283:305--331, 2002. [bibtex-entry]



3. E. Jahier and M. Ducassé. Generic Program Monitoring by Trace Analysis. Theory and Practice of Logic Programming, 2(4-5), September 2002. [bibtex-entry]



4. Siegfried Rouvrais. Construction de services distribués : une approche à base d'agents mobiles. TSI-HERMES / RSTI - TSI. Volume 21 - n° 7, pp 985-1007, 2002. [bibtex-entry]

1. F. Besson, T. Jensen, D. Le Métayer, and T. Thorn. Model ckecking security properties of control flow graphs. Journal of Computer Security, 9:217--250, 2001. [WWW ] [Abstract] [bibtex-entry]



2. M. Ducassé and E. Jahier. Efficient Automated Trace Analysis: Examples with Morphine. Electronic Notes in Theoretical Computer Science, 55(2), 2001. Note: K. Havelund and G. Rosu (Eds), proceedings of the first Workshop on Runtime Verification. [bibtex-entry]



3. Olivier Ridoux and Patrice Boizumault. Typed Static Analysis: Application to the Groundness Analysis of Typed Prolog. Journal of Functional and Logic Programming, 2001(4), July 2001. [bibtex-entry]

1. J.-P. Banâtre, P. Fradet, and D. Le Métayer. Gamma and the chemical reaction model: fifteen years after. In C.S. Calude, Gh. Paun, G. Rozenberg, and A. Salomaa, editors, Multiset Processing. Springer-Verlag, 2000. [bibtex-entry]



2. M. Ducassé and J. Noyé. Tracing Prolog programs by source instrumentation is efficient enough. Elsevier Journal of Logic Programming,, 43(2):157-172, May 2000. [WWW ] Keyword(s): Debugging, tracing, source to source transformation, benchmarking, Prolog.. [Abstract] [bibtex-entry]



3. P. Fradet and J. Mallet. Compilation of a Specialized Functional Language for Massively Parallel Computers. Journal of Functional Programming, 2000. [bibtex-entry]

1. M. Ducassé. Abstract views of Prolog executions with Opium. In P. Brna, B. du Boulay, and H. Pain, editors, Learning to Build and Comprehend Complex Information Structures: Prolog as a Case Study, Cognitive Science and Technology. Ablex, 1999. [WWW ] Keyword(s): Software engineering, Programming environment, Automated debugging, Trace abstraction mechanisms, Debugging language, Program behavior understanding, Prolog Debugging tool. [Abstract] [bibtex-entry]



2. C. Belleannée, P. Brisset, and O. Ridoux. A Pragmatic Reconstruction of $\lambda$Prolog. J. Logic Programming, 41(1):67--102, 1999. [bibtex-entry]



3. M. Ducassé. Opium: An extendable trace analyser for Prolog. The Journal of Logic programming, 1999. Note: Special issue on Synthesis, Transformation and Analysis of Logic Programs, A. Bossi and Y. Deville (eds), Also Rapport de recherche INRIA RR-3257 and Publication Interne IRISA PI-1127. [WWW ] Keyword(s): Software Engineering, Automated Debugging, Trace Query Language, Program Execution Analysis, Abstract Views of Program Executions, Prolog. [Abstract] [bibtex-entry]



4. V. Gouranton and D. Le Métayer. Dynamic slicing: a generic analysis based on a natural semantics format. Journal of Logic and Computation, 9(6):835-871, December 1999. [Abstract] [bibtex-entry]



5. D. Mentré, D. Le Métayer, and T. Priol. Conception de protocoles de cohérence de MVP par traduction d'une spécification Gamma à l'aide d'aspects. Calculateurs Parallèles, 11(2), 1999. [bibtex-entry]



6. D. Le Métayer. Foreword to the special issue on coordination and mobility. Theoretical Computer Science, 240(1), 1999. [bibtex-entry]

1. R. Douence and P. Fradet. A systematic study of functional language implementations. ACM Transactions on Programming Languages and Systems, 20(2):344--387, 1998. [WWW ] [Abstract] [bibtex-entry]



2. P. Fradet and D. Le Métayer. Structured Gamma. Science of Computer Programming, 31(2-3):263--289, 1998. [WWW ] [Abstract] [bibtex-entry]



3. D. Le Métayer, V.-A. Nicolas, and O. Ridoux. Programs, Properties, and Data: Exploring the Software Development Trilogy. IEEE Software, 15(6):75-81, November/December 1998. [WWW ] Keyword(s): Software engineering, testing, verification, program analysis, program learning. [Abstract] [bibtex-entry]

1. C.L. Hankin, D. Le Métayer, and D. Sands. Refining multiset transformers. Theoretical Computer Science, 1997. [WWW ] Keyword(s): program transformation, composition operator, parallelism, Gamma, chemical reaction. [Abstract] [bibtex-entry]



2. T. Jensen. Disjunctive Program Analysis for Algebraic Data Types. ACM Transactions on Programming Languages and Systems, 19(5):752--804, 1997. [WWW ] [Abstract] [bibtex-entry]



3. D. Le Métayer. Program analysis for software engineering: new applications, new requirements, new tools. ACM Sigplan Notices, (1):86-88, January 1997. [WWW ] Keyword(s): program analysis, debugging, testing, correctness, scalability, interaction. [Abstract] [bibtex-entry]



4. T. Thorn. Programming Languages for Mobile Code. ACM Computing Surveys, 29(3):213--239, September 1997. [WWW ] Keyword(s): mobile code, distribution, network programming, portability, safety, security, object orientation, formal methods, Java, Obliq, Limbo, Safe-Tcl, Objective Caml, Telescript.. [Abstract] [bibtex-entry]

1. G. Burn and D. Le Métayer. Proving the correctness of compiler optimisations based on a global analysis: a study of strictness analysis. Journal of Functional Programming, 6(1):75-109, 1996. [WWW ] [Abstract] [bibtex-entry]

1. C. Belleannée, P. Brisset, and O. Ridoux. Une reconstruction pragmatique de $\lambda$Prolog. Technique et science informatiques, 14:1131--1164, 1995. [WWW ] Keyword(s): Programmation logique, LambdaProlog, lambda-calcul, quantifications, types. logic programming, LambdaProlog, lambda-calculus, quantifications, types.. [Abstract] [bibtex-entry]



2. S. Coupet-Grimal and O. Ridoux. On the use of Advanced Logic Programming Languages in Computational Linguistics. J. Logic Programming, 24(1&2):121--159, 1995. [WWW ] Keyword(s): Logic programming, computational linguistics, LambdaProlog, Prolog II, lambda-terms, rational terms.. [Abstract] [bibtex-entry]



3. C.L. Hankin and D. Le Métayer. Lazy types and program analysis. Science of Computer Programming, 1995. [Abstract] [bibtex-entry]

1. M. Ducassé and J. Noyé. Logic Programming Environments: Dynamic program analysis and debugging. The Journal of Logic Programming, 19/20:351-384, May/July 1994. Note: Anniversary issue: Ten years of Logic Programming. [WWW ] [Abstract] [bibtex-entry]

1. M. Ducassé and A.-M. Emde. Opium: a debugging environment for Prolog development and debugging research. ACM Software Engineering Notes, 16(1):54-59, January 1991. Note: Demonstration presented at the Fourth Symposium on Software Development Environments. [Abstract] [bibtex-entry]



2. P. Fradet and D. Le Métayer. Compilation of functional languages by program transformation. ACM Transactions on Programming Languages and Systems, 13(1):21--51, 1991. [WWW ] [Abstract] [bibtex-entry]

This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All person copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

Les documents contenus dans ces répertoires sont rendus disponibles par les auteurs qui y ont contribué en vue d'assurer la diffusion à temps de travaux savants et techniques sur une base non-commerciale. Les droits de copie et autres droits sont gardés par les auteurs et par les détenteurs du copyright, en dépit du fait qu'ils présentent ici leurs travaux sous forme électronique. Les personnes copiant ces informations doivent adhérer aux termes et contraintes couverts par le copyright de chaque auteur. Ces travaux ne peuvent pas être rendus disponibles ailleurs sans la permission explicite du détenteur du copyright.

This document was translated from BibT_EX by bibtex2html