Termination analysis of integer linear loops

Lecture Notes in Computer Science

Volumn 3653, Issue , 2005, Pages 488-502

  Bradley, Aaron R ^a   Manna, Zohar ^a   Sipma, Henny B ^a  

^a Stanford University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

PRECISION ENGINEERING;

INTEGER LINEAR LOOPS; INTEGER VARIABLES; MODULO ARITHMETIC;

CONCURRENCY CONTROL;

EID: 27244439995     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11539452_37     Document Type: Conference Paper

References (16)

1. BRADLEY, A. R., MANNA, Z., AND SIPMA, H. B. Linear ranking with reachability. In CAV (2005). To appear.
2. COLON, M., SANKARANARAYANAN, S., AND SIPMA, H. Linear invariant generation using non-linear constraint solving. In CAV (2003), pp. 420-433.
3. COLON, M., AND SIPMA, H. Synthesis of linear ranking functions. In TACAS (2001), pp. 67-81.
4. COLON, M., AND SIPMA, H. Practical methods for proving program termination. In CAV (2002), pp. 442-454.
5. COOPER, D. C. Theorem proving in arithmetic without multiplication. Machine Intelligence 7 (1972), 91-100.
6. COUSOT, P. Proving program invariance and termination by parametric abstraction, lagrangian relaxation and semidefinite programming. In VMCAI (2005), pp. 1-24.
7. COUSOT, P., AND COUSOT, R. Abstract Interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In ACM Principles of Programming Languages (1977), pp. 238-252.
8. COUSOT, P., AND HALBWACHS, N. Automatic discovery of linear restraints among the variables of a program. In ACM Principles of Programming Languages (Jan. 1978), pp. 84-97.
9. H. B. SIPMA, T. E. URIBE, AND Z. MANNA. Deductive model checking. In CAV (1996), pp. 209-219.
10. HENNESSY, J. L., AND PATTERSON, D. A. Computer organization and design (2nd ed.): the hardware/software interface. Morgan Kaufmann Publishers Inc., 1998.
11. HENTENRYCK, P. V., MICHEL, L., AND BENHAMOU, F. Newton - constraint programming over nonlinear constraints. Sci. Comput. Program. (1998), 83-118.
12. MANNA, Z., BROWNE, A., SIPMA, H., AND URIBE, T. E. Visual abstractions for temporal verification. In Algebraic Methodology and Software Technology (1998), pp. 28-41.
13. PODELSKI, A., AND RYBALCHENKO, A. A complete method for the synthesis of linear ranking functions. In VMCAI (2004), pp. 239-251.
14. PODELSKI, A., AND RYBALCHENKO, A. Transition invariants. In LICS (2004), pp. 32-41.
15. PRESBURGER, M. Ueber die vollstaendigkeit eines gewissen systems der arithmetik ganzer zahlen, in welchem die addition als einzige operation hervortritt. Comptes Rendus du I congrs de Mathmaticiens des Pays Slaves (1929), 92-101.
16. PUGH, W. The Omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM 35 (1992), 102-114.