2020
DOI: 10.1007/s10796-020-10066-9
|View full text |Cite
|
Sign up to set email alerts
|

A Formal Specification of Access Control in Android with URI Permissions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 21 publications
0
1
0
Order By: Relevance
“…However, it should be observed that Alloy can only prove that formulas are satisfiable, whereas {log} can prove both, satisfiability and unsatisfiability. There are more works using formal methods to study a specific aspect of Android which not necessarily conduct formal verification [48,49,50]. These approaches require a high amount of human effort, not only for identifying flaws but also to prove any desired property.…”
Section: Discussion and Related Workmentioning
confidence: 99%
“…However, it should be observed that Alloy can only prove that formulas are satisfiable, whereas {log} can prove both, satisfiability and unsatisfiability. There are more works using formal methods to study a specific aspect of Android which not necessarily conduct formal verification [48,49,50]. These approaches require a high amount of human effort, not only for identifying flaws but also to prove any desired property.…”
Section: Discussion and Related Workmentioning
confidence: 99%