Pages that link to "Item:Q5458331"
From MaRDI portal
The following pages link to Reasoning Algebraically About P-Solvable Loops (Q5458331):
Displaying 13 items.
- Symbol elimination and applications to parametric entailment problems (Q831921) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Automatic complexity analysis of integer programs via triangular weakly non-linear loops (Q2104561) (← links)
- Termination of polynomial loops (Q2233526) (← links)
- Counterexample- and simulation-guided floating-point loop invariant synthesis (Q2233532) (← links)
- Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Automatic proving or disproving equality loop invariants based on finite difference techniques (Q2512818) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops (Q3297595) (← links)
- Aligator: A Mathematica Package for Invariant Generation (System Description) (Q3541707) (← links)
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation (Q5505618) (← links)
