ACE

MaRDI QIDQ34466swMATHFDO

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

Cited in

(21)

• 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
• COSTA
• PURRS
• net.datastructures
• CFML
• Grail
• Camelot
• Amortized Complexity
• PairingHeap
• Skew Heap
• Root Balanced Tree
• Splay Tree
• Cost analysis of object-oriented bytecode programs
• Verified Root-Balanced Trees
• 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