Polynomial invariants generation of programs

MaRDI QIDQ5395800zbMATH OpenFDO

Authors A. N. Maksimets

Publication date 17 February 2014

zbMATH Keywords

Gröbner basespolynomial invariant generation problem

Mathematics Subject Classification ID

Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Symbolic computation and algebraic computation (68W30)

Recommendations

• Generating all polynomial invariants in simple loops
• Polynomial invariants by linear algebra
• Invariant generation for multi-path loops with polynomial assignments
• Static Analysis
• Automatic generation of polynomial invariants of bounded degree using abstract interpretation

Cited in

(13)

• Discovery of invariant equalities in programs over data fields
• Generalizations of algorithms that find invariant relationships in programs over algebra of terms
• Self-correcting polynomial programs
• Computing polynomial program invariants
• Generating Polynomial Invariants with DISCOVERER and QEPCAD
• Code Generation for Polynomial Multiplication
• scientific article; zbMATH DE number 3911682 (Why is no real title available?)
• Program verification: state of the art, problems, and results. I
• scientific article; zbMATH DE number 4113989 (Why is no real title available?)
• Polynomial Invariants for Affine Programs
• Static Analysis
• Static Analysis
• Automatic generation of polynomial invariants of bounded degree using abstract interpretation

This page was built for publication: Polynomial invariants generation of programs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5395800)