Pages that link to "Item:Q2457430"

The following pages link to Generating all polynomial invariants in simple loops (Q2457430):

Displaying 20 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)
• Termination of polynomial loops (Q2233526) (← links)
• Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
• Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
• A multi-domain incremental analysis engine and its application to incremental resource analysis (Q2346994) (← links)
• Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
• Automatic proving or disproving equality loop invariants based on finite difference techniques (Q2512818) (← links)
• Abstract Fixpoint Computations with Numerical Acceleration Methods (Q2814099) (← links)
• Some decidable results on reachability of solvable systems (Q2871582) (← links)
• When Is a Formula a Loop Invariant? (Q2945711) (← links)
• Algebra, Coalgebra, and Minimization in Polynomial Differential Equations (Q2988361) (← links)
• An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
• Aligator: A Mathematica Package for Invariant Generation (System Description) (Q3541707) (← links)
• Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
• O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
• (Q5089299) (← links)