swMATH10108MaRDI QIDQ22077FDOQ22077
Author name not available (Why is that?)
Official website: http://termination-portal.org/wiki/TPDB
Cited In (44)
- 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
- NaTT
- Dependency triples for improving termination analysis of logic programs with cut
- A calculus for modular loop acceleration
- KBO orientability
- Attack-defense trees
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- FLATA
- PURRS
- TERMINATOR
- AProVE
- Tyrolean
- CiME
- Jambox
- MU-TERM
- Matchbox
- TPA
- TORPA
- Tsukuba
- KITTeL
- FAST
- CAMPY
- Nagoya Termination Tool
- RAML
- RRE
- LoAT
- ProTeM
- KoAT
- TcT
- ProTeM: a proof term manipulator (system description)
- iRankFinder
- 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
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
This page was built for software: TPDB
