Deciding conditional termination

DOI10.2168/LMCS-10(3:8)2014MaRDI QIDQ5891476zbMATH OpenFDO

Authors Marius Bozga, Radu Iosif, Filip Konečný

Publication date 5 September 2014

Published in Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2168/LMCS-10(3:8)2014

zbMATH Keywords

integer programsperiodic relationsrecurrent setstermination preconditions

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Deciding conditional termination
• Proving termination through conditional termination
• Termination of linear programs with nonlinear constraints
• Symbolic termination analysis of solvable loops
• Termination analysis of linear loop programs

Cited in

(10)

• A second-order formulation of non-termination
• Proving termination through conditional termination
• Proving Conditional Termination
• A calculus for modular loop acceleration
• Deciding conditional termination
• Termination analysis of programs with multiphase control-flow
• The 2-dimensional constraint loop problem is decidable
• Termination of triangular polynomial loops
• Polynomial loops: beyond termination
• On termination of polynomial programs with equality conditions

Describes a project that uses

Uses Software

• FLATA

This page was built for publication: Deciding conditional termination

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