9 citations · 40 across the 22 of their papers we have counts for
Showing 2015 · cs.LOShow all
2 papers · 2 filters
cs.LO2015
Proving Looping and Non-Looping Non-Termination by Finite Automata
Jörg Endrullis, Hans Zantema
A new technique is presented to prove non-termination of term rewriting. The basic idea is to find a non-empty regular language of terms that is closed under rewriting and does not…
cs.LO2015
Proving Termination of Graph Transformation Systems using Weighted Type Graphs over Semirings
H. J. Sander Bruggink, Barbara König, Dennis Nolte +1
We introduce techniques for proving uniform termination of graph transformation systems, based on matrix interpretations for string rewriting. We generalize this technique by adapt…