eprintid: 1362
rev_number: 10
eprint_status: archive
userid: 40
dir: disk0/00/00/13/62
datestamp: 2012-09-18 15:15:57
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-18 15:16:39
type: article
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: Transformations of logic programs on infinite lists
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
keywords: Program transformation; Program verification; Infinite lists
note: Special Issue on the 26th International Conference on Logic Programming, Edinburgh, Scotland, UK, July 16-19, 2010
abstract: 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.
date: 2010
date_type: published
publication: Theory and Practice of Logic Programming
volume: 10
number: 4-6
publisher: Cambridge University Press
pagerange: 383-399
id_number: 10.1017/S1471068410000177
refereed: TRUE
issn: 1471-0684
official_url: http://dx.doi.org/10.1017/S1471068410000177
citation:   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)