Pages that link to "Item:Q2942925"
From MaRDI portal
The following pages link to Static prediction of heap space usage for first-order functional programs (Q2942925):
Displayed 38 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)
- ATLAS: automated amortised complexity analysis of self-adjusting data structures (Q832253) (← links)
- Space-aware ambients and processes (Q875514) (← links)
- Light types for polynomial time computation in lambda calculus (Q1004289) (← links)
- Linear types and non-size-increasing polynomial time computation. (Q1401943) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- A type system for counting instances of software components (Q1758151) (← links)
- Trends in trends in functional programming 1999/2000 versus 2007/2008 (Q1929344) (← links)
- Combining linear logic and size types for implicit complexity (Q1989323) (← links)
- Types for complexity of parallel computation in pi-calculus (Q2233448) (← links)
- Structural recursion as a query language on lists and ordered trees (Q2272218) (← links)
- Type-based cost analysis for lazy functional languages (Q2398175) (← links)
- Closed-form upper bounds in static cost analysis (Q2429987) (← links)
- A resource semantics and abstract machine for \textit{Safe}: a functional language with regions and explicit deallocation (Q2437794) (← links)
- Exception handling for copyless messaging (Q2441510) (← links)
- A program logic for resources (Q2463560) (← links)
- A Coq Library for Internal Verification of Running-Times (Q2798271) (← links)
- Attribute-Based Signatures for Circuits from Bilinear Map (Q2798779) (← links)
- Machine-Checked Verification of the Correctness and Amortized Complexity of an Efficient Union-Find Implementation (Q2945628) (← links)
- Amortized Complexity Verified (Q2945642) (← links)
- Calculating Statically Maximum Log Memory Used by Multi-threaded Transactional Programs (Q3179394) (← links)
- Formal Certification of a Resource-Aware Language Implementation (Q3183530) (← links)
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis (Q3522073) (← links)
- An Inference Algorithm for Guaranteeing Safe Destruction (Q3617435) (← links)
- A Heterogeneous Pushout Approach to Term-Graph Transformation (Q3636827) (← links)
- A Type System for Usage of Software Components (Q3638253) (← links)
- Efficient Type-Checking for Amortised Heap-Space Analysis (Q3644757) (← links)
- A Transformational Approach to Resource Analysis with Typed-norms Inference (Q4957197) (← 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)
- Type-based amortized resource analysis with integers and arrays (Q5371954) (← links)
- A type system with usage aspects (Q5451967) (← links)
- Two decades of automatic amortized resource analysis (Q5875892) (← links)
- Type-based analysis of logarithmic amortised complexity (Q5875895) (← links)