relation: http://eprints.imtlucca.it/1362/
title: Transformations of logic programs on infinite lists
creator: Pettorossi, Alberto
creator: Proietti, Maurizio
creator: Senni, Valerio
subject: QA75 Electronic computers. Computer science
description: 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.
publisher: Cambridge University Press
date: 2010
type: Article
type: PeerReviewed
identifier:   Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Transformations of logic programs on infinite lists.  Theory and Practice of Logic Programming, 10 (4-6).  pp. 383-399.  ISSN 1471-0684      (2010)  
relation: http://dx.doi.org/10.1017/S1471068410000177
relation: 10.1017/S1471068410000177