Termination analysis of programs with multiphase control-flow
From MaRDI portal
Recommendations
- On multiphase-linear ranking functions
- Verification, Model Checking, and Abstract Interpretation
- Multiphase-linear ranking functions and their relation to recurrent sets
- Control-flow refinement by partial evaluation, and its application to termination and cost analysis
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
Cites work
- Analyzing program termination and complexity automatically with \textsf{AProVE}
- Automatic numeric abstractions for heap-manipulating programs
- Closed-form upper bounds in static cost analysis
- Complexity of Bradley-Manna-Sipma lexicographic ranking functions
- Computer Aided Verification
- Control-flow refinement by partial evaluation, and its application to termination and cost analysis
- Deciding conditional termination
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- Multi-dimensional rankings, program termination, and complexity bounds of flowchart programs
- Multiphase-linear ranking functions and their relation to recurrent sets
- On multiphase-linear ranking functions
- On the \textsc{Linear Ranking} problem for integer linear-constraint loops
- Proving termination through conditional termination
- Ranking functions for linear-constraint loops
- Ranking Templates for Linear Loops
- Recurrence with affine level mappings is P-time decidable for CLP
- Resource analysis driven by (conditional) termination proofs
- Resource analysis of complex programs with cost equations
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- The octagon abstract domain
- The size-change principle for program termination
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Termination analysis of programs with multiphase control-flow
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6647299)
