Transformational Verification of Parameterized Protocols Using Array Formulas | Zendy

Alberto Pettorossi | Zendy; Maurizio Proietti | Zendy; Valerio Senni | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Transformational Verification of Parameterized Protocols Using Array Formulas

Author(s) -

Alberto Pettorossi,

Maurizio Proietti,

Valerio Senni

Publication year - 2006

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-32654-5

DOI - 10.1007/11680093_3

Subject(s) - parameterized complexity , computer science , theoretical computer science , programming language , algorithm

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

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research