Abstract
Usually, ranking function synthesis and invariant generation over a loop with integer variables involves abstracting the loop to have real variables. Integer division and modulo arithmetic must be soundly abstracted away so that the analysis over the abstracted loop is sound for the original loop. Consequently, the analysis loses precision. In contrast, we introduce a technique for handling loops over integer variables directly. The resulting analysis is more precise than previous analyses.
This research was supported in part by NSF grants CCR-01-21403, CCR-02-20134, CCR-02-09237, CNS-0411363, and CCF-0430102, by ARO grant DAAD19-01-1-0723, and by NAVY/ONR contract N00014-03-1-0939. The first author was additionally supported by a Sang Samuel Wang Stanford Graduate Fellowship.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bradley, A.R., Manna, Z., Sipma, H.B.: Linear ranking with reachability. In: CAV (2005) (to appear)
Colón, M., Sankaranarayanan, S., Sipma, H.: Linear invariant generation using non-linear constraint solving. In: CAV, pp. 420–433 (2003)
Colón, M., Sipma, H.: Synthesis of linear ranking functions. In: TACAS, pp. 67–81 (2001)
Colón, M., Sipma, H.: Practical methods for proving program termination. In: CAV, pp. 442–454 (2002)
Cooper, D.C.: Theorem proving in arithmetic without multiplication. Machine Intelligence 7, 91–100 (1972)
Cousot, P.: Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In: VMCAI, pp. 1–24 (2005)
Cousot, P., Cousot, R.: Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. ACM Principles of Programming Languages, 238–252 (1977)
Cousot, P., Halbwachs, N.: Automatic discovery of linear restraints among the variables of a program. ACM Principles of Programming Languages, 84–97 (January 1978)
Sipma, H.B., Uribe, T.E., Manna, Z.: Deductive model checking. In: CAV, pp. 209–219 (1996)
Hennessy, J.L., Patterson, D.A.: Computer organization and design, 2nd edn. the hardware/software interface. Morgan Kaufmann Publishers Inc, San Francisco (1998)
Hentenryck, P.V., Michel, L., Benhamou, F.: Newton - constraint programming over nonlinear constraints. Sci. Comput. Program, 83–118 (1998)
Manna, Z., Browne, A., Sipma, H., Uribe, T.E.: Visual abstractions for temporal verification. Algebraic Methodology and Software Technology, 28–41 (1998)
Podelski, A., Rybalchenko, A.: A complete method for the synthesis of linear ranking functions. In: VMCAI (2004), pp. 239–251 (2004)
Podelski, A., Rybalchenko, A.: Transition invariants. In: LICS (2004), pp. 32–41 (2004)
Presburger, M.: Ueber die vollstaendigkeit eines gewissen systems der arithmetic ganzer zahlen, in welchem die addition als einzige operation hervortritt. Comptes Rendus du I congrs de Mathmaticiens des Pays Slaves, 92–101 (1929)
Pugh, W.: The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM 35, 102–114 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bradley, A.R., Manna, Z., Sipma, H.B. (2005). Termination Analysis of Integer Linear Loops. In: Abadi, M., de Alfaro, L. (eds) CONCUR 2005 – Concurrency Theory. CONCUR 2005. Lecture Notes in Computer Science, vol 3653. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539452_37
Download citation
DOI: https://doi.org/10.1007/11539452_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28309-6
Online ISBN: 978-3-540-31934-4
eBook Packages: Computer ScienceComputer Science (R0)