References in zbMATH (referenced in 14 articles )

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

  1. Alarcón, Beatriz; Gutiérrez, Raúl; Lucas, Salvador; Navarro-Marset, Rafael: Proving termination properties with \textscmu-term (2011)
  2. Endrullis, Jörg; Hendriks, Dimitri: Lazy productivity via termination (2011)
  3. Sternagel, Christian; Thiemann, René: Generalized and formalized uncurrying (2011)
  4. Sternagel, Christian; Thiemann, René: Modular and certified semantic labeling and unlabeling (2011)
  5. Alarcón, Beatriz; Gutiérrez, Raúl; Lucas, Salvador: Context-sensitive dependency pairs (2010)
  6. Gutiérrez, Raúl; Lucas, Salvador: Proving termination in the context-sensitive dependency pair framework (2010)
  7. Koprowski, Adam; Waldmann, Johannes: Max/Plus tree automata for termination of term rewriting (2009)
  8. Raffelsieper, Matthias; Zantema, Hans: A transformational approach to prove outermost termination automatically (2009)
  9. Thiemann, René; Sternagel, Christian: Loops under strategies (2009)
  10. Zankl, Harald; Middeldorp, Aart: Increasing interpretations (2009)
  11. Courtieu, Pierre; Forest, Julien; Urbain, Xavier: Certifying a termination criterion based on graphs, without graphs (2008)
  12. Fuhs, Carsten; Navarro-Marset, Rafael; Otto, Carsten; Giesl, Jürgen; Lucas, Salvador; Schneider-Kamp, Peter: Search techniques for rational polynomial orders (2008)
  13. Lucas, Salvador; Meseguer, José: Termination of just/fair computations in term rewriting (2008)
  14. Hofbauer, Dieter; Waldmann, Johannes: Termination of string rewriting with matrix interpretations (2006)