@techreport{TR-IC-13-08,
   number = {IC-13-08},
   author = {Rachid Rebiha and Nadir Matringe and Arnaldo V. Moura},
   title  =  {A  Complete  Approach for Termination Analysis of Linear
                   Programs},
   month = {February},
   year = {2013},
   institution = {Institute of Computing, University of Campinas},
   note = {In English, 23 pages.
    \par\selectlanguage{english}\textbf{Abstract}
       We  describe  powerful  computational  methods,  relying on new
       decidability   results   that   respond   completely  to  major 
       conjectures   on   termination   analysis   of   programs  with 
       conditional  linear  loops, on all initial values. Our approach
       is   based   on   linear   algebraic  methods:  we  reduce  the 
       verification   of  the  termination  problem  to  checking  the 
       orthogonality  of  a well determined vector-space and a certain
       vector,  both  related  to  the  loop.  We obtain necessary and
       sufficient  conditions from which we provide the first complete
       method,  which  determines  the  termination of such a class of
       linear  programs.  Our examples (dealing with a large number of
       randomly  generated  linear  loops)  show  the  strength of our
       results,  we  actually  prove  that some of them are beyond the
       limits of other recent approaches.
  }
}