TPDB
From MaRDI portal
Cited in
(44)- iRankFinder
- FLATA
- PURRS
- TERMINATOR
- Tyrolean
- AProVE
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- 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
- CiME
- MU-TERM
- Jambox
- TPA
- Matchbox
- Tsukuba
- TORPA
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
- KITTeL
- Dependency triples for improving termination analysis of logic programs with cut
- FAST
- Nagoya Termination Tool
- CAMPY
- RAML
- RRE
- LoAT
- Termination of String Rewriting with Matrix Interpretations
- Detecting Non-termination of Term Rewriting Systems Using an Unfolding Operator
- ProTeM
- Revisiting matrix interpretations for polynomial derivational complexity of term rewriting
- ProTeM: a proof term manipulator (system description)
- A calculus for modular loop acceleration
- Attack-defense trees
- Certification of Proving Termination of Term Rewriting by Matrix Interpretations
- Lazy productivity via termination
- Proving Termination with (Boolean) Satisfaction
- Termination Analysis of Logic Programs Based on Dependency Graphs
- TcT
- KoAT
- NaTT
- KBO orientability
- Tyrolean termination tool: techniques and features
- On tree automata that certify termination of left-linear term rewriting systems
- Matrix interpretations for proving termination of term rewriting
This page was built for software: TPDB
