TiML
From MaRDI portal
Software:39280
swMATH27564MaRDI QIDQ39280FDOQ39280
Author name not available (Why is that?)
Cited In (8)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
- ATLAS: automated amortised complexity analysis of self-adjusting data structures
- Synthesis with asymptotic resource bounds
- For a few dollars more. Verified fine-grained algorithm analysis down to LLVM
- Runtime complexity analysis of logically constrained rewriting
- Verifying asymptotic time complexity of imperative programs in Isabelle
- Relational cost analysis in a functional-imperative setting
- Type-based analysis of logarithmic amortised complexity
This page was built for software: TiML
