1. Frédéric Besson, Guillaume Dufay, and Thomas Jensen. A Formal Model of Access Control for Mobile Interactive Devices. In 11th European Symposium On Research In Computer Security (ESORICS'06), volume 4189 of Lecture Notes in Computer Science, 2006. Springer. [WWW ] [Abstract] [bibtex-entry]



2. F. Besson, T. Jensen, and D. Pichardie. A PCC Architecture based on Certified Abstract Interpretation. In Proc. of 1st International Workshop on Emerging Applications of Abstract Interpretation (EAAI'06), ENTCS, 2006. Springer-Verlag. [WWW ] [Abstract] [bibtex-entry]



3. Y. Boichut and T. Genet. Feasible Trace Reconstruction for Rewriting Approximations.. In RTA, volume 4098 of LNCS, pages 123-135, 2006. Springer. [bibtex-entry]



4. Y. Glouche, T. Genet, O. Heen, and O. Courtay. A Security Protocol Animator Tool for AVISPA. In ARTIST-2 workshop on security of embedded systems, Pisa (Italy), 2006. Note: \small http://www.irisa.fr/lande/genet/publications.html. [WWW ] [bibtex-entry]



5. Pascal Sotin, David Cachera, and Thomas Jensen. Quantitative Static Analysis over semirings: analysing cache behaviour for Java Card. In Quantitative Aspects of Programming Languages, 2006. [bibtex-entry]

1. David Cachera, Thomas Jensen, David Pichardie, and Gerardo Schneider. Certified Memory Usage Analysis. In Proc of 13th International Symposium on Formal Methods (FM'05), Lecture Notes in Computer Science, 2005. Springer-Verlag. [Abstract] [bibtex-entry]



2. David Cachera, Thomas Jensen, and Pascal Sotin. Estimating Cache Misses with Semi-Modules and Quantitative Abstraction. In Proc. of IST-APPSEM II Workshop on Applied Semantics, 2005. [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. In T. Ellman and A. Zisman, editors, Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering, November 2005. ACM Press. Note: See RR-5661 for a long version of this article. Keyword(s): Software Engineering, Debugging, Artificial Intelligence, Learning, Knowledge acquisition. [Abstract] [bibtex-entry]



4. T. Denmat, A. Gotlieb, and M. Ducassé. Proving or Disproving Likely Invariants with Constraint Reasoning. In A. Serebrenik, editor, Proceedings of the 15th Workshop on Logic-based Method for Programming Environments, Sitges, SPAIN, October 2005. Note: Satelite event of International Conference on Logic Programming (ICLP'2005). Published in Computer Research Repository cs.SE/0508108. [WWW ] Keyword(s): Software Engineering, Testing and Debugging, Program verification, Constraint and logic languages. [Abstract] [bibtex-entry]



5. Pascal Fradet and Stéphane Hong Tuan Ha. Systèmes de gestion de ressources et aspects de disponibilité. In 2ème Journée Francophone sur le Développement de Logiciels par Aspects (JFDLPA 2005), Lille, France, September 2005. [WWW ] Keyword(s): availability, security, AOP. [Abstract] [bibtex-entry]



6. A. Gotlieb, T. Denmat, and B. Botella. Constraint-based test data generation in the presence of stack-directed pointers. In 20th IEEE/ACM International Conference on Automated Software Engineering (ASE'05), Long Beach, CA, USA, Nov. 2005. Note: 4 pages, short paper. Keyword(s): Constraint-Based Test data generation, Constraint satisfaction, stack-directed pointers. [Abstract] [bibtex-entry]



7. A. Gotlieb, T. Denmat, and B. Botella. Goal-oriented test data generation for programs with pointer variables. In 29th IEEE Annual International Computer Software and Applications Conference (COMPSAC'05), Edinburh, Scotland, pages 449-454, July 2005. Note: 6 pages. Keyword(s): Goal-oriented test data generation, Constraint Logic Programming, Static Single Assignment form, pointer variables. [Abstract] [bibtex-entry]



8. S.D. Gouraud and A. Gotlieb. Utilisation des CHRs pour générer des cas de test fonctionnel pour la Machine Virtuelle Java Card. In Premières Journées Francophones de Programmation par Contraintes (JFPC'05), Lens, FRANCE, 8-10 juin 2005. [Abstract] [bibtex-entry]



9. G. Le Guernic and Thomas Jensen. Monitoring Information Flow. In Andrei Sabelfeld, editor, Proceedings of the 2005 Workshop on Foundations of Computer Security (FCS'05), pages 19--30, June 2005. DePaul University. Note: LICS'05 Affiliated Workshop. [Abstract] [bibtex-entry]



10. G. Le Guernic and Julien Perret. FL-system's Intelligent Cache. In Alexandre Vautier and Sylvie Saget, editors, Proceedings of Majecstic 2005, pages 79--88, November 2005. [bibtex-entry]



11. L. Langevine and M. Ducassé. A Tracer Driver for Hybrid Execution Analyses. In Proceedings of the 6th Automated Debugging Symposium, September 2005. ACM Press. Note: See RR-5611 for a longer version of this article. [WWW ] Keyword(s): Software Engineering, Debugging, Monitors, Tracing, Programming Environments. [Abstract] [bibtex-entry]



12. L. Langevine and M. Ducassé. A Tracer Driver for Versatile Dynamic Analyses of Constraint Logic Programs. In A. Serebrenik, editor, Proceedings of the 15th Workshop on Logic-based Method for Programming Environments, Sitges, SPAIN, October 2005. Note: Satelite event of International Conference on Logic Programming (ICLP'2005). Published in Computer Research Repository cs.SE/0508105. [WWW ] Keyword(s): Software Engineering, Debugging, Monitors, Tracing, Programming Environments. [Abstract] [bibtex-entry]



13. Katell Morin-Allory and David Cachera. Proving Parameterized Systems: The Use of Pseudo-Pipelines in Polyhedral Logic. In Proc. of 13th CHARME conference, Lecture Notes in Computer Science, pages 376--379, 2005. Springer-Verlag. [bibtex-entry]

1. David Cachera, Thomas Jensen, David Pichardie, and Vlad Rusu. Extracting a data flow analyser in constructive logic. In Proc. ESOP'04, number 2986 of Springer LNCS, pages 385 -- 400, 2004. [bibtex-entry]



2. P. Fradet and S. Hong Tuan Ha. Network Fusion. In Wei-Ngan Chin, editor, Programming Languages and Systems: Second Asian Symposium, APLAS 2004, volume Springer LNCS vol. 3302, pages 21--40, 2004. [bibtex-entry]



3. P. Giambiagi, G. Schneider, and F.D. Valencia. On the expressiveness of infinite behavior and name scoping in process calculi. In FOSSACS, volume 2987 of LNCS, pages 226--240, 2004. [POSTSCRIPT ] Keyword(s): process calculi, expressivity, name scoping, infinite behavior. [bibtex-entry]



4. L. Langevine and M. Ducassé. A tracer driver to enable debugging, monitoring and visualization of CLP executions from a single tracer. In B. Demoen and V. Lifschtitz, editors, Proceedings of the International Conference on Logic Programming, pages 462-463, September 2004. Lecture Notes in Computer Science 3132, Springer-Verlag. Note: Poster. [bibtex-entry]



5. L. Langevine and M. Ducassé. Un pilote de traceur pour la PLC. Déboguer, auditer et visualiser une exécution avec un même traceur. In F. Mesnard, editor, Actes des Journées Francophones de Programmation en Logique avec Contraintes, pages 19-36, Juin 2004. HERMES Science Publications. [bibtex-entry]



6. Matthieu Petit and Arnaud Gotlieb. An ongoing work on statistical structural testing via probabilistic concurrent constraint programming. In Proc. of SIVOES-MODEVA workshop, St Malo, France, November 2004. IEEE. [Abstract] [bibtex-entry]



7. Matthieu Petit and Arnaud Gotlieb. Probabilistic choice operators as global constraints : application to statistical software testing. In Poster presentation in ICLP'04, number 3132 of Springer LNCS, pages 471 -- 472, 2004. [bibtex-entry]



8. E. Tombini, H. Debar, L. Mé, and M. Ducassé. A serial combination of anomaly and misuse IDSes applied to HTTP traffic. In D. Thomsen and C. Schuba, editors, Proceedings of the Annual Computer Security Applications Conference, December 2004. [bibtex-entry]

1. In M. Bruynooghe, editor, Proc. Logic-based Program Synthesis and Transformation, 2003. Springer-Verlag, LNCS vol. 269???. [bibtex-entry]



2. Jean-Pierre Banâtre, Pascal Fradet, and Yann Radenac. Higher-order chemistry. In Preproceedings of the Workshop on Membrane Computing, July 2003. [bibtex-entry]



3. F. Besson and T. Jensen. Modular Class Analysis with DATALOG. In R. Cousot, editor, Proc. of 10th Static Analysis Symposium (SAS 2003), pages 19--36, 2003. Springer LNCS vol. 2694. [WWW ] [Abstract] [bibtex-entry]



4. David Cachera and Katell Morin-Allory. Verification of Control Properties in the Polyhedral Model. In Proc. 1st MEMOCODE conference, Mont-St-Michel, France, June 2003. [WWW ] [bibtex-entry]



5. David Cachera and David Pichardie. Embedding of Systems of Affine Recurrence Equations in Coq. In Proc. TPHOLs 2003, 16th International Conference on Theorem Proving in Higher Order Logics, LNCS, Rome, Italy, September 2003. [WWW ] [bibtex-entry]



6. P. Deransart, L. Langevine, and M. Ducassé. A Generic Trace Schema for the Portability of CP(FD) Debugging Tools. In Proceedings of the ERCIM workshop on Constraint and Logic Programming, 2003. [bibtex-entry]



7. M. Ducassé, L. Langevine, and P. Deransart. Rigorous design of tracers: an experiment for constraint logic programming. In M. Ronsse, editor, Proceedings of the Fifth International Workshop on Automated Debugging, September 2003. CoRR cs.SE/0309027. [bibtex-entry]



8. G. Feuillade and T. Genet. Reachability in conditional term rewriting systems. In FTP'2003, International Workshop on First-Order Theorem Proving, volume 86 n. 1 of Electronic Notes in Theoretical Computer Science, June 2003. Elsevier. [WWW ] Keyword(s): Term Rewriting, Conditional Term Rewriting, Reachability, Tree Automata. [bibtex-entry]



9. T. Genet, T. Jensen, V. Kodati, and D. Pichardie. A Java Card CAP Converter in PVS. In Proceedings of the 2nd International Workshop on Compiler Optimization Meets Compiler Verification (COCV 2003), 2003. ENTCS 82(2). [WWW ] Keyword(s): Java, Java Card, CAP Format, Compiler, Verification, Proof Assistant, PVS. [bibtex-entry]



10. T. Genet, Y.-M. Tang-Talpin, and V. Viet Triem Tong. Verification of Copy Protection Cryptographic Protocol using Approximations of Term Rewriting Systems. In In Proceedings of Workshop on Issues in the Theory of Security, 2003. [WWW ] Keyword(s): Cryptographic Protocol, Verification, Term Rewriting, Reachability, Approximation, Timbuk. [bibtex-entry]



11. Arnaud Gotlieb. Exploiting Symmetries to Test Programs. In Proc. of 14th IEEE International Symposium on Software Reliability Engineering (ISSRE 2003), Denver, Colorado, USA, 2003. Note: 17th to 20th November. [bibtex-entry]



12. A. Gotlieb and B. Botella. Automated Metamorphic Testing. In Proc. of the 27th IEEE Annual International Computer Software and Applications Conference (COMPSAC), Dallas, TX, USA, 2003. Note: 3th to 7th November. [bibtex-entry]



13. L. Langevine, M. Ducassé, and P. Deransart. A Propagation Tracer for Gnu-Prolog: from Formal Definition to Efficient Implementation. In C. Palamidessi, editor, Proceedings of the 19th Int. Conf. in Logic Programming, December 2003. Springer-Verlag, Lecture Notes in Computer Science. [bibtex-entry]



14. Lionel van Aertryck and Thomas Jensen. UML-CASTING: Test synthesis from UML models using constraint resolution. In J-M. Jézéquel, editor, Proc. Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2003), 2003. INRIA. [bibtex-entry]

1. F. Besson, Thomas de Grenier de Latour, and T. Jensen. Secure calling contexts for stack inspection. In Proc. of 4th Int Conf. on Principles and Practice of Declarative Programming (PPDP 2002), pages 76--87, 2002. ACM Press. [WWW ] [Abstract] [bibtex-entry]



2. P. Deransart, L. Langevine, and M. Ducassé. A Generic Trace Model for Finite Domain Solvers. In B. O'Sullivan, editor, Proc. of the International Workshop on User-Interaction in Constraint Satisfaction, September 2002. Cornell University. [bibtex-entry]



3. Rémi Douence, Pascal Fradet, and Mario Südholt. A framework for the detection and resolution of aspect interactions. In Proceedings of the ACM SIGPLAN/SIGSOFT Conference on Generative Programming and Component Engineering, 2002. Springer-Verlag, Lecture Notes in Computer Science 2487. [bibtex-entry]



4. M. Ducassé and L. Langevine. Analyse automatisée de traces d'exécution de programmes CLP(FD). In M. Rueher, editor, Actes des Journées Francophones de Programmation en Logique avec Contraintes, pages 119-134, Mai 2002. HERMES science publications. [bibtex-entry]



5. M. Ducassé and L. Langevine. Automated analysis of CLP(FD) program execution traces. In P. Stuckey, editor, Proceedings of the International Conference on Logic Programming, July 2002. Lecture Notes in Computer Science 2401, Springer-Verlag. Note: Poster. Extended version available at http://www.irisa.fr/lande/ducasse/. [bibtex-entry]



6. Thomas Jensen, Florimond Ployette, and Olivier Ridoux. Iteration schemes for fixed point conputation. In A. Ingolfsdottir and Z. Esik, editors, Proc. of 4th Int workshop on Fixed Points in Computer Science (FICS'02), pages 69--76, 2002. [bibtex-entry]



7. L. Langevine, P. Deransart, M. Ducassé, and E. Jahier. Prototypage de traceurs CLP(FD). In M. Rueher, editor, Actes des Journées Francophones de Programmation en Logique avec Contraintes, pages 135-150, Mai 2002. HERMES science publications. [bibtex-entry]



8. B. Morin, L. Mé, H. Debar, and M. Ducassé. M2D2 : A Formal Data Model for IDS Alert Correlation. In A. Wespi et al., editor, Recent Advances in Intrusion Detection, pages 97-104, October 2002. Springer-Verlag, Lecture Notes in Computer Science 2516. [bibtex-entry]



9. Jean-Philippe Pouzol and Mireille Ducassé. Formal specification of intrusion signatures and detection rules. In S. Schneider, editor, Proc. of 15th IEEE Computer Security Foudations Workshop, pages 64--76, 2002. IEEE Press. [bibtex-entry]



10. Marc Éluard and Thomas Jensen. Secure object flow analysis for Java Card. In Proc. of 5th Smart Card Research and Advanced Application Conference (Cardis'02), 2002. IFIP/USENIX. [bibtex-entry]

1. T. Genet and Valérie Viet Triem Tong. Reachability Analysis of Term Rewriting Systems with \sl Timbuk. In 8th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning, volume 2250 of Lectures Notes in Artificial Intelligence, pages 691--702, 2001. Springer Verlag. [WWW ] Keyword(s): Timbuk, Term Rewriting, Reachability, Tree Automata, Descendants, Verification. [Abstract] [bibtex-entry]



2. E. Jahier, M. Ducassé, and O. Ridoux. Specifying Prolog Trace Models with a Continuation Semantics. In K.-K. Lau, editor, Logic Based Program Synthesis and Transformation, 2001. Springer-Verlag, Lecture Notes in Computer Science 2042. [bibtex-entry]



3. T. Jensen and F. Spoto. Class analysis of object-oriented programs through abstract interpretation. In F. Honsell and M. Miculan, editors, Proc. of Foundations of Software Science and Computation Structures (FoSSaCS'01), pages 261--275, 2001. Springer LNCS vol .2030. [bibtex-entry]



4. L. Langevine, P. Deransart, M. Ducassé, and E. Jahier. Prototyping clp(fd) tracers: a trace model and an experimental validation environment. In T. Kusalik, editor, Proceedings of the 11th Workshop on Logic Programming Environments, 2001. Computer Research Repository, CS.PL/0111043. [bibtex-entry]



5. J.-P. Pouzol and M. Ducassé. From Declarative Signatures to Misuse IDS. In W. Lee, L. Mé, and A. Wespi, editors, Recent Advances in Intrusion Detection, Proceedings of the 4th International Symposium, pages 1-21, 2001. Springer-Verlag, Lecture Notes in Computer Science 2212. [bibtex-entry]



6. Igor Siveroni, Thomas Jensen, and Marc Éluard. A Formal Specification of the Java Card Applet Firewall. In Hanne Riis Nielson, editor, Nordic Workshop on Secure IT-Systems, November 2001. [bibtex-entry]



7. Marc Éluard, Thomas Jensen, and Ewen Denney. An Operational Semantics of the Java Card Firewall. In Isabelle Attali and Thomas Jensen, editors, Smart Card Programming and Security (e-Smart 2001, volume Springer LNCS vol. 2140, September 2001. [bibtex-entry]

1. V. Abily and M. Ducassé. Benchmarking a distributed intrusion detection system based on ASAX: Preliminary results. In H. Debar, editor, RAID 2000 (Recent Advances on Intrusion Detection), 2000. Note: Refereed extended abtract. [WWW ] [bibtex-entry]



2. Thomas Colcombet and Pascal Fradet. Enforcing Trace Properties by Program Transformation. In Conference record of the 27th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, January 2000. [WWW ] [Abstract] [bibtex-entry]



3. E. Denney and T. Jensen. Correctness of Java Card method lookup via logical relations. In Proc. of European Symp. on Programming (ESOP 2000), Lecture Notes in Computer Science, pages 104--118, 2000. Springer. [bibtex-entry]



4. M. Ducassé and L. Rozé. Proof obligations of the B formal method: Local proofs ensure global consistency. In A. Bossi, editor, LOgic-based Program Synthesis and TRansformation, pages 11-30, 2000. Springer-Verlag, Lecture Notes in Computer Science, 1817. [bibtex-entry]



5. P. Fradet, V. Issarny, and S. Rouvrais. Analyzing non-functional properties of mobile agents. In Proc. of Fundamental Approaches to Software Engineering, FASE'00, Lecture Notes in Computer Science, march 2000. Springer-Verlag. [WWW ] Keyword(s): Mobile agents, RPC, performance, security. [Abstract] [bibtex-entry]



6. T. Genet and F. Klay. Rewriting for Cryptographic Protocol Verification. In Proceedings 17th International Conference on Automated Deduction, volume 1831 of Lecture Notes in Artificial Intelligence, 2000. Springer-Verlag. [WWW ] Keyword(s): Cryptographic Protocol, Verification, Term Rewriting, Reachability, Approximation, Timbuk. [Abstract] [bibtex-entry]



7. E. Jahier. Collecting graphical abstract views of Mercury program executions. In M. Ducassé, editor, Proceedings of the International Workshop on Automated Debugging (AADEBUG2000), Munich, August 2000. Note: Refereed proceedings to appear in the COmputer Research Repository (CORR). [WWW ] [bibtex-entry]



8. E. Jahier, M. Ducassé, and O. Ridoux. Specifying Prolog Trace Models with a Continuation Semantics. In K.-K. Lau, editor, Proc. of LOgic-based Program Synthesis and TRansformation, London, July 2000. Note: Technical Report Report Series, Department of Computer Science, University of Manchester, ISSN 1361-6161. Report number UMCS-00-6-1. [WWW ] [bibtex-entry]



9. E. Jahier, M. Ducassé, and O. Ridoux. Spécification de modèles de traces de programmes Prolog à l'aide d'une sémantique par continuation. In Touraivane, editor, Actes des Journées francophones de Programmation Logique et par Contraintes, Marseille, 2000. Hermès. [bibtex-entry]



10. D. Le Métayer, V.-A. Nicolas, and O. Ridoux. Verification by testing for recursive program schemes. In A. Bossi, editor, LOgic-based Program Synthesis and TRansformation, 2000. Springer-Verlag, Lecture Notes in Computer Science, 1817. [bibtex-entry]



11. J.-P. Pouzol and M. Ducassé. Handling Generic Intrusion Signatures is not Trivial. In H. Debar, editor, RAID 2000 (Recent Advances on Intrusion Detection), 2000. Note: Refereed extended abtract. [WWW ] [bibtex-entry]



12. Michaël Périn. Cohérence de spécifications multi-vues. In les actes de l'atelier Approches Formelles dans l'Assistance au Développement de Logiciels (AFADL'2000), Grenoble, France, January 2000. [bibtex-entry]

1. F. Besson, T. Jensen, and J.P. Talpin. Polyhedral Analysis for Synchronous Languages. In Gilberto Filé, editor, International Static Analysis Symposium, SAS'99, volume 1694 of Lecture Notes in Computer Science, September 1999. Springer-Verlag. Keyword(s): synchronous languages, abstract interpretation, reachability analysis, infinite state systems. [Abstract] [bibtex-entry]



2. M. Ducassé. An introduction to the B formal method. In A.-L. Bossi, editor, Proceedings of the 9th International Workshop on LOgic-based Program Synthesis and TRansformation, pages 23--30, September 1999. Universita' Ca' Foscari di Venezia. Note: Technical report CS-99-16, Slides. [bibtex-entry]



3. M. Ducassé. Coca: An automated Debugger for C. In Proceedings of the 21st International Conference on Software Engineering, pages 504-513, May 1999. ACM Press. [WWW ] Keyword(s): Software engineering, Programming environment, Automated debugging, Trace query mechanism, Debugging language, Program behavior understanding, C Debugging tool.. [Abstract] [Annotation] [bibtex-entry]



4. P. Fradet, D. Le Métayer, and M. Périn. Consistency checking for multiple view software architectures. In Proceedings of the joint 7th European Software Engineering Conference (ESEC) and 7th ACM SIGSOFT International Symposium on the Foundations of Software Engineering (FSE-7), LNCS, Toulouse, France, September 1999. Springer-Verlag. [WWW ] Keyword(s): software architecture, multiple views, UML diagrams, formal semantics, families of graphs, static consistency verification. [Abstract] [bibtex-entry]



5. P. Fradet and M. Südholt. An aspect language for robust programming. In Workshop on Aspect-Oriented Programming, ECOOP 1999, juillet 1999. [WWW ] Keyword(s): aspect-oriented programming, robustness, exceptions, program transformation, program analysis. [Abstract] [bibtex-entry]



6. E. Jahier and M. Ducassé. A generic approach to monitor program executions. In D. De Schreye, editor, Proceedings of the International Conference on Logic Programming, November 1999. MIT Press. [WWW ] Keyword(s): Monitoring, Trace analysis, Flexibility, Logic programming, Mercury. [Abstract] [bibtex-entry]



7. E. Jahier and M. Ducassé. Un traceur d'exécutions de programmes ne sert pas qu'au débogage. In F. Fages, editor, Actes des Journées francophones de Programmation Logique et par Contraintes, Lyon, juin 1999. Hermès. [WWW ] Keyword(s): Dynamic analysis, Trace analysis, Monitoring, Measure of test coverage, Logic programming, Mercury. [Abstract] [bibtex-entry]



8. E. Jahier, M. Ducassé, and O. Ridoux. Specifying trace models with a continuation semantics. In M. Ducassé, A. Kusalik, L. Naish, and G. Puebla, editors, Proc. of ICLP'99 Workshop on Logic Programming Environments, 1999. Note: LPE'99. [WWW ] Keyword(s): trace models, continuation semantics, specification, validation, Logic programming. [Abstract] [bibtex-entry]



9. T. Jensen, D. Le Métayer, and T. Thorn. Verification of control flow based security properties. In Proc. of the 20th IEEE Symp. on Security and Privacy, pages 89--103, mai 1999. New York: IEEE Computer Society. [bibtex-entry]



10. S. Mallet and M. Ducassé. Generating deductive database explanations. In D. De Schreye, editor, Proceedings of the International Conference on Logic Programming, November 1999. MIT Press. [WWW ] Keyword(s): deductive databases, debugging, trace, operational semantics, multi-SLD-AL, meta-interpreter, substitution set, instrumentation. [Abstract] [bibtex-entry]



11. S. Mallet and M. Ducassé. Myrtle: A set-oriented meta-interpreter driven by a ``relational'' trace for deductive database debugging. In P. Flener, editor, LOgic-based Program Synthesis and TRansformation, pages 328-330, 1999. Springer-Verlag, LNCS 1559. Note: Résumé, version complète en RR-3598 INRIA. [bibtex-entry]



12. D. Mentré, D. Le Métayer, and T. Priol. Towards designing SVM coherence protocols using high-level specifications and aspect-oriented translations. In Proceedings of ICS'99 Workshop on Software Distributed Shared Memory, juin 1999. [bibtex-entry]



13. D. Le Métayer, V.-A. Nicolas, and O. Ridoux. Verification by testing for recursive program schemes. In LOPSTR'99 (International Workshop on Logic Program Synthesis and Transformation), 1999. Springer-Verlag, LNCS. Note: To appear. [WWW ] Keyword(s): Software engineering, program verification, white-box testing, automated test data generation, program analysis, program schemes. [Abstract] [bibtex-entry]



14. Olivier Ridoux, Patrice Boizumault, and Frédéric Malésieux. Typed static analysis: application to groundness analysis of LambdaProlog and Prolog. In A. Middeldorp and T. Sato, editors, Proc. of the Int. Symp. on Functional and Logic Programming, 1999. Springer. [bibtex-entry]

1. M. Ducassé. Teaching B at a Technical University is Possible and Rewarding. In H. Habrias and S. E. Dunn, editors, B'98, Proceedings of the Educational Session, avril 1998. Association de Pilotage des Conférences B, Nantes. Note: ISBN: 2-9512461-0-2. [WWW ] Keyword(s): B formal method, teaching. [Abstract] [bibtex-entry]



2. M. Ducassé and J. Noyé. Tracing Prolog Programs by Source Instrumentation is Efficient Enough. In K. Sagonas, editor, IJCSLP'98 Post-conference workshop on Implementation Technologies for Programming Languages based on Logic., June 1998. [WWW ] Keyword(s): Debugging, tracing, source to source transformation, benchmarking, Prolog. [Abstract] [bibtex-entry]



3. P. Fradet and M. Südholt. Towards a Generic Framework for Aspect-Oriented Programming. In Third AOP Workshop, ECOOP'98 Workshop Reader, volume 1543 of LNCS, pages 394--397, juillet 1998. Springer-Verlag. [WWW ] Keyword(s): aspect-oriented programming, program transformation, program analysis. [Abstract] [bibtex-entry]



4. V. Gouranton. Deriving analysers by folding/unfolding of natural semantics and a case study: slicing. In International Static Analysis Symposium, SAS'98, number 1503 of Lecture Notes in Computer Science, Pise, Italie, pages 115-133, September 1998. Springer-Verlag. [WWW ] Keyword(s): systematic derivation, program transformation, natural semantics, proof tree, slicing analysis, logic programming language.. [Abstract] [bibtex-entry]



5. T. Jensen. Inference of polymorphic and conditional strictness properties. In Proc. of 25th ACM Symposium on Principles of Programming Languages, pages 209--221, 1998. ACM Press. [WWW ] [Abstract] [bibtex-entry]



6. T. Jensen, D. Le Métayer, and T. Thorn. Security and Dynamic Class Loading in Java: A Formalisation. In Proceedings of the 1998 IEEE International Conference on Computer Languages, pages 4--15, May 1998. [WWW ] [Abstract] [bibtex-entry]



7. J. Mallet. Symbolic Cost Analysis and Automatic Data Distribution for a Skeleton-based Language. In Euro-Par'98 Parallel Processing, number 1470 of Lecture Notes in Computer Science, Southampton, UK, pages 688--697, September 1998. Springer-Verlag. [bibtex-entry]



8. S. Mallet and M. Ducassé. Pilotage d'un méta-interprète ensembliste par une trace ``relationnelle'' pour le débogage de bases de données déductives. In O. Ridoux, editor, Journées francophones de Programmation Logique et programmation par Contraintes, Nantes, pages 151-165, mai 1998. JFPLC'98, Hermes. [WWW ] Keyword(s): bases de données déductives, débogage, trace, sémantique opérationnelle, multi-SLD-AL, méta-interprète, ensembles de substitutions, instrumentation. [Abstract] [bibtex-entry]

1. P. Fradet and D. Le Métayer. Shape types. In Proc. of Principles of Programming Languages, Paris, France, Jan. 1997. ACM Press. [WWW ] Keyword(s): Pointer structures and manipulations, graph grammars, type checking, program robustness, C.. [Abstract] [bibtex-entry]



2. V. Gouranton. Un cadre générique de définition d'analyseurs dynamiques et statiques. In Journées du GDR Programmation, Rennes, November 1997. [WWW ] Keyword(s): analyse dynamique, analyse statique, slicing, sémantique opérationnelle. [Abstract] [bibtex-entry]



3. V. Gouranton and D. Le Métayer. Formal development of static program analysers. In The 8th Israel Conference on Computer Systems and Sofware Engineering, IEEE, IFCC, ISySe'97, Herzliya, Israel, June 1997. [WWW ] Keyword(s): functional languages, natural semantics, neededness analysis, paths analysis, program transformation, optimising compilers. [Abstract] [bibtex-entry]



4. A. A. Holzbacher, M. Périn, and M. Südholt. Modeling railway control systems using graph grammars: a case study. In 2nd International Conference on COORDINATION, LNCS 1282, September 1997. Springer Verlag. Note: Long version published as technical report, INRIA, no. 3210: see ftp://ftp.inria.fr/INRIA/publication/publi-ps-gz/RR/RR-3210.ps.gz. [WWW ] Keyword(s): software architecture, graph grammar, software evolution. [Abstract] [bibtex-entry]



5. S. Mallet and M. Ducassé. An Informal Presentation of DDB Trees: A Basis for Deductive Database Explanations. In Ulrich Geske, editor, DDLP'97, Fifth International Workshop on Deductive Databases and Logic Programming, July 1997. GMD-Studien. Keyword(s): debugging, explanations, deductive databases, logic programming. [bibtex-entry]



6. S. Mallet and M. Ducassé. DDB trees: a basis for deductive database explanations. In Mariam Kamkar, editor, AADEBUG'97,Third International Workshop on Automated Debugging, Linköping, Sweden, pages 87-102, May 1997. [WWW ] Keyword(s): debugging, explanations, deductive databases, logic programming. [Abstract] [bibtex-entry]



7. P. Pepper and M. Südholt. Deriving Parallel Numerical Algorithms using Data Distribution Algebras: Wang's Algorithm. In Proc. of the 30rd Hawaii International Conference on System Sciences, January 1997. IEEE. [WWW ] Keyword(s): functional, parallel programming, skeleton, data distribution algebra, partition algorithm. [Abstract] [bibtex-entry]



8. M. Südholt, C. Piepenbrock, K. Obermayer, and P. Pepper. Solving Large Systems of Differential Equations using Covers and Skeletons. In 50th Working Conference on Algorithmic Languages and Calculi, February 1997. Chapman & Hall. [WWW ] Keyword(s): functional, parallel programming, numerical algorithm, program transformation, skeleton, data distribution algebra. [Abstract] [bibtex-entry]



9. L. van Aertryck, M. Benveniste, and D. Le Métayer. CASTING: A formally based software test generation method. In The 1st International Conference on Formal Engineering Methods, IEEE, ICFEM'97, Hiroshima, Japan, November 1997. [WWW ] Keyword(s): test cases, test suites, test generation, uniformity hypothesis, formal method, validation, fonctionnal testing, structural testing, attributed grammar, constraint solving. [Abstract] [bibtex-entry]

1. J.-P. Banâtre and D. Le Métayer. Gamma and the chemical reaction model: ten years after. In Coordination programming: mechanisms, models and semantics, IC Press, 1996. World Scientific Publishing. [WWW ] [Abstract] [bibtex-entry]



2. R. Douence and P. Fradet. Décrire et comparer les implantations de langages fonctionnels. In Journées francophones des langages applicatifs, Collection INRIA Didactique, Val-Morin, Québec, Canada, pages 183-203, Jan. 1996. [WWW ] Keyword(s): Compilation, optimizations, program transformation, CAM, Krivine Machine, Tabac.. [Abstract] [bibtex-entry]



3. M. Ducassé and J. Noyé. Tracing Prolog without a tracer. In N. Fuchs and U. Geske, editors, Proceedings of the poster session at JICSLP'96, pages 223-232, September 1996. GMD- Forschungszentrum Informationstechnik GMBH, GMD-STUDIEN Nr.296, ISBN3-88457-296-2. Note: One page abstract also appears in Proc. of the JICSLP'96, MIT Press, ISBN 0-262-63173-3. [Abstract] [bibtex-entry]



4. P. Fradet, R. Gaugne, and D. Le Métayer. Static detection of pointer errors: an axiomatisation and a checking algorithm. In Proc. European Symposium on Programming, ESOP'96, volume 1058 of LNCS, Linköping, Sweden, pages 125-140, April 1996. Springer-Verlag. [WWW ] Keyword(s): Debugging tool, alias analysis, Hoare's logic.. [Abstract] [bibtex-entry]



5. P. Fradet and D. Le Métayer. Type checking for a multiset rewriting language. In Proc. of the LOMAPS workshop on Analysis and Verification of Multiple-agent Languages, volume 1192 of LNCS, pages 126-140, 1996. [WWW ] Keyword(s): multiset rewriting, graph grammars, type checking, invariant, verification. [Abstract] [bibtex-entry]



6. P. Louvet and O. Ridoux. Parametric Polymorphism for Typed Prolog and $\lambda$Prolog. In 8th Int. Symp. Programming Languages Implementation and Logic Programming, volume 1140 of LNCS, Aachen, Germany, pages 47--61, 1996. [WWW ] Keyword(s): Logic programming, typing, polymorphism, second-order lambda-calculus.. [Abstract] [bibtex-entry]



7. D. Le Métayer. Software architecture styles as graph grammars. In In Proc of the ACM SIGSOFT Symposium of the foundations of Software Engineering, pages 15-23, 1996. [WWW ] Keyword(s): coordination, graph rewriting, software architecture, static verification. [Abstract] [bibtex-entry]



8. D. Le Métayer and D. Schmidt. Structural Operational Semantics as a basis for static program analysis. In ACM Computing Surveys, pages 340-343, 1996. [WWW ] [Abstract] [bibtex-entry]



9. O. Ridoux. Engineering Transformations of Attributed Grammars in $\lambda$Prolog. In M. Maher, editor, Joint Int. Conf. and Symp. Logic Programming, pages 244--258, 1996. MIT Press. [WWW ] Keyword(s): Syntax-directed translation, grammar transformations, logic grammars, DCG, LambdaProlog.. [Abstract] [bibtex-entry]



10. S. Schoenig and M. Ducassé. A Backward Slicing Algorithm for Prolog. In R. Cousot and D.A. Schmidt, editors, Static Analysis Symposium, Aachen, pages 317-331, September 1996. Springer-Verlag, LNCS 1145. [WWW ] [Abstract] [bibtex-entry]



11. S. Schoenig and M. Ducassé. Slicing pour programmes Prolog. In Actes des journées GDR programmation'96, Orléans, Novembre 1996. Université de Bordeaux I. [WWW ] [Abstract] [bibtex-entry]

1. J.-P. Banâtre, C. Bryce, and D. Le Métayer. An Approach to information security in distributed systems. In Proceedings of the 5th IEEE International Workshop on Future Trends in Distributed Computing Systems, pages 384-394, 1995. [WWW ] [Abstract] [bibtex-entry]



2. R. Douence and P. Fradet. Towards a Taxonomy of Functional Language Implementations. In Proc. of 7th Int. Symp. on Programming Languages: Implementations, Logics and Programs, volume 982 of LNCS, Utrecht, the Netherlands, pages 34-45, 1995. Springer-Verlag. [WWW ] Keyword(s): Compilation, optimizations, program transformation, lambda-calculus, combinators.. [Abstract] [bibtex-entry]



3. M. Ducassé. Automated Debugging Extensions of the Opium Trace Analyser. In Proceedings of the 2nd International Workshop on Automated and Algorithmic Debugging, Saint Malo, France, May 1995. IRISA, Campus de Beaulieu, F-35042 Rennes cedex. [WWW ] [Abstract] [bibtex-entry]



4. D. Le Métayer. Proving properties of programs defined over recursive data structures. In ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, La Jolla, California, pages 88-99, 1995. ACM PRESS. [WWW ] [Abstract] [bibtex-entry]



5. O. Ridoux. Imagining CLP$(\Lambda,\equiv_{\alpha\beta})$. In A. Podelski, editor, Constraint Programming: Basics and Trends. Selected papers of the 22nd Spring School in Theoretical Computer Science. LNCS 910, Châtillon/Seine, France, pages 209--230, 1995. [WWW ] Keyword(s): CLP, LambdaProlog, lambda-calculus.. [Abstract] [bibtex-entry]

1. J.-P. Banâtre, C. Bryce, and D. Le Métayer. Compile-time detection of information flow in sequential programs. In Proc. European Symposium on Research in Computer Security, volume 875 of LNCS, 1994. Springer Verlag. [WWW ] Keyword(s): formal verification, program analysis, verification tools, computer security, information flow. [Abstract] [bibtex-entry]



2. P. Brisset and O. Ridoux. The Architecture of an Implementation of $\lambda$Prolog: Prolog/Mali. In ILPS'94 Workshop on Implementation Techniques for Logic Programming Languages, 1994. Note: Extended version of \citebo92b. [WWW ] Keyword(s): See \citebo92b. [Abstract] [bibtex-entry]



3. P. Fradet. Collecting More Garbage. In Proc. of ACM Conf. on Lisp and Functional Programming, Orlando, FL, USA, pages 24-33, June 1994. ACM Press. [WWW ] Keyword(s): Garbage collection, space leaks, typing, parametricity.. [Abstract] [bibtex-entry]



4. P. Fradet. Compilation of Head and Strong Reduction. In Proc. of the 5th European Symposium on Programming, volume 788 of LNCS, Edinburgh, UK, pages 211-224, April 1994. Springer-Verlag. [WWW ] Keyword(s): lambda-calculus, continuations, strong reduction, head reduction, compilation.. [Abstract] [bibtex-entry]



5. C.L. Hankin and D. Le Métayer. A type-based framework for program analysis. In Proc. Static Analysis Symposium, Springer Verlag, volume 864 of LNCS, pages 380-394, 1994. [WWW ] [Abstract] [bibtex-entry]



6. C.L. Hankin and D. Le Métayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proc. ACM Symposium on Principles of Programming Languages, pages 202-212, 1994. [WWW ] [Abstract] [bibtex-entry]



7. C.L. Hankin and D. Le Métayer. Lazy type inference for the strictness analysis of lists. In Proc. 5th European Symposium on Programming, Springer Verlag, volume LNCS, pages 211-224, 1994. [WWW ] [Abstract] [bibtex-entry]



8. D. Le Métayer. Higher-order multiset programming. In Proc. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, volume 18, 1994. American Mathematical Society. [WWW ] [Abstract] [bibtex-entry]

1. P. Brisset and O. Ridoux. Continuations in $\lambda$Prolog. In D.S. Warren, editor, 10th Int. Conf. Logic Programming, pages 27--43, 1993. MIT Press. [WWW ] Keyword(s): LambdaProlog, compilation, continuation, exception handling.. [Abstract] [bibtex-entry]



2. M. Ducassé. A pragmatic survey of automated debugging. In P. Fritzson, editor, Proceedings of the First Workshop on Automated and Algorithmic Debugging, volume 749 of Lecture Notes in Computer Sciences, Linkoeping, Sweden, May 1993. Springer-Verlag. [WWW ] [Abstract] [bibtex-entry]



3. S. Le Huitouze, P. Louvet, and O. Ridoux. Les grammaires logiques et $\lambda$Prolog. In Journées Francophones sur la Programmation en Logique, Nîmes, France, pages 93--108, 1993. Teknea. Note: Version française de \citellr93. [WWW ] Keyword(s): LambdaProlog, grammaires logiques, portée, représentation du contexte.. [Abstract] [bibtex-entry]



4. S. Le Huitouze, P. Louvet, and O. Ridoux. Logic Grammars and $\lambda$Prolog. In D.S. Warren, editor, 10th Int. Conf. Logic Programming, pages 64--79, 1993. MIT Press. [WWW ] Keyword(s): LambdaProlog, logic grammars, scope, context handling in syntactic analysis.. [Abstract] [bibtex-entry]

1. Y. Bekkers, O. Ridoux, and L. Ungaro. Dynamic Memory Management for Sequential Logic Programming Languages. In Y. Bekkers and J. Cohen, editors, Int. Worshop on Memory Management, volume 637 of LNCS, pages 82--102, 1992. Springer-Verlag. [WWW ] Keyword(s): Memory management, logic programming, garbage collection, usefulness logic.. [Abstract] [bibtex-entry]



2. P. Brisset and O. Ridoux. The Architecture of an Implementation of $\lambda$Prolog: Prolog/Mali. In Workshop on $\lambda$Prolog, Philadelphia, 1992. [WWW ] Keyword(s): LambdaProlog, implementation, compilation, memory management.. [Abstract] [bibtex-entry]



3. M. Ducassé. A general trace query mechanism based on Prolog. In M. Bruynooghe and M. Wirsing, editors, International Symposium on Programming Language Implementation and Logic Programming, volume 631 of Lecture Notes in Computer Science, pages 400-414, August 1992. Springer-Verlag. [WWW ] [Abstract] [bibtex-entry]



4. M. Ducassé. A trace analyser to prototype explanations. In Proceedings of JICSLP'92 Workshop on Logic Programming Environments, Washington D.C., November 1992. Note: Technical Report TR 92-143, Case Western Reserve University, Cleveland. [Abstract] [bibtex-entry]



5. M. Ducassé. Analysis of failing Prolog executions. In Actes des Journées Francophones sur la Programmation Logique, Mai 1992. [Abstract] [bibtex-entry]



6. M. Ducassé. Opium: An advanced debugging system. In G. Comyn and N. Fuchs, editors, Proceedings of the Second Logic Programming Summer School, September 1992. Esprit Network of Excellence in Computational Logic COMPULOG-NET, Springer-Verlag, LNAI 636. [WWW ] [Abstract] [bibtex-entry]

1. P. Brisset and O. Ridoux. Naïve Reverse Can Be Linear. In K. Furukawa, editor, 8th Int. Conf. Logic Programming, pages 857--870, 1991. MIT Press. [WWW ] Keyword(s): LambdaProlog, implementation, function-lists, higher-order unification.. [Abstract] [bibtex-entry]



2. M. Ducassé. Abstract views of Prolog executions in Opium. In V. Saraswat and K. Ueda, editors, Proceedings of the International Logic Programming Symposium, San Diego, USA, pages 18-32, October 1991. MIT Press. [WWW ] [Abstract] [bibtex-entry]



3. P. Fradet. Syntactic Detection of Single-Threading Using Continuations. In Proc. of the 5th ACM Conf. on Functional Prog. Lang. and Comp. Arch., volume 523 of LNCS, Cambridge, MA, USA, pages 241-258, August 1991. Springer-Verlag. [WWW ] Keyword(s): Globalization, single-threading, in-place update, CPS conversion.. [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