A. R. Bradley, Z. Manna, and H. B. Sipma, What's decidable about arrays, Proc. of VMCAI'06, vol.3855, pp.427-442, 2006.
DOI : 10.1007/11609773_28

URL : http://theory.stanford.edu/~sipma/papers/avmcai06.pdf

M. Codish and C. Taboch, A semantic basis for the termination analysis of logic programs, Journal of Logic Programming, vol.41, issue.1, pp.103-123, 1999.

, Dalvik docs mirror

A. Gupta, T. A. Henzinger, R. Majumdar, A. Rybalchenko, and R. Xu, Proving nontermination, Proc. of POPL'08, pp.147-158, 2008.

J. Jaffar, M. J. Maher, K. Marriott, and P. J. Stuckey, The semantics of constraint logic programs, Journal of Logic Programming, vol.37, issue.1-3, pp.1-46, 1998.

É. Payet and F. Mesnard, A non-termination criterion for binary constraint logic programs. Theory and Practice of Logic Programming, vol.9, pp.145-164, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01186175

É. Payet and F. Spoto, An operational semantics for Android activities, Proc. of PEPM'14, pp.121-132, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01451693