![]() |
Non-Termination |
![]() |
AProVE Help System → Techniques → Techniques working on SCCs → | Non-Termination |
The algorithm starts with all pairs (l, r) where l → r ∈ P and uses narrowing with rules from P ∪ R to compute further reachability pairs. For efficiency reasons AProVE only checks for the special cases of σ1 = id (matching) and σ2 = id (unification).
This technique is especially useful to avoid waste of time in incomplete proofs where termination is already destroyed by a transformation, e.g. from context-sensitive rewrite systems to ordinary term rewriting.