swMATH39826MaRDI QIDQ55526FDOQ55526
Author name not available (Why is that?)
Official website: http://cl-informatik.uibk.ac.at/software/tct/
Cited In (22)
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Complexity analysis for term rewriting by integer transition systems
- Runtime complexity analysis of logically constrained rewriting
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- AProVE
- ABC
- Ctrl
- KITTeL
- A Perron-Frobenius theorem for deciding matrix growth
- RAML
- CoCoWeb
- Cops
- Amortized Complexity
- TiML
- Perron Frobenius
- Constant runtime complexity of term rewriting is semi-decidable
- ComplexityParser
- Lower bounds for runtime complexity of term rewriting
- Kruskal's tree theorem for acyclic term graphs
- Grez
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
This page was built for software: TcT
