The following pages link to ACE (Q34466):
Displaying 10 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Amortized complexity verified (Q670702) (← links)
- Cost analysis of object-oriented bytecode programs (Q764297) (← links)
- Automatic average-case analysis of algorithms (Q1174718) (← links)
- Automated higher-order complexity analysis (Q1827392) (← links)
- Mechanisation of the AKS algorithm (Q2031415) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- Verified Root-Balanced Trees (Q5056001) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)