Reasoning Algebraically About P-Solvable Loops
From MaRDI portal
(Redirected from Publication:5458331)
Recommendations
- Invariant Generation for P-Solvable Loops with Assignments
- A complete invariant generation approach for P-solvable loops
- Aligator: A Mathematica Package for Invariant Generation (System Description)
- Automatic Generation of Polynomial Loop Invariants
- Generating all polynomial invariants in simple loops
Cites work
- scientific article; zbMATH DE number 3941661 (Why is no real title available?)
- scientific article; zbMATH DE number 3497890 (Why is no real title available?)
- scientific article; zbMATH DE number 3550181 (Why is no real title available?)
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- scientific article; zbMATH DE number 400659 (Why is no real title available?)
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- scientific article; zbMATH DE number 1948385 (Why is no real title available?)
- scientific article; zbMATH DE number 1973372 (Why is no real title available?)
- A \textit{Mathematica} version of Zeilberger's algorithm for proving binomial coefficient identities
- A holonomic systems approach to special functions identities
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
- Affine relationships among variables of a program
- Computing the algebraic relations of \(C\)-finite sequences and multisequences
- Decision procedure for indefinite hypergeometric summation
- Generating all polynomial invariants in simple loops
- Interprocedurally Analyzing Polynomial Identities
- Non-linear loop invariant generation using Gröbner bases
- SumCracker: A package for manipulating symbolic sums and related objects
- The synthesis of loop predicates
- \textit{Theorema}: Towards computer-aided mathematical theory exploration
Cited in
(29)- Automatic complexity analysis of integer programs via triangular weakly non-linear loops
- Symbol elimination and applications to parametric entailment problems
- Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
- Pattern-based approach to automation of deductive verification of process-oriented programs: patterns, lemmas and algorithms
- Discovering non-terminating inputs for multi-path polynomial programs
- (Un)solvable loop analysis
- Termination of triangular polynomial loops
- Algebra-based synthesis of loops and their invariants (invited paper)
- Aligator: A Mathematica Package for Invariant Generation (System Description)
- Symbolic computation in automated program reasoning
- An iterative method for generating loop invariants
- Polynomial loops: beyond termination
- Counterexample- and simulation-guided floating-point loop invariant synthesis
- On strongest algebraic program invariants
- Algebraic tools for computing polynomial loop invariants
- Termination of polynomial loops
- Endomorphisms for Non-trivial Non-linear Loop Invariant Generation
- From Polynomial Invariants to Linear Loops
- Change-of-bases abstractions for non-linear hybrid systems
- Generating invariants for non-linear loops by linear algebraic methods
- Aligator.jl -- a Julia package for loop invariant generation
- Targeting completeness: automated complexity analysis of integer programs
- Invariant Generation for P-Solvable Loops with Assignments
- Automatic proving or disproving equality loop invariants based on finite difference techniques
- Algebra-Based Loop Analysis
- Solving invariant generation for unsolvable loops
- Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
- Degree and dimension estimates for invariant ideals of P-solvable recurrences
- A complete invariant generation approach for P-solvable loops
This page was built for publication: Reasoning Algebraically About P-Solvable Loops
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458331)
