1. M. Ducassé, editor. Actes des Journées Francophones de Programmation en Logique avec Contraintes, June 2003. Revue des Sciences et Technologies de l'Information, Hors série/JFPLC 2003, HERMES Science Publications. [bibtex-entry]



2. M. Huisman and T. Jensen, editors. J. Logic and Algebraic Programming. Speical issue on Formal Methods for Smart Cards, 2003. Elsevier. Note: \toappear. [bibtex-entry]

1. V. Viet Triem Tong. Automates d'arbres et réécriture pour l'étude de problèmes d'accessibilité. PhD thesis, Université Rennes 1, 2003. [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. 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. 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. T. Genet. Timbuk 2.0 -- A Tree Automata Library -- Reference Manual and Tutorial. 2003. Note: 81 pages. \small http://www.irisa.fr/lande/genet/timbuk/. [WWW ] Keyword(s): Timbuk, Reference Manual, Tutorial, Term Rewriting, Reachability, Tree Automata, Approximations, Verification. [bibtex-entry]

1. P. Deransart, L. Langevine, and M. Ducassé. Debugging Constraint problems with Portable Tools. Demonstration presented at the 13th Workshop on Logic Programming Environments, December 2003. [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