Ping-Pong Protocols as Prefix Grammars and Turchin Relation

Autor:	Antonina Nepeivoda
Rok vydání:	2018
Předmět:	Prefix Tree-adjoining grammar Theoretical computer science Relation (database) Rule-based machine translation Computer science Program transformation Word problem (mathematics) Rewriting Prefix grammar
Zdroj:	VPT@CAV
ISSN:	2398-7340
Popis:	The paper describes how to verify cryptographic protocols by a general-purpose programtransformation technique with unfolding. The questions of representation and analysisof the protocols as prefix rewriting grammars are discussed. In these aspects Higman andTurchin embeddings on computational paths are considered, and a refinement of Turchin’srelation is presented that allows to algorithmically decide the empty word problem forprefix rewriting grammars.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::7bfb8ebafeaf57470b4bf6458d0d190d https://doi.org/10.29007/lw7c Zobrazit plný text záznamu