Verification of Multi-Party Ping-Pong Protocols via Program Transformation

Abstract

The paper describes a verification technique based on program transformation with unfolding. The technique allows to find short attacks on multi-party ping-pong protocols in the Dolev-Yao intruder model. Protocols are modelled by prefix grammars, and questions of model optimization and complexity are considered. Examples of model programs for protocols were written in a functional language and were analyzed by a general-purpose supercompiler.