scientific article; zbMATH DE number 7559471

DOI10.4230/LIPICS.CONCUR.2020.15MaRDI QIDQ5089280FDOQ5089280

Authors: Eike Neumann, Joël Ouaknine, James Worrell 

Publication date: 18 July 2022

Title of this publication is not available (Why is that?)

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)

Cites Work

• Title not available (Why is that?)
• Computer Aided Verification
• Discovering Non-linear Ranking Functions by Solving Semi-algebraic Systems
• Positivity Problems for Low-Order Linear Recurrence Sequences
• Verification, Model Checking, and Abstract Interpretation
• Termination of Integer Linear Programs
• Verification, Model Checking, and Abstract Interpretation
• Termination of linear programs with nonlinear constraints
• On multiphase-linear ranking functions
• Termination Analysis of Probabilistic Programs Through Positivstellensatz’s
• Title not available (Why is that?)
• Ranking Functions for Linear-Constraint Loops
• Ramsey versus lexicographic termination proving
• Complexity of Bradley-Manna-Sipma lexicographic ranking functions
• Termination of Single-Path Polynomial Loop Programs

Cited In (3)

• Termination of polynomial loops
• Computer Science for Continuous Data
• Synthesizing ranking functions for loop programs via SVM

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)