Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
Abstract elided by the publisher.
Related papers
- Ranking functions for size-change termination TOPLAS 2009
- A Simple and Scalable Static Analysis for Bound Analysis and Amortized Complexity Analysis CAV 2014
- Positive Almost-Sure Termination: Complexity and Proof Rules POPL 2024
- Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets SAS 2019
- On Multiphase-Linear Ranking Functions CAV 2017
- Run-time Complexity Bounds Using Squeezers ESOP 2021
- Multi-Dimensional Context-Oriented Programming with a Lightweight Domain Specific Language SLE 2026
- Probabilistic Termination: Soundness, Completeness, and Compositionality POPL 2015