S. María-alpuente, S. Escobar, and . Lucas, Correct and Complete (Positive) Strategy Annotations for OBJ, Proceedings of the 5th International Workshop on Rewriting Logic and its Applications (WRLA), pp.70-89, 2004.
DOI : 10.1016/S1571-0661(05)82529-0

O. Andrei, M. Fernandez, H. Kirchner, G. Melançon, O. Namet et al., PORGY: Strategy-Driven Interactive Transformation of Graphs, TERMGRAPH, 6 th Int. Workshop on Computing with Terms and Graphs of Electronic Proceedings in Theoretical Computer Science (EPTCS), pp.54-68, 2011.
DOI : 10.4204/EPTCS.48.7
URL : https://hal.archives-ouvertes.fr/inria-00563249

O. Andrei and H. Kirchner, A Port Graph Calculus for Autonomic Computing and Invariant Verification, Electronic Notes in Theoretical Computer Science, vol.253, issue.4, pp.17-38, 2009.
DOI : 10.1016/j.entcs.2009.10.015
URL : https://hal.archives-ouvertes.fr/inria-00418560

B. Peter, C. E. Andrews, and . Brown, TPS: A hybrid automatic-interactive system for developing proofs, J. Applied Logic, vol.4, issue.4, pp.367-395, 2006.

S. Antoy and A. Middeldorp, A sequential reduction strategy, Theoretical Computer Science, vol.165, issue.1, pp.75-95, 1996.
DOI : 10.1016/0304-3975(96)00041-2

E. Balland, P. Brauner, R. Kopetz, P. Moreau, and A. Reilles, Tom: Piggybacking Rewriting on Java, Proceedings of the 18th Conference on Rewriting Techniques and Applications, pp.36-47, 2007.
DOI : 10.1007/978-3-540-73449-9_5
URL : https://hal.archives-ouvertes.fr/inria-00142045

E. Balland, P. Moreau, and A. Reilles, Effective strategic programming for java developers. Software: Practice and Experience, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01265319

H. Barendregt, The Lambda-Calculus, its syntax and semantics. Studies in Logic and the Foundation of Mathematics, 1984.

M. Bezem, J. W. Klop, and R. De-vrijer, Term Rewriting Systems. Cambridge Tracts in Theoretical Computer Science, 2003.

P. Borovanský, C. Kirchner, H. Kirchner, and P. Moreau, ELAN from a rewriting logic point of view, Theoretical Computer Science, vol.285, issue.2, pp.155-185, 2002.
DOI : 10.1016/S0304-3975(01)00358-9

P. Borovanský, C. Kirchner, H. Kirchner, P. Moreau, and C. Ringeissen, An Overview of ELAN, Electronic Notes in Theoretical Computer Science, vol.15, pp.55-70, 1998.
DOI : 10.1016/S1571-0661(05)82552-6

P. Borovanský, C. Kirchner, H. Kirchner, and C. Ringeissen, REWRITING WITH STRATEGIES IN $\mathsf{ELAN}$: A FUNCTIONAL SEMANTICS, International Journal of Foundations of Computer Science, vol.12, issue.01, pp.69-98, 2001.
DOI : 10.1142/S0129054101000412

T. Bourdier, H. Cirstea, D. J. Dougherty, and H. Kirchner, Extensional and Intensional Strategies, Proceedings Ninth International Workshop on Reduction Strategies in Rewriting and Programming of Electronic Proceedings In Theoretical Computer Science, pp.1-19, 2009.
DOI : 10.4204/EPTCS.15.1
URL : https://hal.archives-ouvertes.fr/inria-00494636

C. Castro, Building Constraint Satisfaction Problem Solvers Using Rewrite Rules and Strategies, Fundamenta Informaticae, vol.34, issue.3, pp.263-293, 1998.

H. Cirstea, C. Kirchner, L. Liquori, and B. Wack, Rewrite Strategies in the Rewriting Calculus, Electronic Notes in Theoretical Computer Science, 2003.
DOI : 10.1016/S1571-0661(05)82613-1
URL : https://hal.archives-ouvertes.fr/inria-00099586

