TPDB
From MaRDI portal
Software:22077
No author found.
Related Items (20)
A Calculus for Modular Loop Acceleration ⋮ KBO orientability ⋮ Tyrolean termination tool: techniques and features ⋮ On tree automata that certify termination of left-linear term rewriting systems ⋮ Unnamed Item ⋮ Termination of String Rewriting with Matrix Interpretations ⋮ Matrix interpretations for proving termination of term rewriting ⋮ Dependency Triples for Improving Termination Analysis of Logic Programs with Cut ⋮ Attack-defense trees ⋮ Lazy productivity via termination ⋮ Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator ⋮ Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting ⋮ Certification of Proving Termination of Term Rewriting by Matrix Interpretations ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Proving Termination with (Boolean) Satisfaction ⋮ Termination Analysis of Logic Programs Based on Dependency Graphs ⋮ Tuple interpretations for termination of term rewriting ⋮ Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) ⋮ Automatic complexity analysis of integer programs via triangular weakly non-linear loops ⋮ Decidability of Innermost Termination and Context-Sensitive Termination for Semi-Constructor Term Rewriting Systems
This page was built for software: TPDB
