Pages that link to "Item:Q4657335"
From MaRDI portal
The following pages link to Automatic Generation of Polynomial Loop Invariants (Q4657335):
Displaying 9 items.
- Analysis of linear definite iterative loops (Q289808) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- Nonlinear invariants for linear loops and eigenpolynomials of linear operators (Q466366) (← links)
- Efficient solution of a class of quantified constraints with quantifier prefix exists-forall (Q475420) (← links)
- \textit{Theorema}: Towards computer-aided mathematical theory exploration (Q865646) (← links)
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs (Q882517) (← links)
- The structure of polynomial invariants of linear loops (Q891730) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs (Q6496615) (← links)
