%O CILC 2010, 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010

%N 598
%B Proceedings of the 25th Italian Conference on Computational Logic
%L eprints1359
%I CEUR Workshop Proceedings
%X We consider an extension of the class of logic programs,
called !-programs, that can be used to define predicates over infinite lists. The ?-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 ?-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 ?-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 ?-regular languages and B?chi automata.
%D 2010
%A Alberto Pettorossi
%A Maurizio Proietti
%A Valerio Senni
%T A Transformation Strategy for Verifying Logic Programs on Infinite Lists
%P 1-17
%S CEUR Workshop Proceedings