Proving loop termination: Beyond the traditional method

DOI10.3233/JCM-2009-0245MaRDI QIDQ3181567zbMATH OpenOpenAlexFDO

Authors Tennyson X. Chen, Martin Meyer

Publication date 12 October 2009

Published in Journal of Computational Methods in Sciences and Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/jcm-2009-0245

zbMATH Keywords

bound function, total correctnessiterative commandloop terminationrepetition construct

Mathematics Subject Classification ID

Theory of programming languages (68N15) Theory of software (68N99)

Recommendations

• Verification of a class of loop programs without using loop invariants
• scientific article; zbMATH DE number 408800
• Termination of semi-algebraic loop programs
• Automatic termination analysis for functional and imperative programs (Thesis, TU Darmstadt)
• Proving termination of nonlinear command sequences

This page was built for publication: Proving loop termination: Beyond the traditional method

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