Pettorossi, Alberto and Proietti, Maurizio and Senni, Valerio Verifying parameterized protocols by transforming stratified logic programs. In: Italian Annual Meeting on Computational Logic (CILC'05), 21-22 June 2005, Consiglio Nazionale delle Ricerche, Roma, Italy pp. 1-16. (Submitted) (2005)Full text not available from this repository.
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 specifiation 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:||Conference or Workshop Item (Paper)|
|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:42|
|Last Modified:||07 Mar 2013 12:56|
Actions (login required)