Références

Livres et monographies

1

C. Gomez, B. Salvy, P. Zimmermann, Calcul formel : mode d'emploi. Exemples en Maple, Masson, 1995.

Articles et chapitres de livre

2

L. Alonso, J.-L. Rémy, R. Schott, ``A linear time algorithm for the generation of trees'', Algorithmica, accepté pour publication.

3

V. M. Antimirov, ``Partial Derivatives of Regular Expressions and Finite Automata Constructions (extended version)'', Theoretical Computer Science, accepté. Disponible aussi comme rapport CRIN 94-R-245.

4

V. M. Antimirov, P. D. Mosses, ``Rewriting Extended Regular Expressions'', Theoretical Computer Science 143, 1, 1995, p. 51--72.

5

Z. Benaissa, D. Briaud, P. Lescanne, J. Rouyer-Degli, ``, a calculus of explicit substitutions which preserves strong normalisation'', Journal of Functional Programming, accepté.

6

A. Cichon, M. Rusinowitch, S. Selhab, ``Cut Elimination and Rewriting: Termination proofs.'', Theoretical Computer Science, accepté.

7

A. Cichon, E. Tahhan-Bittar, ``Ordinal Recursive Bounds for Higman's Theorem'', Theoretical Computer Science, accepté.

8

M. Hermann, R. Galbavý, ``Unification of infinite sets of terms schematized by primal grammars'', Theoretical Computer Science, Accepté. Disponible sur ftp.loria.fr dans le fichier pub/loria/eureca/articles/Miki.Hermann/prmgrmunif.ps.

9

M. Hermann, P. Kolaitis, ``The complexity of counting problems in equational matching'', Journal of Symbolic Computation, Accepté. Disponible sur ftp.loria.fr dans le répertoire pub/loria/eureca/articles/Miki.Hermann, fichier hermann_kolaitis_jsc.ps.

10

G. Kucherov, M. Rusinowitch, ``Undecidability of Ground Reducibility for Word Rewriting Systems with Variables'', Information Processing Letters 53, 1995, p. 209--215.

11

G. Kucherov, M. Tajine, ``Decidability of Regularity and Related Properties of Ground Normal Form Languages'', Information and Computation 118, 1, 1995, p. 91--100.

12

P. Lescanne, La science informatique en Lorraine, Encyclopédie Illustrée de la Lorraine, Sciences exactes, Éditions Serpenoises, ch. L'informatique, accepté.

13

P. Lescanne, ``Elementary Interpretations in Proofs of Termination'', Formal Aspect of Computing 7, 1995, p. 77-90.

14

G. Louchard, R. Schott, M. Tolley, P. Zimmermann, ``Random walks, heat equation and distributed algorithms'', Journal of Computational and Applied Mathematics 53, 1994, p. 243--274.

15

P. Zimmermann, ``Function Composition and Automatic Average Case Analysis'', Discrete Mathematics 139, mai 1995, p. 443-453.

16

P. Zimmermann, ``Wester's test suite in MuPAD 1.2.2'', Computer Algebra Nederland Nieuwsbrief, 14, avril 1995, p. 53--64.

Communications à des congrès, colloques, etc.

17

O. Aït-Mohamed, A. Mokkedem, ``On Formal Verification of Occam Programs'', in: International Conference on Parallel and Distributed Processing Techniques and Applications, H. R. Arabnia (réd.), CSREA, p. 805--814, Athens, Georgia, USA, 1995.

18

O. Aït-Mohamed, ``Mechanizing a -calculus equivalence within HOL'', in: Higher Order Logic Theorem Proving and Its Applications, E. T. S. . al. (réd.), Lecture Notes in Computer Science, 971, Springer-Verlag, p. 1--16, Aspen Grove, UT, USA, 1995.

19

V. M. Antimirov, ``Partial Derivatives of Regular Expressions and Finite Automata Constructions'', in: Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, 900, Springer-Verlag, p. 455--466, Munich (Germany), 1995.

20

