Transformations of logic programs on infinite lists

  • Authors:

  • Alberto Pettorossi;Valerio Senni;Maurizio Proietti

  • Affiliations:

  • Disp, university of rome tor vergata, via del politecnico 1, i-00133 rome, italy (e-mail: pettorossi@disp.uniroma2.it, senni@disp.uniroma2.it);Disp, university of rome tor vergata, via del politecnico 1, i-00133 rome, italy (e-mail: pettorossi@disp.uniroma2.it, senni@disp.uniroma2.it);Iasi-cnr, viale manzoni 30, i-00185 rome, italy (e-mail: maurizio.proietti@iasi.cnr.it)

  • Venue:
  • Theory and Practice of Logic Programming
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.