@incollection{eprints1359,
          series = {CEUR Workshop Proceedings},
           pages = {1--17},
       publisher = {CEUR Workshop Proceedings},
            note = {CILC 2010, 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010
},
       booktitle = {Proceedings of the 25th Italian Conference on Computational Logic},
          number = {598},
          author = {Alberto Pettorossi and Maurizio Proietti and Valerio Senni},
            year = {2010},
           title = {A Transformation Strategy for Verifying Logic Programs on Infinite Lists},
             url = {http://eprints.imtlucca.it/1359/},
        abstract = {We consider an extension of the class of logic programs,
called !-programs, that can be used to define predicates over infinite lists. The {\ensuremath{\omega}}-programs allow us to specify properties of the infinite behaviour of reactive systems and, in general, properties of infinite sequences of events. The semantics of {\ensuremath{\omega}}-programs is an extension of the
perfect model semantics. We present a general methodology based on an extension of the unfold/fold transformation rules which can be used for verifying properties of {\ensuremath{\omega}}-programs. Then we propose a strategy for
the mechanical application of those rules and we demonstrate the power of that strategy by proving some properties of {\ensuremath{\omega}}-regular languages and B{\"u}chi automata.}
}