relation: http://eprints.imtlucca.it/1359/
title: A Transformation Strategy for Verifying 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 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.
publisher: CEUR Workshop Proceedings
date: 2010
type: Book Section
type: PeerReviewed
identifier:   Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  A Transformation Strategy for Verifying Logic Programs on Infinite Lists.   In:  Proceedings of the 25th Italian Conference on Computational Logic.   CEUR Workshop Proceedings  (598).  CEUR Workshop Proceedings, pp. 1-17.       (2010)  
relation: http://map.uniroma2.it/papers/PetProSen_CILC10_revised.pdf