Pages that link to "Item:Q2457430"
From MaRDI portal
The following pages link to Generating all polynomial invariants in simple loops (Q2457430):
Displaying 5 items.
- Recent advances in program verification through computer algebra (Q351971) (← links)
- On invariant checking (Q394493) (← links)
- Acceleration of the abstract fixpoint computation in numerical program analysis (Q435974) (← links)
- Analyzing ultimate positivity for solvable systems (Q897909) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
