Termination analysis of integer linear loops

Authors:
Aaron R. Bradley;Zohar Manna;Henny B. Sipma
Affiliations:
Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA;Computer Science Department, Stanford University, Stanford, CA
Venue:
CONCUR 2005 - Concurrency Theory
Year:
2005

Citing 12
Cited 19

A practical algorithm for exact array dependence analysis

Communications of the ACM
Computer organization and design (2nd ed.): the hardware/software interface

Computer organization and design (2nd ed.): the hardware/software interface
Newton—constraint programming over nonlinear constraints

Science of Computer Programming - Special issue on concurrent constraint programming
Automatic discovery of linear restraints among variables of a program

POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Visual Abstractions for Temporal Verification

AMAST '98 Proceedings of the 7th International Conference on Algebraic Methodology and Software Technology
Synthesis of Linear Ranking Functions

TACAS 2001 Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems
Practical Methods for Proving Program Termination

CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Deductive Model Checking

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Linear ranking with reachability

CAV'05 Proceedings of the 17th international conference on Computer Aided Verification

Proving thread termination

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
SPEED: precise and efficient static estimation of program computational complexity

Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Automatic Verification of Counter Systems With Ranking Function

Electronic Notes in Theoretical Computer Science (ENTCS)
Alternation for termination

SAS'10 Proceedings of the 17th international conference on Static analysis
Programs with lists are counter automata

Formal Methods in System Design
Parametric and termination-sensitive control dependence

SAS'06 Proceedings of the 13th international conference on Static Analysis
Verification constraint problems with strengthening

ICTAC'06 Proceedings of the Third international conference on Theoretical Aspects of Computing
Termination of loop programs with polynomial guards

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
Termination of integer linear programs

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Programs with lists are counter automata

CAV'06 Proceedings of the 18th international conference on Computer Aided Verification
Proving liveness by backwards reachability

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory
Ranking function synthesis for bit-vector relations

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems
A region graph based approach to termination proofs

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
On the termination of integer loops

VMCAI'12 Proceedings of the 13th international conference on Verification, Model Checking, and Abstract Interpretation
Termination analysis of imperative programs using bitvector arithmetic

VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Using invariant relations in the termination analysis of while loops

Proceedings of the 34th International Conference on Software Engineering
On the Termination of Integer Loops

ACM Transactions on Programming Languages and Systems (TOPLAS)
On the linear ranking problem for integer linear-constraint loops

POPL '13 Proceedings of the 40th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Verifying while loops with invariant relations

International Journal of Critical Computer-Based Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Usually, ranking function synthesis and invariant generation over a loop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic must be soundly abstracted away so that the analysis over the abstracted loop is sound for the original loop. Consequently, the analysis loses precision. In contrast, we introduce a technique for handling loops over integer variables directly. The resulting analysis is more precise than previous analyses.