%K Program transformation; Program verification; Infinite lists
%A Alberto Pettorossi
%A Maurizio Proietti
%A Valerio Senni
%D 2010
%L eprints1362
%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.
%N 4-6
%J Theory and Practice of Logic Programming
%R 10.1017/S1471068410000177
%P 383-399
%T Transformations of logic programs on infinite lists
%O Special Issue on the 26th International Conference on Logic Programming, Edinburgh, Scotland, UK, July 16-19, 2010
%I Cambridge University Press
%V 10