H. Cirstea and C. Kirchner, The rewriting calculus - part II, Logic Journal of IGPL, vol.9, issue.3, pp.427-498, 2001.
DOI : 10.1093/jigpal/9.3.377
URL : https://hal.archives-ouvertes.fr/inria-00100532

M. Clavel, F. Durán, S. Eker, P. Lincoln, N. Martí-oliet et al., All About Maude -A High-Performance Logical Framework, How to Specify, Program and Verify Systems in Reriting Logic, 2007.

L. De, M. , and G. Passmore, The Strategy Challenge in SMT Solving, Automated Reasoning and Mathematics, pp.15-44, 2013.

D. Delahaye, A Tactic Language for the System Coq, Proc. 7th Int. Conf. on Logic for Programming and Automated Reasoning, pp.85-95, 2000.
DOI : 10.1007/3-540-44404-1_7
URL : https://hal.archives-ouvertes.fr/hal-01125070

W. Edsger and . Dijkstra, Selected writings on computing -a personal perspective. Texts and monographs in computer science, 1982.

J. Daniel and . Dougherty, Rewriting strategies and game strategies, 2008.

C. Ermel, M. Rudolf, and G. Taentzer, THE AGG APPROACH: LANGUAGE AND ENVIRONMENT, Handbook of Graph Grammars and Computing by Graph Transformations: Applications, Languages, and Tools, pp.551-603, 1997.
DOI : 10.1142/9789812815149_0014

M. Fernández, H. Kirchner, and O. Namet, A Strategy Language for Graph Rewriting, 21st International Symposium, LOPSTR 2011, pp.173-188, 2011.
DOI : 10.1007/978-3-642-32211-2_12

M. Fernández, H. Kirchner, and O. Namet, Strategic portgraph rewriting: an interactive modelling and analysis framework, Proceedings 3rd Workshop on GRAPH Inspection and Traversal Engineering, 2014.

K. Futatsugi, J. A. Goguen, J. Jouannaud, and J. Meseguer, Principles of OBJ2, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '85, pp.52-66, 1985.
DOI : 10.1145/318593.318610

R. Geiß, G. Veit-batz, D. Grund, S. Hack, and A. Szalkowski, GrGen: A Fast SPO-Based Graph Rewriting Tool, Proc. of ICGT, pp.383-397, 2006.
DOI : 10.1007/11841883_27

J. Giesl and A. Middeldorp, Innermost Termination of Context-Sensitive Rewriting, Proceedings of the 6th International Conference on Developments in Language Theory, pp.231-244, 2002.
DOI : 10.1007/3-540-45005-X_20

J. Giesl, M. Raffelsieper, P. Schneider-kamp, S. Swiderski, and R. Thiemann, Automated termination proofs for haskell by term rewriting, ACM Transactions on Programming Languages and Systems, vol.33, issue.2, pp.1-7, 2011.
DOI : 10.1145/1890028.1890030

I. Gnaedig and H. Kirchner, Termination of rewriting under strategies, ACM Transactions on Computational Logic, vol.10, issue.2, pp.1-52, 2009.
DOI : 10.1145/1462179.1462182
URL : https://hal.archives-ouvertes.fr/inria-00182432

M. Gordon, R. Milner, L. Morris, M. Newey, and C. Wadsworth, A Metalanguage for interactive proof in LCF, Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '78, pp.119-130, 1978.
DOI : 10.1145/512760.512773

