eprintid: 1382
rev_number: 8
eprint_status: archive
userid: 40
dir: disk0/00/00/13/82
datestamp: 2012-09-26 13:05:53
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-26 13:05:53
type: book_section
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: Transformational Verification of Parameterized Protocols Using Array Formulas
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: 15th International Symposium, LOPSTR 2005, Imperial College, London, UK, September 7-9, 2005, Revised Selected Papers
abstract: We propose a method for the specification and the automated verification of temporal properties of parameterized protocols. Our method is based on logic programming and program transformation. We specify the properties of parameterized protocols by using an extension of stratified logic programs. This extension allows premises of clauses to contain first order formulas over arrays of parameterized length. A property of a given protocol is proved by applying suitable unfold/fold transformations to the specification of that protocol. We demonstrate our method by proving that the parameterized Peterson’s protocol among N processes, for any N ≥ 2, ensures the mutual exclusion property. 
date: 2006
date_type: published
series: Lecture Notes in Computer Science
number: 3901
publisher: Springer
pagerange: 23-43
id_number: 10.1007/11680093_3
refereed: TRUE
isbn: 978-3-540-32654-0
book_title: Logic Based Program Synthesis and Transformation
official_url: http://dx.doi.org/10.1007/11680093_3
citation:   Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio  Transformational Verification of Parameterized Protocols Using Array Formulas.   In:  Logic Based Program Synthesis and Transformation.   Lecture Notes in Computer Science  (3901).  Springer, pp. 23-43.  ISBN 978-3-540-32654-0      (2006)