A region graph based approach to termination proofs

Authors:
Stefan Leue;Wei Wei
Affiliations:
Department of Computer and Information Science, University of Konstanz, Konstanz, Germany;Department of Computer and Information Science, University of Konstanz, Konstanz, Germany
Venue:
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Year:
2006

Citing 7
Cited 3

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
Transition Invariants

LICS '04 Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science
Termination analysis of integer linear loops

CONCUR 2005 - Concurrency Theory
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
Termination of polynomial programs

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation
Counterexample-based refinement for a boundedness test for CFSM languages

SPIN'05 Proceedings of the 12th international conference on Model Checking Software
Abstraction refinement for termination

SAS'05 Proceedings of the 12th international conference on Static Analysis

Automatic Verification of Counter Systems With Ranking Function

Electronic Notes in Theoretical Computer Science (ENTCS)
Termination of loop programs with polynomial guards

ICCSA'10 Proceedings of the 2010 international conference on Computational Science and Its Applications - Volume Part IV
A livelock freedom analysis for infinite state asynchronous reactive systems

CONCUR'06 Proceedings of the 17th international conference on Concurrency Theory

Quantified Score

Hi-index	0.00

Visualization

Abstract

Automated termination proofs are indispensable in the mechanic verification of many program properties. While most of the recent work on automated termination proofs focuses on the construction of linear ranking functions, we develop an approach based on region graphs in which regions define subsets of variable values that have different effects on loop termination. In order to establish termination, we check whether (1) any region will be exited once it is entered, and (2) no region is entered an infinite number of times. We show the effectiveness of our proof method by experiments with Java code using a prototype implementation of our approach.