Ranking Templates for Linear Loops
We present a new method for the constraint-based synthesis of termination arguments for linear loop programs based on linear ranking templates. Linear ranking templates are parameterized, well-founded relations such that an assignment to the parameters gives rise to a ranking function. Our approach...
| Main Authors: | , |
|---|---|
| פורמט: | Article |
| שפה: | English |
| יצא לאור: |
Logical Methods in Computer Science e.V.
2015-03-01
|
| סדרה: | Logical Methods in Computer Science |
| נושאים: | |
| גישה מקוונת: | https://lmcs.episciences.org/797/pdf |