Termination analysis of programs with multiphase control-flow
From MaRDI portal
Publication:6647299
DOI10.4204/eptcs.344.2MaRDI QIDQ6647299
Samir Genaim, Jesús J. Doménech
Publication date: 3 December 2024
Cites Work
- Unnamed Item
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- The octagon abstract domain
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions
- On multiphase-linear ranking functions
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Closed-form upper bounds in static cost analysis
- Resource Analysis of Complex Programs with Cost Equations
- On the linear ranking problem for integer linear-constraint loops
- Proving Termination Through Conditional Termination
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- Resource Analysis driven by (Conditional) Termination Proofs
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis
- The size-change principle for program termination
- Ranking Templates for Linear Loops
- Automatic numeric abstractions for heap-manipulating programs
- Recurrence with affine level mappings is P-time decidable for CLP
- Ranking Functions for Linear-Constraint Loops
- Computer Aided Verification
- Deciding Conditional Termination
- Verification, Model Checking, and Abstract Interpretation
- Multiphase-linear ranking functions and their relation to recurrent sets
This page was built for publication: Termination analysis of programs with multiphase control-flow
