Albert, E. and Arenas, P. and Genaim, S. and Puebla, G. and Zanardini, D. (2008):
COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode.
In: Formal Methods for Components and Objects: 6th International Symposium, FMCO 2007, Amsterdam, The Netherlands, October 24-26, 2007, Revised Lectures.
Springer-Verlag,
pp. 113—132,
doi:10.1007/978-3-540-92188-2_5.
T. Arts (1997):
Automatically Proving Termination and Innermost Normalisation of Term Rewriting Systems.
Universiteit Utrecht.
J. Berdine, B. Cook, D. Distefano & P. W. O'Hearn (2006):
Automatic Termination Proofs for Programs with Shape-Shifting Heaps.
In: International Conference on Computer Aided Verification,
pp. 386—400,
doi:10.1007/11817963_35.
A. Bradley, Z. Manna & H.B. Sipma (2005):
Linear Ranking with Reachability.
In: 17th International Conference on Computer Aided Verification,,
pp. 491–504,
doi:10.1007/11513988_48.
A. R. Bradley, Z. Manna & H. B. Sipma (2005):
Termination of Polynomial Programs.
In: International Conference on Verification, Model Checking, and Abstract Interpretation,
pp. 113–129,
doi:10.1007/978-3-540-30579-8_8.
J. Brotherston, R. Bornat & C. Calcagno (2008):
Cyclic Proofs of Program Termination in Separation Logic.
In: ACM Symposium on Principles of Programming Languages,
pp. 101–112,
doi:10.1145/1328897.1328453.
M. Codish & C. Taboch (1997):
A Semantic Basis for Termination Analysis of Logic Programs and its Realization Using Symbolic Norm Constraints.
In: International Joint Conference on Algebraic and Logic Programming,
Lecture Notes in Computer Science 1298,
pp. 31–45,
doi:10.1007/BFb0027001.
B. Cook, A. Podelski & A. Rybalchenko (2006):
Termination Proofs for Systems Code.
SIGPLAN Notices 41(6),
pp. 415—426,
doi:10.1145/1133255.1134029.
B. Cook, A. Podelski & A. Rybalchenko (2011):
Proving Program Termination.
Communications of the ACM 54(5),
pp. 88—98,
doi:10.1145/1941487.1941509.
N. Dershowitz (1987):
Termination of Rewriting.
Journal of Symbolic Computation 3,
pp. 69–116,
doi:10.1016/S0747-7171(87)80022-6.
R.W. Floyd (1967):
Assigning Meanings to Programs.
In: Proceedings of the American Mathematical Society Symposia on Applied Mathematics 19,
pp. 19–32,
doi:10.1007/978-94-011-1793-7_4.
J. Geisl (1995):
Termination Analysis for Functional Programs Using Term Orderings.
In: Second International Static Analysis Symposium,
Lecture Notes in Computer Science 983,
pp. 154–171,
doi:10.1007/3-540-60360-3_38.
J. Giesl, M. Brockschmidt, F. Emmes, C. Frohn, F. Fuhs, C. Otto, M. Plücker, P. Schneider-Kamp, T. Ströder, S. Swiderski & R Thiemann. (2014):
Proving Termination of Programs Automatically with AProVE.
In: International Joint Conference on Automated Reasoning,
pp. 184–191,
doi:10.1007/978-3-319-08587-6_13.
J. Giesl, S. Swiderski, P. Schneider-Kamp & R. Thiemann (2006):
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages..
In: International Conference on Rewriting Techniques and Applications,
pp. 297–312,
doi:10.1007/11805618_23.
G.W. Hamilton (2007):
Distillation: Extracting the Essence of Programs.
In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation,
pp. 61–70,
doi:10.1145/1244381.1244391.
G.W. Hamilton & N.D. Jones (2012):
Distillation With Labelled Transition Systems.
In: Proceedings of the ACM SIGPLAN Symposium on Partial Evaluation and Semantics-Based Program Manipulation.
ACM,
pp. 15–24,
doi:10.1145/2103746.2103753.
C.S. Lee, N.D. Jones & A.M. Ben-Amram (2001):
The Size-Change Principle for Program Termination.
In: The 28th ACM Symposium on Principles of Programming Languages,
pp. 81–92,
doi:10.1145/360204.360210.
N. Lindenstrauss & Y. Sagiv (1997):
Automatic Termination Analysis of Prolog Programs.
In: International Conference on Logic Programming,
pp. 64–77.
P. Manolios & D. Vroon (2006):
Termination Analysis with Calling Context Graphs.
In: International Conference on Computer Aided Verification,
pp. 401–414,
doi:10.1007/11817963_36.
Y. Sagiv (1991):
A Termination Test for Logic Programs.
In: International Symposium on Logic Programming,
pp. 518–532.
D. Sereni D. & N.D. Jones (2005):
Termination Analysis of Higher-Order Functional Programs.
In: Asian Symposium on Programming Languages and Systems,
Lecture Notes in Computer Science 3780,
pp. 281–297,
doi:10.1007/11575467_19.
M.H. Sørensen, R. Glück & N.D. Jones (1996):
A Positive Supercompiler.
Journal of Functional Programming 6(6),
pp. 811–838,
doi:10.1017/S0956796800002008.
Spoto, F. and Mesnard, F. and Payet, E. (2010):
A Termination Analyzer for Java Bytecode Based on Path-Length.
ACM Transaction on Programming Languages and Systems 32(3),
pp. 8:1–8:70,
doi:10.1145/1709093.1709095.
J. Steinbach (1995):
Automatic Termination Proofs With Transformation Orderings.
In: International Conference on Rewriting Techniques and Applications,
Lecture Notes in Computer Science 914,
pp. 11–25,
doi:10.1007/3-540-59200-8_44.
V.F. Turchin (1986):
The Concept of a Supercompiler.
ACM Transactions on Programming Languages and Systems 8(3),
pp. 90–121,
doi:10.1145/5956.5957.
A.M. Turing (1936):
On Computable Numbers, with an Application to the Entscheidungsproblem.
Proceedings of the London Mathematical Society, 2 42(1),
pp. 230–265,
doi:10.1112/plms/s2-42.1.230.
A.M. Turing (1948):
Checking a Large Routine.
In: The Early British Computer Conferences,
pp. 70–72,
doi:10.5555/94938.94952.
eptcs@eptcs.org