TPDB
From MaRDI portal
Software:22077
swMATH10108MaRDI QIDQ22077FDOQ22077
Author name not available (Why is that?)
Cited In (20)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description)
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Tuple interpretations for termination of term rewriting
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Lazy productivity via termination
- Title not available (Why is that?)
- KBO orientability
- Attack-defense trees
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- Dependency Triples for Improving Termination Analysis of Logic Programs with Cut
- Revisiting Matrix Interpretations for Polynomial Derivational Complexity of Term Rewriting
- Tyrolean termination tool: techniques and features
- Proving Termination with (Boolean) Satisfaction
- Matrix interpretations for proving termination of term rewriting
- On tree automata that certify termination of left-linear term rewriting systems
- Termination of String Rewriting with Matrix Interpretations
- Termination Analysis of Logic Programs Based on Dependency Graphs
- A Calculus for Modular Loop Acceleration
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
This page was built for software: TPDB
