Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
Reflection in Rewriting Logic: Metalogical Foundations and Metaprogramming Applications
ELAN from a rewriting logic point of view
Theoretical Computer Science - Rewriting logic and its applications
Specification of real-time and hybrid systems in rewriting logic
Theoretical Computer Science - Rewriting logic and its applications
A Maude specification of an object-oriented model for telecommunication networks
Theoretical Computer Science - Rewriting logic and its applications
Science of Computer Programming
Modular Structural Operational Semantics with Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Using Maude and Its Strategies for Defining a Framework for Analyzing Eden Semantics
Electronic Notes in Theoretical Computer Science (ENTCS)
Deduction, Strategies, and Rewriting
Electronic Notes in Theoretical Computer Science (ENTCS)
Strategies and simulations in a semantic framework
Journal of Algorithms
Regular Strategies as Proof Tactics for CIRC
Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of Priority Rewriting
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
Strategy-Based Proof Calculus for Membrane Systems
Electronic Notes in Theoretical Computer Science (ENTCS)
Hierarchical Design Rewriting with Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A Guide to Extending Full Maude Illustrated with the Implementation of Real-Time Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
Patterns for Maude Metalanguage Applications
Electronic Notes in Theoretical Computer Science (ENTCS)
Proof Search for the First-Order Connection Calculus in Maude
Electronic Notes in Theoretical Computer Science (ENTCS)
A Rewriting Semantics for Maude Strategies
Electronic Notes in Theoretical Computer Science (ENTCS)
Invariant-driven specifications in Maude
Science of Computer Programming
Unification and Narrowing in Maude 2.4
RTA '09 Proceedings of the 20th International Conference on Rewriting Techniques and Applications
Typed Mobile Ambients in 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
Expressing control mechanisms of membranes by rewriting strategies
WMC'06 Proceedings of the 7th international conference on Membrane Computing
WFLP'09 Proceedings of the 18th international conference on Functional and Constraint Logic Programming
A tactic language for declarative proofs
ITP'10 Proceedings of the First international conference on Interactive Theorem Proving
A strategy language for graph rewriting
LOPSTR'11 Proceedings of the 21st international conference on Logic-Based Program Synthesis and Transformation
Modular access control via strategic rewriting
ESORICS'07 Proceedings of the 12th European conference on Research in Computer Security
A rule-based framework for building superposition-based decision procedures
WRLA'12 Proceedings of the 9th international conference on Rewriting Logic and Its Applications
| Hi-index | 0.00 |
We describe a first proposal for a strategy language for Maude, to control the rewriting process and to be used at the object level instead of at the metalevel. We also describe a prototype implementation built over Full Maude using the metalevel and the metalanguage facilities provided by Maude. Finally, we include a series of examples that illustrate the main features of the proposed language.