TERMINATION ANALYSIS OF LINEAR LOOPS

DOI10.1142/S0129054110007696MaRDI QIDQ3069740zbMATH OpenFDO

Authors Ming Xu, Liangyu Chen, Zhenbing Zeng, Zhibin Li

Publication date 19 January 2011

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

symbolic computationprogram verificationterminationlinear loopmulti-exponential polynomialreal root bound

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Software, source code, etc. for problems pertaining to computer science (68-04)

Recommendations

• Termination analysis of linear loop programs
• CONCUR 2005 – Concurrency Theory
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 6401180
• Reflections on termination of linear loops
• On termination of integer linear loops
• Termination of linear loops over the integers
• Symbolic termination analysis of solvable loops
• Loop Summarization and Termination Analysis

Cites work

• scientific article; zbMATH DE number 3657869 (Why is no real title available?)
• scientific article; zbMATH DE number 3728938 (Why is no real title available?)
• scientific article; zbMATH DE number 3445421 (Why is no real title available?)
• A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
• An axiomatic basis for computer programming
• Matrix Analysis

Cited in

(18)

• Non-termination Sets of Simple Linear Loops
• On termination of integer linear loops
• Proving termination of nonlinear command sequences
• Robust non-termination analysis of numerical software
• Termination analysis of linear loop programs
• Termination analysis of nonlinear loops over closed and bounded connected domain
• scientific article; zbMATH DE number 6401180 (Why is no real title available?)
• CONCUR 2005 – Concurrency Theory
• Loop Summarization and Termination Analysis
• Verification, Model Checking, and Abstract Interpretation
• Termination of polynomial loops
• Symbolic termination analysis of solvable loops
• Analyzing ultimate positivity for solvable systems
• Automated Technology for Verification and Analysis
• Alternation for termination
• Discovering non-terminating inputs for multi-path polynomial programs
• Signature-based method of deciding program~termination
• Proving non-termination

Describes a project that uses

Uses Software

• Maple

This page was built for publication: TERMINATION ANALYSIS OF LINEAR LOOPS

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