D. Bibliographie, Aho and M. Corasick. Efficient string matching, Voir aussi : pointeurs vers les algorithmes liés. ANNEXE A. ASTL 1.2 DOCUMENTATION, pp.333-340, 1975.

D. Batory, Intelligent components and software generators, 1997.

D. Batory, V. Singhal, J. Thomas, S. Dasari, B. Geraci et al., The GenVoca model of software-system generators, IEEE Software, vol.11, issue.5, pp.89-94, 1994.
DOI : 10.1109/52.311067

D. S. Batory, Subjectivity and software system generators, 1995.

D. Beauquier, J. Berstel, and P. Chrétienne, Elements d'Algorithmique, 1992.
URL : https://hal.archives-ouvertes.fr/hal-00619786

G. Bracha and W. Cook, Mixin-based inheritance, Proceedings of the Conference on Object-Oriented Programming : Systems, Languages and Applications, pp.303-311, 1990.
DOI : 10.1145/97946.97982

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.156.4510

U. Breymann, K. Czarnecki, and U. Eisenecker, Genera- tive components : One step beyond generic programming, 1998.

H. Brönnimann, L. Kettner, S. Schirra, and R. Veltkamp, Applications of the Generic Programming Paradigm in the Design of CGAL
DOI : 10.1007/3-540-39953-4_16

T. Cargill, C++ Programming Style, 1992.

K. Czarnecki, Generative Programming, Thèse de doctorat, 1998.
DOI : 10.1007/3-540-36208-8_2

K. Czarnecki, U. Eisenecker, R. Glück, D. Vandevoorde, and T. Veldhuizen, Generative Programming and Active Libraries, Generic Programming '98, pp.25-39, 2000.
DOI : 10.1007/3-540-39953-4_3

J. C. Dehnert and A. Stepanov, Fundamentals of Generic Programming, Generic Programming '98, pp.1-11, 2000.
DOI : 10.1007/3-540-39953-4_1

H. Eichelberger and J. W. Gudenberg, UML description of the STL, First Workshop on C++ Template Programming, 2000.

U. W. Eisenecker, F. Blinn, and K. Czarnecki, A solution to the constructor-problem of mixin-based programming in C++, First Workshop on C++ Template Programming, 2000.

M. Forster, A. Pick, and M. Raitner, The graph template libray 0.3.1 (gtl). Documentation, 1999.

E. Gamess, D. R. Musser, and A. Sánchez-ruíz, Complete traversals and their implementation using the standard template library, Proceedings of the XXIII Latinamerican Conference on Informatics, pp.221-230, 1997.

E. Gamma, R. Helm, R. Johnson, and J. Vlissides, Design Patterns, 1995.

E. R. Gansner and S. C. North, An open graph visualization system and its applications to software engineering, Software: Practice and Experience, vol.28, issue.11, pp.1203-1233, 2000.
DOI : 10.1002/1097-024X(200009)30:11<1203::AID-SPE338>3.0.CO;2-N

G. Glass, B. Schuchert, M. Gradman, and C. Joy, The STL <primer> Database template library, 1996.

M. Gross, The use of finite automata in the lexical representation of natural language, Electronic Dictionaries and Automata in Computational Linguistics, pp.35-50, 1989.
DOI : 10.1007/3-540-51465-1_3

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, 1979.

W. L. Hürsch and C. V. Lopes, Separation of concerns, février 1995

D. Kapur and D. R. Musser, Tecton : a framework for specifying and verifying generic system components, 1992.

A. Kershenbaum, D. R. Musser, and A. Stepanov, Higher order imperative programming, 1988.

D. Kühl, M. Jazayeri, R. G. Loos, and D. R. Musser, Generic Graph Algorithms, Generic Programming '98, pp.249-255, 2000.
DOI : 10.1007/3-540-39953-4_19

K. Kreft and A. Langer, Allocator types, C++ Report, vol.10, issue.6, pp.54-61, 1998.

