Pages that link to "Item:Q1640985"
From MaRDI portal
The following pages link to From Jinja bytecode to term rewriting: a complexity reflecting transformation (Q1640985):
Displayed 4 items.
- Mechanising a type-safe model of multithreaded Java with a verified compiler (Q1663233) (← links)
- Constant runtime complexity of term rewriting is semi-decidable (Q1799562) (← links)
- Runtime complexity analysis of logically constrained rewriting (Q2119101) (← links)
- \textsc{ComplexityParser}: an automatic tool for certifying poly-time complexity of Java programs (Q2119987) (← links)