%0 Journal Article
%@ 1471-0684
%A Pettorossi, Alberto
%A Proietti, Maurizio
%A Senni, Valerio
%D 2010
%F eprints:1362
%I Cambridge University Press
%J Theory and Practice of Logic Programming
%K Program transformation; Program verification; Infinite lists
%N 4-6
%P 383-399
%T Transformations of logic programs on infinite lists
%U http://eprints.imtlucca.it/1362/
%V 10
%X We consider an extension of logic programs, called ω-programs, that can be used to define predicates over infinite lists. ω-programs allow us to specify properties of the infinite behavior of reactive systems and, in general, properties of infinite sequences of events. The semantics of ω-programs is an extension of the perfect model semantics. We present variants of the familiar unfold/fold rules which can be used for transforming ω-programs. We show that these new rules are correct, that is, their application preserves the perfect model semantics. Then we outline a general methodology based on program transformation for verifying properties of ω-programs. We demonstrate the power of our transformation-based verification methodology by proving some properties of Büchi automata and ω-regular languages.
%Z Special Issue on the 26th International Conference on Logic Programming, Edinburgh, Scotland, UK, July 16-19, 2010