Multiphase-linear ranking functions and their relation to recurrent sets
From MaRDI portal
Publication:6536301
DOI10.1007/978-3-030-32304-2_22zbMATH Open1539.68058MaRDI QIDQ6536301
Jesús J. Doménech, Samir Genaim, Amir M. Ben-Amram
Publication date: 19 April 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- On multiphase-linear ranking functions
- Finding recurrent sets with backward analysis and trace partitioning
- Geometric nontermination arguments
- An abstract interpretation framework for termination
- Proving that programs eventually do something good
- Proving non-termination
- Proving Termination Through Conditional Termination
- Proving Conditional Termination
- Polyhedral Approaches to Mixed Integer Linear Programming
- Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
- Ranking Templates for Linear Loops
- Computer Aided Verification
- An Abstract Domain to Infer Ordinal-Valued Ranking Functions
- Non-termination Checking for Imperative Programs
- Automated Technology for Verification and Analysis
- Ranking Functions for Linear-Constraint Loops
- Computer Aided Verification
- Deciding Conditional Termination
- Verification, Model Checking, and Abstract Interpretation
Related Items (1)
This page was built for publication: Multiphase-linear ranking functions and their relation to recurrent sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536301)
