Pages that link to "Item:Q859956"
From MaRDI portal
The following pages link to Automatic generation of polynomial invariants of bounded degree using abstract interpretation (Q859956):
Displaying 21 items.
- On invariant checking (Q394493) (← links)
- Mechanical inference of invariants for FOR-loops (Q604381) (← links)
- The structure of polynomial invariants of linear loops (Q891730) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
- Polynomial invariants for linear loops (Q2452765) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Automatic proving or disproving equality loop invariants based on finite difference techniques (Q2512818) (← links)
- Degree and Dimension Estimates for Invariant Ideals of $$P$$ -Solvable Recurrences (Q2799570) (← links)
- Automatic Generation of Invariants for Circular Derivations in SUP(LA) (Q2891451) (← links)
- When Is a Formula a Loop Invariant? (Q2945711) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ (Q3522079) (← links)
- Proving correctness of imperative programs by linearizing constrained Horn clauses (Q4593003) (← links)
- Elimination Techniques for Program Analysis (Q4916078) (← links)
- (Q5089299) (← links)
- Static Analysis (Q5466567) (← links)
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation (Q5505618) (← links)
- Reusable contracts for safe integration of reinforcement learning in hybrid systems (Q6103163) (← links)
- Affine Loop Invariant Generation via Matrix Algebra (Q6487319) (← links)
- MDPs as distribution transformers: affine invariant synthesis for safety objectives (Q6535681) (← links)