References in zbMATH (referenced in 14 articles )

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

  1. Kordy, Barbara; Mauw, Sjouke; Radomirović, Saša; Schweitzer, Patrick: Attack-defense trees (2014)
  2. Endrullis, Jörg; Hendriks, Dimitri: Lazy productivity via termination (2011)
  3. Ströder, Thomas; Schneider-Kamp, Peter; Giesl, Jürgen: Dependency triples for improving termination analysis of logic programs with cut (2011)
  4. Neurauter, Friedrich; Zankl, Harald; Middeldorp, Aart: Revisiting matrix interpretations for polynomial derivational complexity of term rewriting (2010)
  5. Zankl, Harald; Hirokawa, Nao; Middeldorp, Aart: KBO orientability (2009)
  6. Codish, Michael: Proving termination with (Boolean) satisfaction (2008)
  7. Endrullis, Jörg; Waldmann, Johannes; Zantema, Hans: Matrix interpretations for proving termination of term rewriting (2008)
  8. Koprowski, Adam; Zantema, Hans: Certification of proving termination of term rewriting by matrix interpretations (2008)
  9. Nguyen, Manh Thang; Giesl, Jürgen; Schneider-Kamp, Peter; De Schreye, Danny: Termination analysis of logic programs based on dependency graphs (2008)
  10. Uchiyama, Keita; Sakai, Masahiko; Sakabe, Toshiki: Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (2008)
  11. Geser, Alfons; Hofbauer, Dieter; Waldmann, Johannes; Zantema, Hans: On tree automata that certify termination of left-linear term rewriting systems (2007)
  12. Hirokawa, Nao; Middeldorp, Aart: Tyrolean termination tool: techniques and features (2007)
  13. Payet, Étienne: Detecting non-termination of term rewriting systems using an unfolding operator (2007)
  14. Hofbauer, Dieter; Waldmann, Johannes: Termination of string rewriting with matrix interpretations (2006)