Logo eprints

A Transformation Strategy for Verifying Logic Programs on Infinite Lists

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)

Full text not available from this repository.


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.

Item Type: Book Section
Additional Information: CILC 2010, 25th Italian Conference on Computational Logic, Rende, Italy, July 7-9, 2010
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Users 40 not found.
Date Deposited: 18 Sep 2012 13:56
Last Modified: 07 Mar 2013 12:56
URI: http://eprints.imtlucca.it/id/eprint/1359

Actions (login required)

Edit Item Edit Item