Logo eprints

Deciding Full Branching Time Logic by Program Transformation

Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio Deciding Full Branching Time Logic by Program Transformation. In: Logic-Based Program Synthesis and Transformation. Lecture Notes in Computer Science (6037). Springer, pp. 5-21. ISBN 10.1007/978-3-642-12592-8_2 (2010)

PDF - Submitted Version
Download (356kB) | Preview


We present a method based on logic program transformation, for verifying Computation Tree Logic (CTL*) properties of finite state reactive systems. The finite state systems and the CTL* properties we want to verify, are encoded as logic programs on infinite lists. Our verification method consists of two steps. In the first step we transform the logic program that encodes the given system and the given property, into a monadic ω -program, that is, a stratified program defining nullary or unary predicates on infinite lists. This transformation is performed by applying unfold/fold rules that preserve the perfect model of the initial program. In the second step we verify the property of interest by using a proof method for monadic ω-programs

Item Type: Book Section
Additional Information: 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Users 40 not found.
Date Deposited: 24 Sep 2012 13:13
Last Modified: 07 Mar 2013 12:56
URI: http://eprints.imtlucca.it/id/eprint/1372

Actions (login required)

Edit Item Edit Item