Synthesizing ranking functions for loop programs via SVM
From MaRDI portal
Publication:2084940
Recommendations
- SVM-based method for detecting ranking functions in polynomial loop programs
- Ranking functions for linear-constraint loops
- Detection of ranking functions of polynomial loop programs
- scientific article; zbMATH DE number 7559471
- A new look at the automatic synthesis of linear ranking functions
- On the linear ranking problem for simple floating-point loops
- Ranking function synthesis for bit-vector relations
- Ranking function synthesis for bit-vector relations
- scientific article; zbMATH DE number 1701751
Cites work
- Automata, Languages and Programming
- Computer Aided Verification
- Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
- Generating exact nonlinear ranking functions by symbolic-numeric hybrid method
- Geometric nontermination arguments
- scientific article; zbMATH DE number 1701751 (Why is no real title available?)
- scientific article; zbMATH DE number 1903370 (Why is no real title available?)
- Linear ranking for linear lasso programs
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction
- On multiphase-linear ranking functions
- Ranking functions for linear-constraint loops
- Ranking Templates for Linear Loops
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Support-vector networks
- Termination of polynomial loops
- Verification, Model Checking, and Abstract Interpretation
- Verification, Model Checking, and Abstract Interpretation
This page was built for publication: Synthesizing ranking functions for loop programs via SVM
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2084940)
