TERMINATION ANALYSIS OF LINEAR LOOPS
From MaRDI portal
linear loopmulti-exponential polynomialprogram verificationreal root boundsymbolic computationtermination
Software, source code, etc. for problems pertaining to computer science (68-04) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60) Symbolic computation and algebraic computation (68W30)
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
- A quantifier-elimination based heuristic for automatically generating inductive assertions for programs
- An axiomatic basis for computer programming
- 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?)
- Matrix Analysis
Cited in
(18)- Symbolic termination analysis of solvable loops
- Termination of polynomial loops
- Discovering non-terminating inputs for multi-path polynomial programs
- Signature-based method of deciding program~termination
- Termination analysis of nonlinear loops over closed and bounded connected domain
- Non-termination Sets of Simple Linear Loops
- Loop Summarization and Termination Analysis
- Proving non-termination
- Proving termination of nonlinear command sequences
- Alternation for termination
- On termination of integer linear loops
- Termination analysis of linear 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
- CONCUR 2005 – Concurrency Theory
- Robust non-termination analysis of numerical software
- Analyzing ultimate positivity for solvable systems
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)