Pages that link to "Item:Q5501930"
From MaRDI portal
The following pages link to Ranking Functions for Linear-Constraint Loops (Q5501930):
Displaying 12 items.
- Decision tree learning in CEGIS-based termination analysis (Q832251) (← links)
- Inferring expected runtimes of probabilistic integer programs using expected sizes (Q2044203) (← links)
- Synthesizing ranking functions for loop programs via SVM (Q2084940) (← links)
- Algebraic model checking for discrete linear dynamical systems (Q2112097) (← links)
- How to find the convex hull of all integer points in a polyhedron? (Q2162699) (← links)
- Time-bounded termination analysis for probabilistic programs with delays (Q2216132) (← links)
- Termination of Single-Path Polynomial Loop Programs (Q3179389) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- (Q5089280) (← links)
- (Q5092319) (← links)
- Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis (Q5108517) (← links)
- (Q5114822) (← links)
