Download PDFOpen PDF in browserPing-Pong Protocols as Prefix Grammars and Turchin Relation14 pages•Published: July 25, 2013AbstractThe paper describes how to verify cryptographic protocols by a general-purpose programtransformation technique with unfolding. The questions of representation and analysis of the protocols as prefix rewriting grammars are discussed. In these aspects Higman and Turchin embeddings on computational paths are considered, and a refinement of Turchin’s relation is presented that allows to algorithmically decide the empty word problem for prefix rewriting grammars. Keyphrases: cryptographic protocols, ping pong protocols, prefix rewriting, supercompilation, turchin relation In: Alexei Lisitsa and Andrei Nemytykh (editors). VPT 2013. First International Workshop on Verification and Program Transformation, vol 16, pages 74-87.
|