Zobrazeno 1 - 8
of 8
pro vyhledávání: '"Antonina Nepeivoda"'
Autor:
Antonina Nepeivoda
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 216, Iss Proc. VPT 2016, Pp 137-159 (2016)
Supercompilation is a program transformation technique that was first described by V. F. Turchin in the 1970s. In supercompilation, Turchin's relation as a similarity relation on call-stack configurations is used both for call-by-value and call-by-na
Externí odkaz:
https://doaj.org/article/80b068c3a8204cbaa2bf461713cb8f63
Autor:
Antonina Nepeivoda
Publikováno v:
VPT@ETAPS
The paper focuses on the automatic generating of the witnesses for the word equation satisfiability problem by means of specializing an interpreter which tests whether a composition of variable substitutions of a given word equation system produces i
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::612f36b60c8de5b46401c8af928c1d5a
Autor:
Antonina Nepeivoda
Publikováno v:
Program Systems: Theory and Applications. 9:3-21
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0a453f4703e13e167639e9e04b4381d1
https://doi.org/10.25209/2079-3316-2018-9-2-3-21
https://doi.org/10.25209/2079-3316-2018-9-2-3-21
Autor:
Antonina Nepeivoda
Publikováno v:
Journal of Logical and Algebraic Methods in Programming. 85:782-804
This paper presents a technique to model ping-pong protocols by prefix grammars in such a way that the security of the protocol models becomes decidable by a general-purpose program transformation tool with unfolding. The presented approach not only
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::64126146fa99f44a56fbd923ed85c378
https://doi.org/10.1016/j.jlamp.2016.06.001
https://doi.org/10.1016/j.jlamp.2016.06.001
Autor:
Antonina Nepeivoda
Publikováno v:
Ershov Memorial Conference (Posters)
The paper studies the subsequence relation through a notion of an intransitive binary relation on words in traces generated by prefix-rewriting systems. The relation was introduced in 1988 by V.F. Turchin for loop approximation in supercompilation. W
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::4e6058e243182bd0fd80dd5b7554ae34
https://doi.org/10.29007/xqx9
https://doi.org/10.29007/xqx9
Autor:
Antonina Nepeivoda
Publikováno v:
VPT@CAV
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 H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7bfb8ebafeaf57470b4bf6458d0d190d
https://doi.org/10.29007/lw7c
https://doi.org/10.29007/lw7c
Autor:
Antonina Nepeivoda
Publikováno v:
VPT@CAV
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, a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::958e7f0752ce8501f148555592a53d4f
https://doi.org/10.29007/1r2w
https://doi.org/10.29007/1r2w
Publikováno v:
Automation and Remote Control. 73:1539-1552
We consider the verification problem for an electromechanical device with a variable number of connectors and solve it with the modal logic LTL (Linear Temporal Logic). In the course of the analysis, we prove continuity and unambiguity theorems for t
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::66c32bdd69521b683ea59c704bf814be
https://doi.org/10.1134/s0005117912090081
https://doi.org/10.1134/s0005117912090081