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

15 pages•Published: July 28, 2014

Abstract

The paper describes a verification technique based on program transformation with unfolding that 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.

Keyphrases: ping pong protocols, prefix grammar, supercompilation, verification

In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2014. Second International Workshop on Verification and Program Transformation, vol 28, pages 84-98.

Links:	https://easychair.org/publications/paper/PQP
	https://doi.org/10.29007/1r2w

BibTeX entry

@inproceedings{VPT2014:Verification_Multi_Party_Ping,
  author    = {Antonina Nepeivoda},
  title     = {Verification of Multi-Party Ping-Pong Protocols via Program Transformation},
  booktitle = {VPT 2014. Second International Workshop on Verification and Program Transformation},
  editor    = {Alexei Lisitsa and Andrei Nemytykh},
  series    = {EPiC Series in Computing},
  volume    = {28},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/PQP},
  doi       = {10.29007/1r2w},
  pages     = {84-98},
  year      = {2014}}

Download PDF Open PDF in browser