Pages that link to "Item:Q3452270"
From MaRDI portal
The following pages link to Non-linear loop invariant generation using Gröbner bases (Q3452270):
Displaying 43 items.
- Analysis of linear definite iterative loops (Q289808) (← links)
- Recent advances in program verification through computer algebra (Q351971) (← links)
- On invariant checking (Q394493) (← links)
- SAT modulo linear arithmetic for solving polynomial constraints (Q438576) (← links)
- Toward automatic verification of quantum programs (Q667515) (← 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)
- Resource-usage-aware configuration in software product lines (Q898611) (← links)
- Change-of-bases abstractions for non-linear hybrid systems (Q901261) (← links)
- Generating invariants for non-linear loops by linear algebraic methods (Q903492) (← links)
- Mathematics for reasoning about loop functions (Q1044182) (← links)
- A deductive approach towards reasoning about algebraic transition systems (Q1666122) (← links)
- Formal verification and quantitative metrics of MPSoC data dynamics (Q1707342) (← links)
- Counterexample- and simulation-guided floating-point loop invariant synthesis (Q2233532) (← links)
- Algebra-based synthesis of loops and their invariants (invited paper) (Q2234055) (← links)
- A method of proving the invariance of linear inequalities for linear loops (Q2263332) (← links)
- Discovering non-terminating inputs for multi-path polynomial programs (Q2341594) (← links)
- Computing polynomial program invariants (Q2390319) (← links)
- Generating semi-algebraic invariants for non-autonomous polynomial hybrid systems (Q2402231) (← links)
- Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods (Q2418665) (← links)
- Polynomial invariants for linear loops (Q2452765) (← links)
- Generating all polynomial invariants in simple loops (Q2457430) (← links)
- Constructing invariants for hybrid systems (Q2475635) (← links)
- Synthesizing Switching Controllers for Hybrid Systems by Generating Invariants (Q2842646) (← links)
- Formal Modelling, Analysis and Verification of Hybrid Systems (Q2948232) (← links)
- Algebra, Coalgebra, and Minimization in Polynomial Differential Equations (Q2988361) (← links)
- An Iterative Method for Generating Loop Invariants (Q3004678) (← links)
- Combining Model Checking and Data-Flow Analysis (Q3176374) (← links)
- A Numerical Abstract Domain Based on Expression Abstraction and Max Operator with Application in Timing Analysis (Q3512505) (← links)
- Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$ (Q3522079) (← links)
- Inferring Loop Invariants Using Postconditions (Q3586008) (← links)
- Automatic generation of non-linear loop invariants (Q3646570) (← links)
- Geometric Quantifier Elimination Heuristics for Automatically Generating Octagonal and Max-plus Invariants (Q4913868) (← links)
- Elimination Techniques for Program Analysis (Q4916078) (← links)
- O-Minimal Invariants for Discrete-Time Dynamical Systems (Q5002799) (← links)
- On the Coalgebra of Partial Differential Equations (Q5092383) (← links)
- Loop invariants (Q5176169) (← links)
- Invariant Synthesis for Combined Theories (Q5452621) (← links)
- Reasoning Algebraically About P-Solvable Loops (Q5458331) (← links)
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation (Q5505618) (← links)
- Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis (Q5915714) (← links)
- Automatic pre- and postconditions for partial differential equations (Q5925548) (← links)
- Transformation-Enabled Precondition Inference (Q6063861) (← links)
