TcT
From MaRDI portal
Cited in
(22)- ComplexityParser
- From Jinja bytecode to term rewriting: a complexity reflecting transformation
- Complexity analysis for term rewriting by integer transition systems
- Constant runtime complexity of term rewriting is semi-decidable
- AProVE
- Inferring expected runtimes of probabilistic integer programs using expected sizes
- Runtime complexity analysis of logically constrained rewriting
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs
- ABC
- A Perron-Frobenius theorem for deciding matrix growth
- Lower bounds for runtime complexity of term rewriting
- Ctrl
- KITTeL
- RAML
- TiML
- CoCoWeb
- Cops
- Perron Frobenius
- Amortized Complexity
- Kruskal's tree theorem for acyclic term graphs
- Grez
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
This page was built for software: TcT
