TERMINATION ANALYSIS OF LINEAR LOOPS
DOI10.1142/S0129054110007696zbMATH Open1213.68213MaRDI QIDQ3069740FDOQ3069740
Zhibin Li, Ming Xu, Zhenbing Zeng, Liangyu Chen
Publication date: 19 January 2011
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
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
- scientific article; zbMATH DE number 7561611
- Symbolic termination analysis of solvable loops
- Loop Summarization and Termination Analysis
symbolic computationprogram verificationterminationlinear loopmulti-exponential polynomialreal root bound
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)
Cites Work
Cited In (10)
- Discovering non-terminating inputs for multi-path polynomial programs
- Non-termination Sets of Simple Linear Loops
- Robust non-termination analysis of numerical software
- Title not available (Why is that?)
- Termination of polynomial loops
- Loop Summarization and Termination Analysis
- Analyzing ultimate positivity for solvable systems
- Verification, Model Checking, and Abstract Interpretation
- Automated Technology for Verification and Analysis
- CONCUR 2005 – Concurrency Theory
Uses Software
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)
