Affiliation:
1. Università di Verona, Italy
2. IREMIA, LIM, Université de la Réunion, France
Abstract
It is important to prove that supposedly terminating programs actually terminate, particularly if those programs must be run on critical systems or downloaded into a client such as a mobile phone. Although termination of computer programs is generally undecidable, it is possible and useful to prove termination of a large, nontrivial subset of the terminating programs. In this article, we present our termination analyzer for sequential Java bytecode, based on a program property called
path-length
. We describe the analyses which are needed before the path-length can be computed such as sharing, cyclicity, and aliasing. Then we formally define the path-length analysis and prove it correct with respect to a reference denotational semantics of the bytecode. We show that a constraint logic program
P
CLP
can be built from the result of the path-length analysis of a Java bytecode program
P
and formally prove that if
P
CLP
terminates, then
P
also terminates. Hence a termination prover for constraint logic programs can be applied to prove the termination of
P
. We conclude with some discussion of the possibilities and limitations of our approach. Ours is the first existing termination analyzer for Java bytecode dealing with any kind of data structures dynamically allocated on the heap and which does not require any help or annotation on the part of the user.
Publisher
Association for Computing Machinery (ACM)
Reference103 articles.
1. Aho A. V. Sethi R. and Ullman J. D. 1986. Compilers Principles Techniques and Tools. Addison Wesley. Aho A. V. Sethi R. and Ullman J. D. 1986. Compilers Principles Techniques and Tools. Addison Wesley.
2. The KeY tool
3. Termination Analysis of Java Bytecode
4. Termination Analysis of Java Bytecode
Cited by
80 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Symbolic Model Construction for Saturated Constrained Horn Clauses;Frontiers of Combining Systems;2023
2. Large-scale analysis of non-termination bugs in real-world OSS projects;Proceedings of the 30th ACM Joint European Software Engineering Conference and Symposium on the Foundations of Software Engineering;2022-11-07
3. When COSTA Met KeY: Verified Cost Bounds;The Logic of Software. A Tasting Menu of Formal Methods;2022
4. Analysis and Transformation of Constrained Horn Clauses for Program Verification;Theory and Practice of Logic Programming;2021-11-15
5. Termination Analysis of Programs with Multiphase Control-Flow;Electronic Proceedings in Theoretical Computer Science;2021-09-13