ACE

MaRDI QIDQ34466swMATHFDO

Official website https://dl.acm.org/citation.cfm?id=42347

Cited in

(21)

• Automatic average-case analysis of algorithms
• COSTA
• PURRS
• Automated higher-order complexity analysis
• Mechanisation of the AKS algorithm
• Closed-form upper bounds in static cost analysis
• net.datastructures
• CFML
• Machine-checked verification of the correctness and amortized complexity of an efficient union-find implementation
• Grail
• Camelot
• PairingHeap
• Splay Tree
• Skew Heap
• Amortized Complexity
• Root Balanced Tree
• Verified Root-Balanced Trees
• Denotational semantics as a foundation for cost recurrence extraction for functional languages
• Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits
• Amortized complexity verified
• Cost analysis of object-oriented bytecode programs

This page was built for software: ACE