### Abstract

Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can think of a strategy language S as a rewrite theory transformation R → S(R) such that S(R) provides a way of executing R in a controlled way. One such theory transformation for the Maude strategy language is presented in detail in this paper. Progress in the semantic foundations of Maude's strategy language has led us to study some general requirements for strategy languages. Some of these requirements, like soundness and completeness with respect to the rewrites in R, are absolute requirements that every strategy language should fulfill. Other more optional requirements, that we call monotonicity and persistence, represent the fact that no solution is ever lost. We show that the Maude strategy language satisfies all these four requirements.

Original language | English (US) |
---|---|

Pages (from-to) | 207-226 |

Number of pages | 20 |

Journal | Electronic Notes in Theoretical Computer Science |

State | Published - Dec 1 2008 |

Event | 7th International Workshop on Rewriting Logic and its Applications, WRLA 2008 (European Joint Conference on Theory and Practice of Software, ETAPS 2008) - Budapest, Hungary Duration: Mar 29 2008 → Mar 30 2008 |

### Fingerprint

### Keywords

- ELAN
- Maude
- Rewriting logic
- Rewriting semantics
- Strategies

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Electronic Notes in Theoretical Computer Science*, 207-226.

**A Rewriting semantics for Maude strategies.** / Martí-Oliet, Narciso; Meseguer, José; Verdejo, Alberto.

Research output: Contribution to journal › Conference article

*Electronic Notes in Theoretical Computer Science*, pp. 207-226.

}

TY - JOUR

T1 - A Rewriting semantics for Maude strategies

AU - Martí-Oliet, Narciso

AU - Meseguer, José

AU - Verdejo, Alberto

PY - 2008/12/1

Y1 - 2008/12/1

N2 - Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can think of a strategy language S as a rewrite theory transformation R → S(R) such that S(R) provides a way of executing R in a controlled way. One such theory transformation for the Maude strategy language is presented in detail in this paper. Progress in the semantic foundations of Maude's strategy language has led us to study some general requirements for strategy languages. Some of these requirements, like soundness and completeness with respect to the rewrites in R, are absolute requirements that every strategy language should fulfill. Other more optional requirements, that we call monotonicity and persistence, represent the fact that no solution is ever lost. We show that the Maude strategy language satisfies all these four requirements.

AB - Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can think of a strategy language S as a rewrite theory transformation R → S(R) such that S(R) provides a way of executing R in a controlled way. One such theory transformation for the Maude strategy language is presented in detail in this paper. Progress in the semantic foundations of Maude's strategy language has led us to study some general requirements for strategy languages. Some of these requirements, like soundness and completeness with respect to the rewrites in R, are absolute requirements that every strategy language should fulfill. Other more optional requirements, that we call monotonicity and persistence, represent the fact that no solution is ever lost. We show that the Maude strategy language satisfies all these four requirements.

KW - ELAN

KW - Maude

KW - Rewriting logic

KW - Rewriting semantics

KW - Strategies

UR - http://www.scopus.com/inward/record.url?scp=84890865864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84890865864&partnerID=8YFLogxK

M3 - Conference article

AN - SCOPUS:84890865864

SP - 207

EP - 226

JO - Electronic Notes in Theoretical Computer Science

JF - Electronic Notes in Theoretical Computer Science

SN - 1571-0661

ER -