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)
Full text not available from this repository.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.
| Item Type: | Book Section |
|---|---|
| Identification Number: | https://doi.org/10.1007/11680093_3 |
| Additional Information: | 15th International Symposium, LOPSTR 2005, Imperial College, London, UK, September 7-9, 2005, 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: | 26 Sep 2012 13:05 |
| Last Modified: | 07 Mar 2013 12:56 |
| URI: | http://eprints.imtlucca.it/id/eprint/1382 |
Actions (login required)
 |
Edit Item |
