ACE
From MaRDI portal
Software:34466
swMATH22675MaRDI QIDQ34466FDOQ34466
Author name not available (Why is that?)
Cited In (10)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
- Automated higher-order complexity analysis
- Closed-form upper bounds in static cost analysis
- Mechanisation of the AKS algorithm
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation
- Verified Root-Balanced Trees
- Cost analysis of object-oriented bytecode programs
- Amortized complexity verified
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
- Automatic average-case analysis of algorithms
This page was built for software: ACE
