TY  - JOUR
VL  - 10
SP  - 383
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
PB  - Cambridge University Press
IS  - 4-6
JF  - Theory and Practice of Logic Programming
Y1  - 2010///
EP  - 399
N1  - Special Issue on the 26th International Conference on Logic Programming, Edinburgh, Scotland, UK, July 16-19, 2010
ID  - eprints1362
N2  - 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.
SN  - 1471-0684
UR  - http://dx.doi.org/10.1017/S1471068410000177
AV  - none
TI  - Transformations of logic programs on infinite lists
KW  - Program transformation; Program verification; Infinite lists
ER  -