TERMINATION ANALYSIS OF LINEAR LOOPS

DOI10.1142/S0129054110007696zbMath1213.68213MaRDI QIDQ3069740

Ming Xu, Zhenbing Zeng, Liangyu Chen, Zhi-Bin Li

Publication date: 19 January 2011

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

zbMATH Keywords

symbolic computationterminationprogram verificationlinear loopmulti-exponential polynomialreal root bound

Mathematics Subject Classification ID

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

Related Items (2)

Analyzing ultimate positivity for solvable systems ⋮ Discovering non-terminating inputs for multi-path polynomial programs

Uses Software

• Maple

Cites Work

• A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
• Matrix Analysis
• An axiomatic basis for computer programming
• Unnamed Item
• Unnamed Item
• Unnamed Item

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