TcT
From MaRDI portal
Software:55526
No author found.
Related Items (10)
\textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs ⋮ ATLAS: automated amortised complexity analysis of self-adjusting data structures ⋮ From Jinja bytecode to term rewriting: a complexity reflecting transformation ⋮ Lower bounds for runtime complexity of term rewriting ⋮ Complexity analysis for term rewriting by integer transition systems ⋮ Unnamed Item ⋮ A Perron-Frobenius theorem for deciding matrix growth ⋮ Constant runtime complexity of term rewriting is semi-decidable ⋮ Inferring expected runtimes of probabilistic integer programs using expected sizes ⋮ Runtime complexity analysis of logically constrained rewriting
This page was built for software: TcT
