Approximating the domains of functional and imperative programs
Science of Computer Programming
Practical Methods for Proving Program Termination
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
Termination analysis of integer linear loops
CONCUR 2005 - Concurrency Theory
Termination proofs for systems code
Proceedings of the 2006 ACM SIGPLAN conference on Programming language design and implementation
Proceedings of the 35th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Program analysis as constraint solving
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
Proving Conditional Termination
CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
The verified software initiative: A manifesto
ACM Computing Surveys (CSUR)
Mathematics for reasoning about loop functions
Science of Computer Programming
Looper: Lightweight Detection of Infinite Loops at Runtime
ASE '09 Proceedings of the 2009 IEEE/ACM International Conference on Automated Software Engineering
Non-termination checking for imperative programs
TAP'08 Proceedings of the 2nd international conference on Tests and proofs
SAS'10 Proceedings of the 17th international conference on Static analysis
Loop summarization and termination analysis
TACAS'11/ETAPS'11 Proceedings of the 17th international conference on Tools and algorithms for the construction and analysis of systems: part of the joint European conferences on theory and practice of software
Computing preconditions and postconditions of while loops
ICTAC'11 Proceedings of the 8th international conference on Theoretical aspects of computing
Invariant relations: an automated tool to analyze loops
VECoS'11 Proceedings of the Fifth international conference on Verification and Evaluation of Computer and Communication Systems
| Hi-index | 0.00 |
Proving program termination plays an important role in ensuring reliability of software systems. Many researchers have lent much attention to this open long-standing problem, most of them were interested in proving that iterative programs terminate under a given input. In this paper, we present a method to solve a more interesting and challenging problem, namely, the generation of the termination condition of while loops i.e. condition over initial states under which a loop terminates normally. To this effect, we use a concept introduced by Mili et al., viz. invariant relation.