eprintid: 1359
rev_number: 10
eprint_status: archive
userid: 40
dir: disk0/00/00/13/59
datestamp: 2012-09-18 13:56:51
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-18 13:56:51
type: book_section
metadata_visibility: show
creators_name: Pettorossi, Alberto
creators_name: Proietti, Maurizio
creators_name: Senni, Valerio
creators_id: 
creators_id: 
creators_id: valerio.senni@imtlucca.it
title: A Transformation Strategy for Verifying Logic Programs on Infinite Lists
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: CILC 2010, 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010

abstract: 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.
date: 2010
date_type: published
series: CEUR Workshop Proceedings
number: 598
publisher: CEUR Workshop Proceedings
pagerange: 1-17
refereed: TRUE
book_title: Proceedings of the 25th Italian Conference on Computational Logic
official_url: http://map.uniroma2.it/papers/PetProSen_CILC10_revised.pdf
citation:   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)