1. G. Le Guernic, A. Banerjee, and D. Schmidt. Automaton-based Non-interference Monitoring. Technical report 2006-1, Department of Computing and Information Sciences, College of Engineering, Kansas State University, 234 Nichols Hall, Manhattan, KS 66506, USA, April 2006. [Abstract] [bibtex-entry]

1. F. Besson, T. Jensen, and D. Pichardie. A PCC Architecture based on Certified Abstract Interpretation. Research Report RR-5751, INRIA, November 2005. Note: Also Publication Interne IRISA PI-1764. [PDF ] [bibtex-entry]



2. David Cachera and Katell Morin-Allory. Proving Parameterized Systems: the use of a widening operator and pseudo-pipelines in polyhedral logic. Technical report TIMA-RR--05/04-01--FR, TIMA-IMAG, 2005. [Abstract] [bibtex-entry]



3. T. Denmat, M. Ducassé, and O. Ridoux. Data Mining and Cross-checking of Execution Traces. A re-interpretation of Jones, Harrold and Stasko test information visualization (Long version). Research Report RR-5661, INRIA, August 2005. Note: Also Publication Interne IRISA PI-1743. [WWW ] [bibtex-entry]



4. L. Langevine and M. Ducassé. A Tracer Driver to Enable Concurrent Dynamic Analyses. Research Report RR-5611, INRIA, June 2005. [WWW ] [bibtex-entry]

1. The OADymPPaC Consortium. GENTRA4CP: Generic Trace Format for Constraint Programming. Livrable du projet RNTL OADymPPaC, INRIA, July 2004. Note: Http://contraintes.inria.fr/OADymPPaC. [bibtex-entry]



2. J.-P. Pouzol, S. Benferhat, H. Debar, M. Ducassé, E. Fayol, S. Gombault, J. Goubault-Larrecq, Y. Lavictoire, L. Mé, L. Noé, J. Olivain, E. Totel, and B. Vivinis. Rapport de synthèse sur la création de sondes de détection d'intrusions. Livrable du projet RNTL DICO, Juillet 2004. Note: 121 pages. [bibtex-entry]



3. Gerardo Schneider. A constraint-based algorithm for analysing memory usage on Java cards. Technical report RR-5440, INRIA, December 2004. [POSTSCRIPT ] Keyword(s): static analysis, memory analysis, constraint-based algorithm, Java card. [bibtex-entry]

1. David Cachera and Katell Morin-Allory. Verification of Control Properties in the Polyhedral Model. Technical report 1515, INRIA, 2003. [WWW ] [bibtex-entry]



2. David Cachera and David Pichardie. Proof Tactics for the Verification of Structured Systems of Affine Recurrence Equations. Technical report 1511, INRIA, 2003. [WWW ] [bibtex-entry]



3. G. Feuillade, T. Genet, and V. Viet Triem Tong. Reachability Analysis over Term Rewriting Systems. Technical report RR-4970, INRIA, 2003. [WWW ] Keyword(s): Term Rewriting, Reachability, Tree Automata, Approximations, Verification, Timbuk, Abstract Interpretation. [bibtex-entry]



4. Jean Goubault-Larrecq, Stéphane Demri, Mireille Ducassé, Ludovic Mé, Julien Olivain, Claudine Picaronny, Jean-Philippe Pouzol, Eric Totel, and Bernard Vivinis. Algorithmes de détection et langages de signatures. Livrable 3.3, Projet RNTL DICO, http://dico.netsecuresoftware.com//index.htm, Octobre 2003. [bibtex-entry]

1. Rémi Douence, Pascal Fradet, and Mario Südholt. Detection and resolution of aspect interactions. Rapport de recherche 4435, Inria, Avril 2002. [bibtex-entry]



2. T. Genet and V. Viet Triem Tong. Proving Negative Conjectures on Equational Theories using Induction and Abstract Interpretation. Technical report RR-4576, INRIA, 2002. [WWW ] Keyword(s): Equational theories, proof by induction, abstract interpretation, rewriting. [bibtex-entry]

1. Rémi Douence, Pascal Fradet, and Mario Südholt. A study of aspect interactions. Publication interne 1422, IRISA, 2001. [bibtex-entry]



2. M. Ducassé and L. Rozé. Revisiting the ``Traffic lights'' B case study. Publication Interne 1424, IRISA, November 2001. [bibtex-entry]



3. Thomas Genet and Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with \sl Timbuk (extended version). Technical Report RR-4266, INRIA, 2001. [WWW ] [Abstract] [bibtex-entry]



4. Siegfried Rouvrais. Construction de services distribués: une approche à base d'agents mobiles. Publication interne 1421, IRISA, novembre 2001. [bibtex-entry]

1. P. Fradet and J. Mallet. Compilation of a Specialized Functional Language for Massively Parallel Computers. Technical report 3894, INRIA, march 2000. [WWW ] Keyword(s): Skeletons, polytopes, data parallelism, cost analysis, program transformation. [Abstract] [bibtex-entry]



2. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification (extended version). Technical Report 3921, INRIA, 2000. [WWW ] [Abstract] [bibtex-entry]

1. S. Mallet and M. Ducassé. Myrtle: A set-oriented meta-interpreter driven by a ``relational'' trace for deductive database debugging. Research Report RR-3598, INRIA, January 1999. [WWW ] Keyword(s): deductive databases, debugging, trace, multi-SLD-AL, meta-interpreter, substitution set, instrumentation. [Abstract] [bibtex-entry]

1. M. Ducassé. Coca: A Debugger for C Based on Fine Grained Control Flow and Data Events. Technical report IRISA PI 1202 or INRIA RR-3489, INRIA, septembre 1998. [WWW ] Keyword(s): Software engineering, Programming environment, Automated debugging, Trace query mechanism, Debugging language, Program behavior understanding, C Debugging tool. [Abstract] [bibtex-entry]



2. V. Gouranton. Deriving analysers by folding/unfolding of natural semantics and a case study: slicing. Technical report 3413, INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le chesnay Cedex FRANCE, avr 1998. [WWW ] Keyword(s): systematic derivation, program transformation, natural semantics, proof tree, slicing analysis. [Abstract] [bibtex-entry]



3. V. Gouranton and D. Le Métayer. Dynamic slicing: a generic analysis based on a natural semantics format. Technical report 3375, INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le chesnay Cedex FRANCE, March 1998. [WWW ] Keyword(s): dynamic slicing analysis, natural semantics, proof tree, correctness, systematic derivation.. [Abstract] [bibtex-entry]



4. T. Jensen, D. Le Métayer, and T. Thorn. Verification of control flow based security policies. Technical report 1210, IRISA, 1998. [WWW ] Keyword(s): security, verification, finite-state system, control flow, object orientation. [Abstract] [bibtex-entry]



5. J. Mallet. Compilation of a skeleton-based parallel language through symbolic cost analysis and automatic distribution. Technical report 3436, INRIA, Domaine de Voluceau, Rocquencourt, BP 105, 78153 Le chesnay Cedex FRANCE, Mai 1998. [WWW ] Keyword(s): skeleton-based language, parallelism, cost analysis, automatic data distribution. [Abstract] [bibtex-entry]

1. R. Douence and P. Fradet. A taxonomy of functional language implementations. Part I: Call-by-Value. Technical report 2783, INRIA, Jan. 1996. [WWW ] Keyword(s): Compilation, optimizations, program transformation, lambda-calculus, combinators.. [Abstract] [bibtex-entry]



2. R. Douence and P. Fradet. A taxonomy of functional language implementations. Part II: Call-by-Name, Call-by-Need and Graph Reduction.. Technical report 3050, INRIA, Nov. 1996. [WWW ] Keyword(s): Compilation, optimizations, program transformation, lambda-calculus, combinators.. [Abstract] [bibtex-entry]



3. P. Fradet, R. Gaugne, and D. Le Métayer. An inference algorithm for the static verification of pointer manipulation. Technical report 980, IRISA, 1996. [WWW ] Keyword(s): Debugging tool, alias analysis, Hoare's logic.. [Abstract] [bibtex-entry]



4. P. Fradet and D. Le Métayer. Structured Gamma. Technical report 989, IRISA, 1996. [WWW ] Keyword(s): multiset rewriting, type checking, invariant, verification, refinement. [Abstract] [bibtex-entry]

1. V. Gouranton. Une analyse de globalisation basée sur une semantique naturelle. Technical report, Journées du GRD Programmation, Grenoble, November 1995. [WWW ] Keyword(s): langages fonctionnels, semantique operationnelle, analyse de globalisation, optimisation de compilateurs. [Abstract] [bibtex-entry]



2. V. Gouranton and D. Le Métayer. Derivation of static analysers of functional programs from path properties of a natural semantics. Technical report 2607, Inria, 1995. [WWW ] Keyword(s): functional languages, operational semantics, neededness analysis, paths analysis, optimising compilers. [Abstract] [bibtex-entry]

1. P. Brisset and O. Ridoux. The Compilation of $\lambda$Prolog and its execution with MALI. Rapport de recherche 1831, INRIA, 1993. [WWW ] Keyword(s): See \citebo92a. [Abstract] [bibtex-entry]

1. P. Brisset and O. Ridoux. The Compilation of $\lambda$Prolog and its execution with MALI. Publication Interne 687, IRISA, 1992. [WWW ] Keyword(s): LambdaProlog, implementation, compilation, memory management.. [Abstract] [bibtex-entry]

1. M. Ducassé and A.-M. Emde. A High-level Debugging Environment for Prolog. Opium User's Manual. Technical Report TR-LP-60, ECRC, May 1991. [WWW ] [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