Termination of Single-Path Polynomial Loop Programs

DOI10.1007/978-3-319-46750-4_3zbMath1482.68090OpenAlexW2523459130MaRDI QIDQ3179389

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

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

Related Items (2)

Termination of polynomial loops ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Termination of linear programs with nonlinear constraints
• A new look at the automatic synthesis of linear ranking functions
• Discovering non-terminating inputs for multi-path polynomial programs
• On the linear ranking problem for integer linear-constraint loops
• Synthesis for Polynomial Lasso Programs
• Proving Conditional Termination
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Linear Ranking for Linear Lasso Programs
• Computer Aided Verification
• Ramsey vs. Lexicographic Termination Proving
• Ranking Functions for Linear-Constraint Loops
• Verification, Model Checking, and Abstract Interpretation
• Computer Aided Verification
• Automata, Languages and Programming
• Termination of Integer Linear Programs
• Quantifier elimination by cylindrical algebraic decomposition based on regular chains
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Termination of Single-Path Polynomial Loop Programs