Conditional rewriting logic as a unified model of concurrency
Selected papers of the Second Workshop on Concurrency and compositionality
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Towards a Strategy Language for Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
All about maude - a high-performance logical framework: how to specify, program and verify systems in rewriting logic
A Port Graph Calculus for Autonomic Computing and Invariant Verification
Electronic Notes in Theoretical Computer Science (ENTCS)
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
A formal interactive verification environment for the plan execution interchange language
IFM'12 Proceedings of the 9th international conference on Integrated Formal Methods
Towards formalising use case maps in Maude strategy language: application to multi-agent systems
International Journal of Computer Applications in Technology
| Hi-index | 0.00 |
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.