scientific article; zbMATH DE number 7559471

DOI10.4230/LIPIcs.CONCUR.2020.15MaRDI QIDQ5089280

Joël Ouaknine, Eike Neumann, James Worrell

Publication date: 18 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

semi-algebraic setspolynomial programspolynomial ranking functions

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Related Items (1)

Termination of polynomial loops

Cites Work

• Unnamed Item
• Unnamed Item
• Termination of linear programs with nonlinear constraints
• Complexity of Bradley-Manna-Sipma lexicographic ranking functions
• On multiphase-linear ranking functions
• Termination of Single-Path Polynomial Loop Programs
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• Computer Aided Verification
• Ramsey vs. Lexicographic Termination Proving
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Ranking Functions for Linear-Constraint Loops
• Verification, Model Checking, and Abstract Interpretation
• Termination of Integer Linear Programs
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: