Pages that link to "Item:Q2390319"
From MaRDI portal
The following pages link to Computing polynomial program invariants (Q2390319):
Displaying 17 items.
- Analysis of linear definite iterative loops (Q289808) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Mechanical inference of invariants for FOR-loops (Q604381) (← links)
- The structure of polynomial invariants of linear loops (Q891730) (← links)
- First-order orbit queries (Q2048201) (← links)
- Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
- A method of proving the invariance of linear inequalities for linear loops (Q2263332) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Polynomial invariants for linear loops (Q2452765) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Polynomial interrupt timed automata: verification and expressiveness (Q2662502) (← links)
- Degree and Dimension Estimates for Invariant Ideals of $$P$$ -Solvable Recurrences (Q2799570) (← links)
- Algebra, Coalgebra, and Minimization in Polynomial Differential Equations (Q2988361) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- On the computational complexity of dynamic slicing problems for program schemas (Q3103616) (← links)
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ (Q3522079) (← links)
- (Q5090452) (← links)
