scientific article; zbMATH DE number 7559471

DOI10.4230/LIPICS.CONCUR.2020.15MaRDI QIDQ5089280zbMATH OpenFDO

Authors Eike Neumann, Joël Ouaknine, James Worrell

Publication date 18 July 2022

Full work available at URL https://doi.org/10.4230/LIPICS.CONCUR.2020.15

zbMATH Keywords

polynomial programspolynomial ranking functionssemi-algebraic sets

Mathematics Subject Classification ID

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

Cites work

• Complexity of Bradley-Manna-Sipma lexicographic ranking functions
• Computer Aided Verification
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• On multiphase-linear ranking functions
• Positivity problems for low-order linear recurrence sequences
• Ramsey versus lexicographic termination proving
• Ranking functions for linear-constraint loops
• Real algebraic geometry. Transl. from the French.
• Termination analysis of probabilistic programs through Positivstellensatz's
• Termination of Integer Linear Programs
• Termination of linear loops over the integers
• Termination of linear programs with nonlinear constraints
• Termination of single-path polynomial loop programs
• Verification, Model Checking, and Abstract Interpretation
• Verification, Model Checking, and Abstract Interpretation

Cited in

(5)

• Synthesizing ranking functions for loop programs via SVM
• Termination of polynomial loops
• Computer Science for Continuous Data
• Termination of triangular polynomial loops
• Targeting completeness: automated complexity analysis of integer programs

This page was built for publication:

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