MTT: The Maude termination tool. Despite the remarkable development of the theory of termination of rewriting, its application to high-level programming languages is far from being optimal. This is due to the need for features such as conditional equations and rules, types and subtypes, (possibly programmable) strategies for controlling the execution, matching modulo axioms, and so on, that are used in many programs and tend to place such programs outside the scope of current termination tools. The operational meaning of such features is often formalized in a proof-theoretic manner by means of an inference system rather than just by a rewriting relation. In particular, Generalized Rewrite Theories (GRT) are a recent generalization of rewrite theories at the heart of the most recent formulation of Maude.

References in zbMATH (referenced in 18 articles )

Showing results 1 to 18 of 18.
Sorted by year (citations)

  1. Lucas, Salvador; Meseguer, José: Dependency pairs for proving termination properties of conditional term rewriting systems (2017)
  2. Clavel, Manuel; Durán, Francisco; Eker, Steven; Escobar, Santiago; Lincoln, Patrick; Martí-Oliet, Narciso; Talcott, Carolyn: Two decades of Maude (2015)
  3. Lucas, Salvador; Meseguer, José: Localized operational termination in general logics (2015)
  4. Roşu, Grigore; Lucanu, Dorel: Behavioral rewrite systems and behavioral productivity (2014)
  5. Bouhoula, Adel; Jacquemard, Florent: Sufficient completeness verification for conditional and constrained TRS (2012)
  6. Durán, Francisco; Meseguer, José: On the Church-Rosser and coherence properties of conditional order-sorted rewrite theories (2012)
  7. Meseguer, José: Twenty years of rewriting logic (2012)
  8. Alarcón, Beatriz; Gutiérrez, Raúl; Lucas, Salvador; Navarro-Marset, Rafael: Proving termination properties with mu-term (2011)
  9. Alpuente, María; Escobar, Santiago; Iborra, José: Modular termination of basic narrowing and equational unification (2011)
  10. Codescu, Mihai; Mossakowski, Till; Riesco, Adrián; Maeder, Christian: Integrating Maude into Hets (2011)
  11. Alpuente, M.; Comini, M.; Escobar, S.; Falaschi, M.; Iborra, J.: A compact fixpoint semantics for term rewriting systems (2010)
  12. Durán, Francisco; Meseguer, José: A Church-Rosser checker tool for conditional order-sorted equational Maude specifications (2010)
  13. Durán, Francisco; Meseguer, José: A Maude coherence checker tool for conditional order-sorted rewrite theories (2010)
  14. Durán, Francisco; Lucas, Salvador; Meseguer, José: Termination modulo combinations of equational theories (2009)
  15. Durán, Francisco; Lucas, Salvador; Meseguer, José: Methods for proving termination of rewriting-based programming languages by transformation (2009)
  16. Armando, Alessandro (ed.); Baumgartner, Peter (ed.); Dowek, Gilles (ed.): Automated reasoning. 4th international joint conference, IJCAR 2008, Sydney, Australia, August 12--15, 2008 Proceedings (2008)
  17. Durán, Francisco; Lucas, Salvador; Meseguer, José: MTT: The Maude termination tool. (System description) (2008)
  18. Meseguer, José; Palomino, Miguel; Martí-Oliet, Narciso: Equational abstractions (2008)