V. M. Antimirov, ``Rewriting Regular Inequalities'', in: Proceedings of the 10th International Conference on Fundamentals of Computation Theory, Lecture Notes in Computer Science, 965, Springer-Verlag, Dresden (Germany), 1995.

21

F. Bertault, ``Adocs : a Drawing System for Generic Combinatorial Structures'', in: Proceedings of the Graph Drawing'95 conference in Passau, Lecture Notes in Computer Science, accepté.

22

D. Briaud, ``An explicit Eta rewrite rule'', in: International Conference on Typed Lambda Calculus and Applications, M. Dezani (réd.), 902, p. 94-108, 1995.

23

B. Chetali, P. Lescanne, ``Formal Verification of a Protocol for Communications over faulty channel'', in: Proceedings of FORTE'95.

24

B. Chetali, ``Formal Verification of Concurrent programs using the Larch Prover'', in: Proceedings of the Workshop on Tools and Algorithms for the construction and analysis of Systems, L. K. Engberg, U.H., A. Skou (réd.), BRICS Notes, p. 174-186, Aarhus, Denmark, 1995.

25

A. Cichon, H. Touzet, ``An Ordinal Calculus for Proving Termination in Term Rewriting'', in: Proceedings of CAAP96, Coll. on Trees in Algebra and Programming, accepté.

26

P. Crégut, B. Heyd, ``Coq-Unity'', in: Actes des journées du GDR Programmation, Accepté.

27

K. Drescher, P. Zimmermann, ``Gröbner bases in MuPAD: state and future'', in: Proceedings of the PoSSo workshop on software, Paris, p. 177--182, mars 1995.

28

M. Hermann, P. Kolaitis, ``Computational complexity of simultaneous elementary AC-matching problems'', in: Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, Prague (Czech Republic), J. Wiedermann, P. Hájek (réd.), Lecture Notes in Computer Science, 969, Springer-Verlag, p. 359-370, 1995.

29

D. Hofbauer, M. Huber, G. Kucherov, ``How to get rid of projection rules in context-free tree grammars (abstract)'', in: Proceedings of the Tbilisi Symposium on Logic, Language and Computation, University of Edinburgh, Human Communication Research Center, RP-72, Gudauri (Georgia), 1995. La version complète est soumise à un livre publié par le Center for the Study of Language and Information (CSLI), Stanford.

30

G. Kucherov, M. Rusinowitch, ``Complexity of testing ground reducibility for linear word rewriting systems with variables'', in: Proceedings of the 4th International Workshop on Conditional and Typed Term Rewriting Systems, Lecture Notes in Computer Science, 968, Springer-Verlag, p. 262--275, Jerusalem (Israel), 1995.

31

G. Kucherov, M. Rusinowitch, ``Matching a Set of Strings with Variable Length Don't Cares'', in: Proceedings of the 6th Symposium on Combinatorial Pattern Matching, E. Ukkonen (réd.), Lecture Notes in Computer Science, 937, Springer-Verlag, p. 230--247, Helsinki (Finland), 1995.

32

F. Leclerc, ``Termination proof of term rewriting systems with the multiset path ordering. A complete development in the system COQ'', in: Int. Conf. on Typed Lambda Calculus and Applications, M. Dezani (réd.), 902, p. 312-327, 1995.

33

P. Lescanne, J. Rouyer-Degli, ``Explicit Substitutions with de Bruijn's Levels'', in: Proceedings of the 6th Conference on Rewriting Techniques and Applications, Kaiserslautern (Germany), J. Hsiang (réd.), Lecture Notes in Computer Science, 914, Springer-Verlag, p. 294-308, 1995.

Rapports de recherche et publications internes

34

B. Chetali, ``A formal proof of a protocol for communications over faulty channels using the Larch Prover'', Research Report n°2476, Inria-Lorraine, 1995.

35

B. Chetali, ``Formal Verification of Concurrent Programs: How to specify UNITY using the Larch Prover'', Research Report n°2475, Inria-Lorraine, 1995.

Divers

36

Z. Benaissa, P. Lescanne, ``Triad Machine, A general computational model for the description of abstract machines'', Soumis pour communication à la conférence ICFP, 1995.