TY  - CHAP
AV  - none
ID  - eprints1359
TI  - A Transformation Strategy for Verifying Logic Programs on Infinite Lists
N1  - CILC 2010, 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010

UR  - http://map.uniroma2.it/papers/PetProSen_CILC10_revised.pdf
N2  - 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.
PB  - CEUR Workshop Proceedings
EP  - 17
Y1  - 2010///
T3  - CEUR Workshop Proceedings
SP  - 1
T2  - Proceedings of the 25th Italian Conference on Computational Logic
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
ER  -