A complete invariant generation approach for P-solvable loops

DOI10.1007/978-3-642-11486-1_21zbMATH Open1274.68695OpenAlexW2178148299MaRDI QIDQ3402283FDOQ3402283

Authors: Laura Kovács 

Publication date: 2 February 2010

Published in: Perspectives of Systems Informatics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11486-1_21

Recommendations

• Invariant Generation for P-Solvable Loops with Assignments
• Reasoning Algebraically About P-Solvable Loops
• Generating all polynomial invariants in simple loops
• Invariant generation for multi-path loops with polynomial assignments
• Automatic Generation of Polynomial Loop Invariants

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cited In (10)

• Automatic Generation of Moment-Based Invariants for Prob-Solvable Loops
• Invariant generation for multi-path loops with polynomial assignments
• Synthesizing invariants by solving solvable loops
• Automatic Generation of Polynomial Loop Invariants
• Generating all polynomial invariants in simple loops
• Invariant Generation for P-Solvable Loops with Assignments
• Solving invariant generation for unsolvable loops
• Polynomial invariants for linear loops
• Degree and dimension estimates for invariant ideals of \(P\)-solvable recurrences
• Reasoning Algebraically About P-Solvable Loops

Uses Software

• Aligator
• fastZeil
• Dependencies

This page was built for publication: A complete invariant generation approach for P-solvable loops

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