E. Grädel, W. Thomas, and T. Wilke, Automata, Logics, and Infinite Games: A Guide to Current Research [outcome of a Dagstuhl seminar, Lecture Notes in Computer Science, vol.2500, 2001.
DOI : 10.1007/3-540-36387-4

A. Habel, J. Müller, and D. Plump, Double-pushout graph transformation revisited, Mathematical Structures in Computer Science, vol.11, issue.05, pp.637-688, 2001.
DOI : 10.1017/S0960129501003425

A. Habel and D. Plump, Computational Completeness of Programming Languages Based on Graph Transformation, Foundations of Software Science and Computation Structures, 4th International Conference, FOSSACS 2001, Proceedings, pp.230-245, 2001.
DOI : 10.1007/3-540-45315-6_15

M. Hanus, Curry: A multi-paradigm declarative language (system description ), Twelfth Workshop Logic Programming, WLP'97, 1997.

G. Huet and J. Lévy, Computations in non-ambiguous linear term rewriting systems, 1979.

G. Huet and J. Lévy, Computations in orthogonal rewriting systems , I and II, Computational Logic, pp.395-414, 1991.

L. P. Simon and . Jones, Haskell 98 language and libraries: the revised report, 2003.

A. S. Kechris, Classical Descriptive Set Theory, Graduate Texts in Mathematics, vol.156, 1995.
DOI : 10.1007/978-1-4612-4190-4

C. Kirchner, F. Kirchner, and H. Kirchner, Strategic computations and deductions, Reasoning in Simple Type Theory. Festchrift in Honour of Peter B. Andrews on His 70th Birthday of Studies in Logic and the Foundations of Mathematics, pp.339-364, 2008.

C. Kirchner, F. Kirchner, and H. Kirchner, Constraint Based Strategies, Proceedings 18th International Workshop on Functional and (Constraint) Logic Programming, pp.13-26, 2009.
DOI : 10.1007/978-3-642-11999-6_2
URL : https://hal.archives-ouvertes.fr/inria-00494531

C. Kirchner, H. Kirchner, and M. Vittek, Implementing computational systems with constraints, Principles and Practice of Constraint Programming, pp.156-165, 1993.

C. Kirchner, H. Kirchner, and M. Vittek, Designing constraint logic programming languages using computational systems, Principles and Practice of Constraint Programming, pp.131-158, 1995.

H. Kirchner, A rewriting point of view on strategies, Proceedings 1st International Workshop on Strategic Reasoning, SR 2013 of Electronic Proceedings in Theoretical Computer Science (EPTCS), pp.99-105, 2013.
DOI : 10.4204/EPTCS.112.15
URL : https://hal.archives-ouvertes.fr/hal-00986699

A. Letichevsky, Development of rewriting strategies, Lecture Notes in Computer Science, vol.714, pp.378-390, 1993.
DOI : 10.1007/3-540-57186-8_92

J. Lévy, Optimal reductions in the lambda-calculus, To H.B.Curry: Essays on Combinatory Logic, Lambda Calculus and Formalism, pp.159-191, 1980.

S. Lucas, Context-sensitive computations in functional and functional logic programs, Journal of Functional and Logic Programming, vol.1, pp.1-61, 1998.

S. Lucas, Termination of on-demand rewriting and termination of OBJ programs, Proceedings of the 3rd ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '01, pp.82-93, 2001.
DOI : 10.1145/773184.773194

S. Lucas, Termination of Rewriting with Strategy Annotations, Proceedings of the 8th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, LPAR'01, pp.669-684, 2001.
DOI : 10.1007/3-540-45653-8_46

S. Lucas, C. Marché, and J. Meseguer, Operational termination of conditional term rewriting systems, Information Processing Letters, vol.95, issue.4, pp.446-453, 2015.
DOI : 10.1016/j.ipl.2005.05.002

S. Lucas and J. Meseguer, Strong and Weak Operational Termination of Order-Sorted Rewrite Theories, Selected Papers of International Workshop on Rewriting Logic and its Applications (WRLA), pp.178-194, 2014.
DOI : 10.1007/978-3-319-12904-4_10

N. Martí-oliet and J. Meseguer, Rewriting Logic as a Logical and Semantic Framework, Electronic Notes in Theoretical Computer Science, 2000.
DOI : 10.1007/978-94-017-0464-9_1

N. Martí-oliet, J. Meseguer, and A. Verdejo, Towards a Strategy Language for Maude, Proceedings Fifth International Workshop on Rewriting Logic and its Applications, pp.417-441, 2004.
DOI : 10.1016/j.entcs.2004.06.020

N. Martí-oliet, J. Meseguer, and A. Verdejo, A Rewriting Semantics for Maude Strategies, Electronic Notes in Theoretical Computer Science, vol.238, issue.3, pp.227-247, 2008.
DOI : 10.1016/j.entcs.2009.05.022

W. Mccune, Semantic Guidance for Saturation Provers, Artificial Intelligence and Symbolic Computation, pp.18-24, 2006.
DOI : 10.1007/11856290_4

J. Meseguer, Conditional rewriting logic as a unified model of concurrency, Theoretical Computer Science, vol.96, issue.1, pp.73-155, 1992.
DOI : 10.1016/0304-3975(92)90182-F

U. Nickel, J. Niere, and A. Zündorf, The FUJABA environment, Proceedings of the 22nd international conference on Software engineering , ICSE '00, pp.742-745, 2000.
DOI : 10.1145/337180.337620

J. O. Michael and . Donnell, Computing in Systems Described by Equations, Lecture Notes in Computer Science, vol.58, 1977.

K. Okamoto, M. Sakai, N. Nishida, and T. Sakabe, Weaklyinnermost strategy and its completeness on terminating right-linear TRSs, Proceedings 5th International Workshop on Reduction Strategies in Rewriting and Programming, 2005.

S. Owre, J. Rushby, and N. Shankar, PVS: A prototype verification system, Proc. 11th Int. Conf. on Automated Deduction, pp.748-752, 1992.
DOI : 10.1007/3-540-55602-8_217
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.28.2627

M. J. Plasmeijer and M. C. Van-eekelen, Functional Programming and Parallel Graph Rewriting, 1993.

G. D. Plotkin, A structural approach to operational semantics, J. Log. Algebr. Program, pp.60-6117, 2004.

D. Plump, The Graph Programming Language GP, Lecture Notes in Computer Science, vol.5725, pp.99-122, 2009.
DOI : 10.1007/978-3-642-03564-7_6

D. Plump and S. Steinert, The Semantics of Graph Programs, Proceedings Tenth International Workshop on Rule-Based Programming of Electronic Proceedings in Theoretical Computer Science (EPTCS), pp.27-38, 2009.
DOI : 10.4204/EPTCS.21.3

A. Rensink, The GROOVE Simulator: A??Tool for State Space Generation, AGTIVE, pp.479-485, 2003.
DOI : 10.1007/978-3-540-25959-6_40

A. Schürr, A. J. Winter, and A. Zündorf, THE PROGRES APPROACH: LANGUAGE AND ENVIRONMENT, Handbook of Graph Grammars and Computing by Graph Transformations: Applications, Languages, and Tools, pp.479-546, 1997.
DOI : 10.1142/9789812815149_0013

J. Van, Just-in-time: On strategy annotations, Proceedings of WRS 2001, 1st International Workshop on Reduction Strategies in Rewriting and Programming, pp.41-63, 2001.

V. Van, O. , and R. De-vrijer, Term Rewriting Systems, volume 2 of Cambridge Tracts in Theoretical Computer Science, chapter 9: Strategies, 2003.

E. Visser and . Stratego, Stratego: A Language for Program Transformation Based on Rewriting Strategies System Description of Stratego 0.5, Rewriting Techniques and Applications (RTA'01), volume 2051 of Lecture Notes in Computer Science, pp.357-361, 2001.
DOI : 10.1007/3-540-45127-7_27

E. Visser, A survey of strategies in rule-based program transformation systems, Journal of Symbolic Computation, vol.40, issue.1, pp.831-873, 2005.
DOI : 10.1016/j.jsc.2004.12.011

I. Walukiewicz, A landscape with games in the background, Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science, 2004., pp.356-366, 2004.
DOI : 10.1109/LICS.2004.1319630