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