TY  - CHAP
T3  - Lecture Notes in Computer Science
Y1  - 2010///
N2  - 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
N1  - 19th International Symposium, LOPSTR 2009, Coimbra, Portugal, September 2009, Revised Selected Papers
TI  - Deciding Full Branching Time Logic by Program Transformation
A1  - Pettorossi, Alberto
A1  - Proietti, Maurizio
A1  - Senni, Valerio
ID  - eprints1372
AV  - public
SN  - 10.1007/978-3-642-12592-8_2
SP  - 5
T2  - Logic-Based Program Synthesis and Transformation
UR  - http://dx.doi.org/10.1007/978-3-642-12592-8_2
PB  - Springer
EP  - 21
ER  -