Formal verification of finite state transactional security policy
[ X ]
Tarih
2014
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Springer Verlag
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Security policy helps to ensure that system always takes the desired input action sequence and works in a proper manner. Formal verification of finite state transactional security policy is necessary to check whether the given policy conforms to the specification. One way to specify finite state transactional security policy is by using a filter automaton. A filter automaton is an action sequence transformer that maps an input action sequence into another, so that the output action sequence obeys the specified policy. A method for verification of finite state transactional security policy enforced by filter automata is being proposed. The observable actions finite security automaton and the observable actions finite truncation automaton are used to verify a finite state transactional security policy. © Springer International Publishing Switzerland 2014.
Açıklama
Fujian Normal University;ISN State Key Laboratory;Springer;Xidian University
8th International Conference on Network and System Security, NSS 2014 -- 15 October 2014 through 17 October 2014 -- -- 109279
8th International Conference on Network and System Security, NSS 2014 -- 15 October 2014 through 17 October 2014 -- -- 109279
Anahtar Kelimeler
Finite Edit Automata, Formal Verification, Security Policy, Transaction Isolation
Kaynak
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
WoS Q Değeri
N/A
Scopus Q Değeri
Q3
Cilt
8792
