Normal view
MARC view
Using models of finite transition systems for checking Web-service security A. V. Kolomeets, N. V. Shabaldina, E. V. Darusenkova, N. V. Yevtushenko
Material type:
ArticleSubject(s): конечные автоматы | Web-сервисыGenre/Form: статьи в сборниках Online resources: Click here to access online
In:
18th International Conference of Young Specialists on Micro/Nanotechnologies and Electron Devices : proceedings, Erlagol, Altai Republic, 29 June - 3 July, 2017 P. 151-154Abstract: In this paper we discuss how the web-service
security can be checked using finite automata. We analyze
existed attack patterns and discuss different representations
for these patterns. We also consider automata equations in
order to describe malicious inputs. We describe a class of such
equations that have no solutions and provide some venues for
a future work.
No physical items for this record
Библиогр.: 14 назв.
In this paper we discuss how the web-service
security can be checked using finite automata. We analyze
existed attack patterns and discuss different representations
for these patterns. We also consider automata equations in
order to describe malicious inputs. We describe a class of such
equations that have no solutions and provide some venues for
a future work.
There are no comments on this title.