Symbolic termination analysis of solvable loops

DOI10.1016/J.JSC.2012.05.005MaRDI QIDQ1930157zbMATH OpenOpenAlexFDO

Authors Ming Xu, Zhibin Li

Publication date 10 January 2013

Published in Journal of Symbolic Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jsc.2012.05.005

zbMATH Keywords

polynomial loopsprogram verificationquantifier eliminationreal root boundssymbolic computationtermination analysis

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Symbolic computation and algebraic computation (68W30)

Recommendations

• TERMINATION ANALYSIS OF LINEAR LOOPS
• Verification, Model Checking, and Abstract Interpretation
• Termination of single-path polynomial loop programs
• Termination of polynomial loops
• Termination of semi-algebraic loop programs

Cited in

(21)

• TERMINATOR
• Automatic complexity analysis of integer programs via triangular weakly non-linear loops
• Termination of polynomial loops
• Discovering non-terminating inputs for multi-path polynomial programs
• Loop Summarization and Termination Analysis
• TERMINATION ANALYSIS OF LINEAR LOOPS
• Termination of single-path polynomial loop programs
• Symbolic Loop Bound Computation for WCET Analysis
• scientific article; zbMATH DE number 1953286 (Why is no real title available?)
• Proving termination of nonlinear command sequences
• Termination of semi-algebraic loop programs
• Automated Technology for Verification and Analysis
• scientific article; zbMATH DE number 6401180 (Why is no real title available?)
• Verification, Model Checking, and Abstract Interpretation
• Deciding conditional termination
• CONCUR 2005 – Concurrency Theory
• Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
• Termination of triangular polynomial loops
• Targeting completeness: automated complexity analysis of integer programs
• Measuring the constrained reachability in quantum Markov chains
• Analyzing ultimate positivity for solvable systems

This page was built for publication: Symbolic termination analysis of solvable loops

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