Pages that link to "Item:Q3558228"
From MaRDI portal
The following pages link to Amortized Resource Analysis with Polynomial Potential (Q3558228):
Displaying 18 items.
- Verifying the correctness and amortized complexity of a union-find implementation in separation logic with time credits (Q670699) (← links)
- Resource-usage-aware configuration in software product lines (Q898611) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Certified abstract cost analysis (Q2044174) (← links)
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
- Run-time complexity bounds using squeezers (Q2233463) (← links)
- Implicit computational complexity of subrecursive definitions and applications to cryptographic proofs (Q2331068) (← links)
- A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation (Q2437794) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- More Precise Yet Widely Applicable Cost Analysis (Q3075469) (← links)
- (Q5079730) (← links)
- Denotational semantics as a foundation for cost recurrence extraction for functional languages (Q5101922) (← links)
- (Q5111324) (← links)
- Tight typings and split bounds, fully developed (Q5120229) (← links)
- Exploiting Purely Functional Programming to Obtain Bounded Resource Behaviour: The Hume Approach (Q5302889) (← links)
- Type-based amortized resource analysis with integers and arrays (Q5371954) (← links)
- Two decades of automatic amortized resource analysis (Q5875892) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)
