Termination of Polynomial Loops
No abstract available.
Related papers
- Invariant Generation for Multi-Path Loops with Polynomial Assignments VMCAI 2018
- Synthesis for Polynomial Lasso Programs VMCAI 2014
- Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates CAV 2024
- Static Posterior Inference of Bayesian Probabilistic Programming via Polynomial Solving PLDI 2024
- Polynomial reachability witnesses via Stellensätze PLDI 2021
- Learning Probabilistic Termination Proofs CAV 2021
- Program Termination Analysis in Polynomial Time GPCE 2002
- Automatic Termination Analysis for Partial Functions Using Polynomial Orderings SAS 1997