U. Köthe and K. Weihe, The STL Model in the Geometric Domain, Generic Programming '98, pp.232-248, 2000.
DOI : 10.1007/3-540-39953-4_18

K. Lieberherr and B. Patt-shamir, The Refinement Relation of Graph-Based Generic Programs, Generic Programming '98, pp.40-52, 2000.
DOI : 10.1007/3-540-39953-4_4

A. Ludwig and D. Heuzeroth, Metaprogramming in the Large, Generative and Component-Based Software Engineering, Second International Symposium, pp.178-187, 2000.
DOI : 10.1007/3-540-44815-2_13

K. Mehlhorn and S. Näher, LEDA a library of efficient data types and algorithms, Mathematical Foundations of Computer Science 1989 (MFCS'89) : Proc, pp.88-106, 1989.
DOI : 10.1007/3-540-51486-4_58

M. Mohri, F. Pereira, and M. Riley, A rational design for a weighted finite-state transducer library, Lecture Notes in Computer Science, vol.1436, pp.144-158, 1997.
DOI : 10.1007/BFb0031388

D. Moss, A. Bleasby, and W. Pitt, The bioinformatics template library (btl) Présentationàtion`tionà la conférence Object's in Bioinformatics, European Bioinformatics Institute, vol.97, 1997.

D. Musser, Measuring computing times and operation counts of generic algorithms, 2000.

D. R. Musser and A. Saini, STL Tutorial and Reference Guide, 1996.

D. R. Musser, S. Schupp, and R. Loos, Requirement Oriented Programming, Generic Programming '98, pp.12-24, 2000.
DOI : 10.1007/3-540-39953-4_2

D. R. Musser and A. Stepanov, A library of generic algorithms in Ada, Proceedings of the 1987 annual ACM SIGAda international conference on Ada , SIGAda '87, pp.216-225, 1987.
DOI : 10.1145/317500.317529

D. R. Musser and A. Stepanov, Generic programming, Springer LNCS 358, pp.13-25, 1989.
DOI : 10.1007/3-540-51084-2_2

D. R. Musser and A. Stepanov, Algorithm-oriented generic libraries, Software: Practice and Experience, vol.21, issue.7, pp.623-642, 1994.
DOI : 10.1002/spe.4380240703

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.15.499

N. C. Myers, Traits : a new and useful template technique, C++ Report, vol.7, issue.5, pp.32-35, 1995.

M. Nelson, C++ Programmer's Guide to the Standard Template Library, 1995.

J. Ovlinger and M. Wand, A language for specifying recursive traversals of object structures, Proceeings of the 1999 ACM SIGPLAN Conference on Object-Oriented Programming , Systems, Languages, and Applications (OOPSLA'99), pp.70-81, 1999.

J. Ovlinger and M. Wand, A language for specifying traversals of object structures, 1999.

D. Perrin, Automates et algorithmes sur les mots, Annales des Télécommunications. CNET, 1989.

D. Raymond and D. Wood, Grail: A C++ Library for Automata and Expressions, Journal of Symbolic Computation, vol.17, issue.4, pp.341-350, 1995.
DOI : 10.1006/jsco.1994.1023

D. Revuz, Dictionnaires et Lexiques, Méthodes et Algorithmes, Thèse de doctorat, 1991.

D. Revuz, Operations on extended automata, Lecture Notes in Computer Science, vol.1436, pp.171-175, 1997.
DOI : 10.1007/BFb0031390

URL : https://hal.archives-ouvertes.fr/hal-00620117

D. Revuz, Operations on extended automata, Lecture Notes in Computer Science, vol.1436, pp.171-175, 2000.
DOI : 10.1007/BFb0031390

URL : https://hal.archives-ouvertes.fr/hal-00620117

E. Roche and Y. Schabes, Finite State Language Processing, 1997.

S. Schupp, R. Loos, M. Jazayeri, R. G. Loos, and D. R. Musser, SuchThat ??? Generic Programming Works, Generic Programming '98, pp.133-145, 2000.
DOI : 10.1007/3-540-39953-4_11

R. W. Selby, Empirically analyzing software reuse in a production environment, Software Reuse : Emerging Technology, pp.176-189, 1988.

J. G. Siek, L. Lee, and A. Lumsdaine, The generic graph component library, Proceedings of the 14th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications , OOPSLA '99, pp.399-414, 1999.
DOI : 10.1145/320384.320428

J. G. Siek, L. Lee, and A. Lumsdaine, Boost Graph Library, The User Guide and Reference Manual, 2002.

J. G. Siek and A. Lumsdaine, The Matrix Template Library: A Unifying Framework for Numerical Linear Algebra, Proceedings of the ECOOP'98 Workshop on Parallel Object-Oriented Computing. POOSC'98, 1998.
DOI : 10.1007/3-540-49255-0_152

Y. Smaragdakis and D. Batory, Implementing reusable object-oriented components, Proceedings. Fifth International Conference on Software Reuse (Cat. No.98TB100203), pp.36-45, 1998.
DOI : 10.1109/ICSR.1998.685728

Y. Smaragdakis and D. S. Batory, Implementing layer designs with mixin layers98 -Object-Oriented Programming, 12th European Conference Proceedings, volume 1445 of Lecture Notes in Computer Science, pp.550-570, 1998.
DOI : 10.1007/bfb0054107

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.147.1492

Y. Smaragdakis and D. S. Batory, Mixin-Based Programming in C++, Generative and Component-Based Software Engineering, Second International Symposium, pp.163-177, 2000.
DOI : 10.1007/3-540-44815-2_12

]. J. Soukup, Intrusive data structures publié en trois partie entre mai et octobre, C++ Report, 1998.

J. Soukup, The pattern template library 1.1 (ptl). Documentation, Code Farms Inc, 1998.
DOI : 10.1201/9781420049114.ch37

R. M. Stallman, Using and porting the gnu compiler collection for gcc-3.0. Documentation , Free Software Foundation, Inc, 2001.

A. Stepanov and M. Lee, The standard template library, 1995.

S. Teale, C++ IOStreams Handbook, 1994.

M. Vanhilst and D. Notkin, Using C++ templates to implement role-based designs, ISOSTAS '96, Second JSSST International Symposium on Object Technologies for Advanced Software, pp.22-37, 1996.
DOI : 10.1007/3-540-60954-7_41

T. L. Veldhuizen, Expression templates, C++ Report, vol.7, issue.5, pp.26-31, 1995.

T. L. Veldhuizen, Using C++ template metaprograms, C++ Report, vol.7, issue.4, pp.36-43, 1995.

T. L. Veldhuizen, Scientific computing : C++ versus fortran. Dr. Dobb's Journal, pp.34-41, 1997.

T. L. Veldhuizen, Arrays in Blitz++, Proceedings of the 2nd International Scientific Computing in Object-Oriented Parallel Environments (ISCOPE'98), volume 1505, pp.223-230, 1998.
DOI : 10.1007/3-540-49372-7_24

T. L. Veldhuizen, C++ templates as partial evaluation In Partial Evaluation and Semantic-Based Program Manipulation, pp.13-18, 1999.

T. L. Veldhuizen and D. Gannon, Active libraries : Rethinking the roles of compilers and libraries, Proceedings of the SIAM Workshop on Object Oriented Methods for Inter-operable Scientific and Engineering Computing (OO'98), 1998.

T. L. Veldhuizen and M. E. Jernigan, Will C++ be faster than Fortran?, Proceedings of the 1st International Scientific Computing in Object-Oriented Parallel Environments (ISCOPE'97, pp.49-56, 1997.
DOI : 10.1007/3-540-63827-X_43

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.41.7266

B. W. Watson, The design and implementation of the fire engine : A c++ toolkit for finite automata and regular expressions, 1994.

B. W. Watson, Taxonomies and Toolkits of Regular Language Algorithms, Thèse de doctorat, 1995.

N. Wirth, Algorithms + Data Structures = Programs, 1976.