Pages that link to "Item:Q3167521"
From MaRDI portal
The following pages link to Foundational and Practical Aspects of Resource Analysis (Q3167521):
Displaying 27 items.
- A Higher-Order Characterization of Probabilistic Polynomial Time (Q3167522) (← links)
- Typing a Core Binary-Field Arithmetic in a Light Logic (Q3167524) (← links)
- Interpolation-Based Height Analysis for Improving a Recurrence Solver (Q3167525) (← links)
- Interval-Based Resource Usage Verification: Formalization and Prototype (Q3167526) (← links)
- Certifying and Reasoning on Cost Annotations of Functional Programs (Q3167527) (← links)
- On Abstractions for Timing Analysis in the $\mathbb{K}$ Framework (Q3167528) (← links)
- Certifying Execution Time (Q3167529) (← links)
- Counter Automata for Parameterised Timing Analysis of Box-Based Systems (Q3167530) (← links)
- Certified Complexity (CerCo) (Q3460499) (← links)
- On the Modular Integration of Abstract Semantics for WCET Analysis (Q3460500) (← links)
- Can a Light Typing Discipline Be Compatible with an Efficient Implementation of Finite Fields Inversion? (Q3460503) (← links)
- Probabilistic Analysis of Programs: A Weak Limit Approach (Q3460504) (← links)
- Predicative Lexicographic Path Orders (Q3460505) (← links)
- A Hoare Logic for Energy Consumption Analysis (Q3460506) (← links)
- Reasoning About Resources in the Embedded Systems Language Hume (Q3460507) (← links)
- On Paths-Based Criteria for Polynomial Time Complexity in Proof-Nets (Q3460508) (← links)
- Collected Size Semantics for Strict Functional Programs over General Polymorphic Lists (Q3460509) (← links)
- Comparing Cost Functions in Resource Analysis (Q5747627) (← links)
- Improvements to a Resource Analysis for Hume (Q5747628) (← links)
- A Space Consumption Analysis by Abstract Interpretation (Q5747629) (← links)
- Global and Local Space Properties of Stream Programs (Q5747630) (← links)
- Characterising Effective Resource Analyses for Parallel and Distributed Coordination (Q5747631) (← links)
- Static Complexity Analysis of Higher Order Programs (Q5747632) (← links)
- Derivational Complexity Is an Invariant Cost Model (Q5747633) (← links)
- A Local Criterion for Polynomial-Time Stratified Computations (Q5747634) (← links)
- Non-deterministic Boolean Proof Nets (Q5747635) (← links)
- Polynomial Time Computation in the Context of Recursive Analysis (Q5747636) (← links)
