2015
DOI: 10.1016/j.infsof.2014.07.003
|View full text |Cite
|
Sign up to set email alerts
|

Similarity testing for access control

Abstract: a b s t r a c tContext: Access control is among the most important security mechanisms, and XACML is the de facto standard for specifying, storing and deploying access control policies. Since it is critical that enforced policies are correct, policy testing must be performed in an effective way to identify potential security flaws and bugs. In practice, exhaustive testing is impossible due to budget constraints. Therefore the tests need to be prioritized so that resources are focused on their most relevant sub… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3

Citation Types

0
22
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 20 publications
(24 citation statements)
references
References 39 publications
0
22
0
Order By: Relevance
“…Similarity testing is a promising test case prioritization approach that uses similarity functions to calculate the degree of similarity between pairs of tests and define test ordering (Cartaxo et al 2011;Bertolino et al 2015;Coutinho et al 2014). It is an all-toall comparison problem (Zhang et al 2017) and, as most test prioritization algorithms (Elbaum et al 2002), it has complexity O(n 2 ).…”
Section: Similarity Testingmentioning
confidence: 99%
See 4 more Smart Citations
“…Similarity testing is a promising test case prioritization approach that uses similarity functions to calculate the degree of similarity between pairs of tests and define test ordering (Cartaxo et al 2011;Bertolino et al 2015;Coutinho et al 2014). It is an all-toall comparison problem (Zhang et al 2017) and, as most test prioritization algorithms (Elbaum et al 2002), it has complexity O(n 2 ).…”
Section: Similarity Testingmentioning
confidence: 99%
“…It is an all-toall comparison problem (Zhang et al 2017) and, as most test prioritization algorithms (Elbaum et al 2002), it has complexity O(n 2 ). It assumes that resembling test cases are redundant in a sense they cover the same features of an SUT and tend to have equivalent fault detection capabilities (Bertolino et al 2015).…”
Section: Similarity Testingmentioning
confidence: 99%
See 3 more Smart Citations