Work

On Ranking Function Synthesis and Termination for Polynomial Programs

Year: 2020

Type: preprint

Abstract: We consider the problem of synthesising polynomial ranking functions for single-path loops over the reals with continuous semi-algebraic update function and compact semi-algebraic guard set. We show that a loop of this form has a polynomial ranking function if and only if it terminates. We further show that termination is decidable for such loops in the special case where the update function is affine.

Source: arXiv (Cornell University)

DOI: 10.4230/lipics.concur.2020.15

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

Institutions: University of Oxford, Max Planck Society, Max Planck Institute for Software Systems

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

Funders: Deutsche Forschungsgemeinschaft, Engineering and Physical Sciences Research Council, H2020 European Research Council

Awards: Analysis, Verification, and Synthesis for Infinite-State Systems, G2704700155, G3032849772, Verification of Linear Dynamical Systems, TRR 248: Grundlagen verständlicher SoftwareSysteme für eine nachvollziehbare cyberphysische Welt

OpenAlex ID: W3082301608

Cites:

Cited by: 7

Related to: 20