An Order Theory Framework of Recurrence Equations for Static Cost Analysis - Dynamic Inference of Non-Linear Inequality Invariants
Abstract elided by the publisher.
Related papers
- DynamiTe: dynamic termination and non-termination proofs OOPSLA 2020
- Verified solving and asymptotics of linear recurrences CPP 2019
- Automatic Inference of Upper Bounds for Recurrence Relations in Cost Analysis SAS 2008
- Logical inference techniques for loop parallelization PLDI 2012
- How to prove decidability of equational theories with second-order computation analyser SOL JFP 2019
- Static determination of quantitative resource usage for higher-order programs POPL 2010
- REPTILE: Performant Tiling of Recurrences OOPSLA 2025
- How to prove your calculus is decidable: practical applications of second-order algebraic theories and computation ICFP 2017