Termination of single-path polynomial loop programs

DOI10.1007/978-3-319-46750-4_3MaRDI QIDQ3179389zbMATH OpenOpenAlexFDO

Authors Yi Li

Publication date 21 December 2016

Published in Theoretical Aspects of Computing – ICTAC 2016 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-46750-4_3

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Verification, Model Checking, and Abstract Interpretation
• Symbolic termination analysis of solvable loops
• Termination of polynomial loops
• Termination of semi-algebraic loop programs
• Termination analysis of linear loop programs

Cites work

• scientific article; zbMATH DE number 1701751 (Why is no real title available?)
• scientific article; zbMATH DE number 2107836 (Why is no real title available?)
• scientific article; zbMATH DE number 2123480 (Why is no real title available?)
• A new look at the automatic synthesis of linear ranking functions
• Automata, Languages and Programming
• Computer Aided Verification
• Computer Aided Verification
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Discovering non-terminating inputs for multi-path polynomial programs
• Linear ranking for linear lasso programs
• On the \textsc{Linear Ranking} problem for integer linear-constraint loops
• Proving Conditional Termination
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains
• Ramsey versus lexicographic termination proving
• Ranking functions for linear-constraint loops
• Synthesis for Polynomial Lasso Programs
• Termination of Integer Linear Programs
• Termination of linear programs with nonlinear constraints
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(10)

• Program termination using Z-transform theory
• Termination of semi-algebraic loop programs
• Discovering non-terminating inputs for multi-path polynomial programs
• Termination of triangular polynomial loops
• Deciding Polynomial Termination Complexity for VASS Programs
• Polynomial loops: beyond termination
• Termination of polynomial loops
• scientific article; zbMATH DE number 7559471 (Why is no real title available?)
• Verification, Model Checking, and Abstract Interpretation
• Symbolic termination analysis of solvable loops

This page was built for publication: Termination of single-path polynomial loop programs

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