An Automatically Verified Prototype of the Android Permissions System

In a previous work we presented formal specifications of idealized formulations of the permission model of Android in the Coq proof assistant. This formal development is about 23 KLOC of Coq code, including proofs. In this work the Coq model is encoded in { l o g } (‘setlog’)—a satisfiability solver...

Full description

Saved in:
Bibliographic Details
Published in:Journal of automated reasoning Vol. 67; no. 2; p. 17
Main Authors: Cristiá, Maximiliano, De Luca, Guido, Luna, Carlos
Format: Journal Article
Language:English
Published: Dordrecht Springer Netherlands 01.06.2023
Springer Nature B.V
Subjects:
ISSN:0168-7433, 1573-0670
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract In a previous work we presented formal specifications of idealized formulations of the permission model of Android in the Coq proof assistant. This formal development is about 23 KLOC of Coq code, including proofs. In this work the Coq model is encoded in { l o g } (‘setlog’)—a satisfiability solver and a constraint logic programming language— which is then used to automatically discharge most of the proofs performed in Coq. We show how the Coq model is encoded in { l o g } and how automated proofs are performed. The resulting { l o g } model is an automatically verified executable prototype of the Android permissions system. Detailed data on the empirical evaluation resulting after executing all the proofs in { l o g } is provided. The integration of Coq and { l o g } as to provide a framework featuring automated proof and prototype generation is discussed.
AbstractList In a previous work we presented formal specifications of idealized formulations of the permission model of Android in the Coq proof assistant. This formal development is about 23 KLOC of Coq code, including proofs. In this work the Coq model is encoded in {log} (‘setlog’)—a satisfiability solver and a constraint logic programming language— which is then used to automatically discharge most of the proofs performed in Coq. We show how the Coq model is encoded in {log} and how automated proofs are performed. The resulting {log} model is an automatically verified executable prototype of the Android permissions system. Detailed data on the empirical evaluation resulting after executing all the proofs in {log} is provided. The integration of Coq and {log} as to provide a framework featuring automated proof and prototype generation is discussed.
In a previous work we presented formal specifications of idealized formulations of the permission model of Android in the Coq proof assistant. This formal development is about 23 KLOC of Coq code, including proofs. In this work the Coq model is encoded in { l o g } (‘setlog’)—a satisfiability solver and a constraint logic programming language— which is then used to automatically discharge most of the proofs performed in Coq. We show how the Coq model is encoded in { l o g } and how automated proofs are performed. The resulting { l o g } model is an automatically verified executable prototype of the Android permissions system. Detailed data on the empirical evaluation resulting after executing all the proofs in { l o g } is provided. The integration of Coq and { l o g } as to provide a framework featuring automated proof and prototype generation is discussed.
ArticleNumber 17
Author De Luca, Guido
Luna, Carlos
Cristiá, Maximiliano
Author_xml – sequence: 1
  givenname: Maximiliano
  surname: Cristiá
  fullname: Cristiá, Maximiliano
  email: cristia@cifasis-conicet.gov.ar
  organization: Universidad Nacional de Rosario and CIFASIS
– sequence: 2
  givenname: Guido
  surname: De Luca
  fullname: De Luca, Guido
  organization: Universidad Nacional de Rosario
– sequence: 3
  givenname: Carlos
  surname: Luna
  fullname: Luna, Carlos
  organization: Universidad de la República
BookMark eNp9kE1LxDAQhoOs4O7qH_BU8FydJG3SHsuyfsCCgh_XkLYTzbJt1iR76L-3awXBg6dhmPeZGZ4FmfWuR0IuKVxTAHkTKBRUpsB4CqUQImUnZE5zObZCwozMgYoilRnnZ2QRwhYAOIVyTtZVn1SH6DodbaN3uyF5Q2-NxTZ58i66OOwxcSaJH5hUfeudHQfoOxuCdX1InocQsTsnp0bvAl781CV5vV2_rO7TzePdw6rapA2nZUwN5MJojU2dCV43dV5mgA20giGUJq_bMocCM5EDL4wAKWtWNFTXDNHommq-JFfT3r13nwcMUW3dwffjScUKyooSqGRjik2pxrsQPBq197bTflAU1FGXmnSpUZf61qWOUPEHamwcpbg-em13_6N8QsN4p39H__vVP9QXtZuBgQ
CitedBy_id crossref_primary_10_1007_s10817_024_09713_6
crossref_primary_10_1017_S1471068424000206
Cites_doi 10.21203/rs.3.rs-2088594/v1
10.1007/s10817-021-09602-2
10.1007/s00165-017-0445-z
10.1145/1999995.2000018
10.1007/3-540-44880-2_1
10.1007/s10817-013-9278-5
10.1007/978-3-662-07964-5
10.1007/978-3-030-02149-8_20
10.4230/LIPIcs.TYPES.2020.3
10.1017/CBO9780511624162
10.1007/s10009-015-0391-0
10.1016/0890-5401(88)90005-3
10.1007/978-3-319-94460-9_16
10.1007/s10817-018-9458-4
10.7561/SACS.2016.1.27
10.1145/2815400.2815428
10.1007/978-3-642-17511-4_20
10.1007/s00607-022-01069-2
10.1109/SocialCom.2010.140
10.1017/S1471068421000521
10.1007/s10817-019-09520-4
10.1007/978-3-642-33167-1_1
10.1007/978-3-642-40561-7_16
10.1007/978-3-319-07512-9_1
10.1007/978-3-319-25150-9_28
10.1007/s10817-021-09589-w
10.1145/3180155.3180172
10.1007/BFb0037116
10.1007/978-3-319-24177-7_26
10.1147/JRD.2013.2284403
10.1145/365151.365169
10.1007/s10817-020-09577-6
10.1186/s13673-018-0144-7
10.1007/978-1-4757-3452-2
10.1007/978-1-4613-9575-1
10.48550/arXiv.2208.03518
10.1007/s10796-020-10066-9
ContentType Journal Article
Copyright The Author(s), under exclusive licence to Springer Nature B.V. 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
Copyright_xml – notice: The Author(s), under exclusive licence to Springer Nature B.V. 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
DBID AAYXX
CITATION
7SC
8FD
8FE
8FG
ABJCF
AFKRA
ARAPS
AZQEC
BENPR
BGLVJ
CCPQU
DWQXO
GNUQQ
HCIFZ
JQ2
K7-
L6V
L7M
L~C
L~D
M7S
P5Z
P62
PHGZM
PHGZT
PKEHL
PQEST
PQGLB
PQQKQ
PQUKI
PRINS
PTHSS
DOI 10.1007/s10817-023-09666-2
DatabaseName CrossRef
Computer and Information Systems Abstracts
Technology Research Database
ProQuest SciTech Collection
ProQuest Technology Collection
Materials Science & Engineering Collection
ProQuest Central UK/Ireland
Advanced Technologies & Computer Science Collection
ProQuest Central Essentials
ProQuest Central
Technology Collection
ProQuest One
ProQuest Central Korea
ProQuest Central Student
SciTech Premium Collection
ProQuest Computer Science Collection
Computer Science Database
ProQuest Engineering Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
Engineering Database
ProQuest advanced technologies & aerospace journals
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Premium
ProQuest One Academic (New)
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Applied & Life Sciences
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
Engineering Collection
DatabaseTitle CrossRef
Computer Science Database
ProQuest Central Student
Technology Collection
Technology Research Database
Computer and Information Systems Abstracts – Academic
ProQuest One Academic Middle East (New)
ProQuest Advanced Technologies & Aerospace Collection
ProQuest Central Essentials
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
SciTech Premium Collection
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Applied & Life Sciences
ProQuest Engineering Collection
ProQuest Central Korea
ProQuest Central (New)
Advanced Technologies Database with Aerospace
Engineering Collection
Advanced Technologies & Aerospace Collection
Engineering Database
ProQuest One Academic Eastern Edition
ProQuest Technology Collection
ProQuest SciTech Collection
Computer and Information Systems Abstracts Professional
Advanced Technologies & Aerospace Database
ProQuest One Academic UKI Edition
Materials Science & Engineering Collection
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList Computer Science Database

Database_xml – sequence: 1
  dbid: BENPR
  name: ProQuest Central
  url: https://www.proquest.com/central
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISSN 1573-0670
ExternalDocumentID 10_1007_s10817_023_09666_2
GroupedDBID -4Z
-59
-5G
-BR
-EM
-Y2
-~C
.86
.DC
.VR
06D
0R~
0VY
199
1N0
1SB
2.D
203
28-
29J
2J2
2JN
2JY
2KG
2LR
2P1
2VQ
2~H
30V
4.4
406
408
409
40D
40E
5GY
5QI
5VS
67Z
6NX
6TJ
78A
8FE
8FG
8TC
95-
95.
95~
96X
AAAVM
AABHQ
AACDK
AAHNG
AAIAL
AAJBT
AAJKR
AANZL
AAOBN
AARHV
AARTL
AASML
AATNV
AATVU
AAUYE
AAWCG
AAYIU
AAYQN
AAYTO
AAYZH
ABAKF
ABBBX
ABBXA
ABDZT
ABECU
ABFTD
ABFTV
ABHLI
ABHQN
ABJCF
ABJNI
ABJOX
ABKCH
ABKTR
ABMNI
ABMQK
ABNWP
ABQBU
ABQSL
ABSXP
ABTEG
ABTHY
ABTKH
ABTMW
ABULA
ABWNU
ABXPI
ACAOD
ACBXY
ACDTI
ACGFS
ACHSB
ACHXU
ACIWK
ACKNC
ACMDZ
ACMLO
ACNCT
ACOKC
ACOMO
ACPIV
ACZOJ
ADHHG
ADHIR
ADIMF
ADINQ
ADKNI
ADKPE
ADRFC
ADTPH
ADURQ
ADYFF
ADZKW
AEBTG
AEFIE
AEFQL
AEGAL
AEGNC
AEJHL
AEJRE
AEKMD
AEMSY
AENEX
AEOHA
AEPYU
AESKC
AETLH
AEVLU
AEXYK
AFBBN
AFEXP
AFGCZ
AFKRA
AFLOW
AFQWF
AFWTZ
AFZKB
AGAYW
AGDGC
AGGDS
AGJBK
AGMZJ
AGQEE
AGQMX
AGRTI
AGWIL
AGWZB
AGYKE
AHAVH
AHBYD
AHKAY
AHSBF
AHYZX
AIAKS
AIGIU
AIIXL
AILAN
AITGF
AJBLW
AJRNO
AJZVZ
ALMA_UNASSIGNED_HOLDINGS
ALWAN
AMKLP
AMXSW
AMYLF
AMYQR
AOCGG
ARAPS
ARMRJ
ASPBG
AVWKF
AXYYD
AYJHY
AZFZN
B-.
BA0
BBWZM
BDATZ
BENPR
BGLVJ
BGNMA
BSONS
CAG
CCPQU
COF
CS3
CSCUP
DDRTE
DL5
DNIVK
DPUIP
DU5
EBLON
EBS
EIOEI
EJD
ESBYG
FEDTE
FERAY
FFXSO
FIGPU
FINBP
FNLPD
FRRFC
FSGXE
FWDCC
GGCAI
GGRSB
GJIRD
GNWQR
GQ6
GQ7
GQ8
GXS
H13
HCIFZ
HF~
HG5
HG6
HMJXF
HQYDN
HRMNR
HVGLF
HZ~
I09
IHE
IJ-
IKXTQ
ITM
IWAJR
IXC
IZIGR
IZQ
I~X
I~Z
J-C
J0Z
JBSCW
JCJTX
JZLTJ
K6V
K7-
KDC
KOV
KOW
L6V
LAK
LLZTM
M4Y
M7S
MA-
N2Q
N9A
NB0
NDZJH
NPVJJ
NQJWS
NU0
O9-
O93
O9G
O9I
O9J
OAM
OVD
P19
P2P
P62
P9O
PF0
PT4
PT5
PTHSS
QOK
QOS
R4E
R89
R9I
RHV
RNI
RNS
ROL
RPX
RSV
RZC
RZE
RZK
S16
S1Z
S26
S27
S28
S3B
SAP
SCJ
SCLPG
SCO
SDH
SDM
SHX
SISQX
SJYHP
SNE
SNPRN
SNX
SOHCF
SOJ
SPISZ
SRMVM
SSLCW
STPWE
SZN
T13
T16
TEORI
TN5
TSG
TSK
TSV
TUC
U2A
UG4
UOJIU
UTJUX
UZXMN
VC2
VFIZW
VXZ
W23
W48
WH7
WK8
YLTOR
Z45
Z7R
Z7X
Z83
Z88
Z8M
Z8R
Z8W
Z92
ZMTXR
~EX
AAPKM
AAYXX
ABBRH
ABDBE
ABFSG
ABRTQ
ACSTC
ADHKG
ADKFA
AEZWR
AFDZB
AFFHD
AFHIU
AFOHR
AGQPQ
AHPBZ
AHWEU
AIXLP
ATHPR
AYFIA
CITATION
PHGZM
PHGZT
PQGLB
7SC
8FD
AZQEC
DWQXO
GNUQQ
JQ2
L7M
L~C
L~D
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c319t-f056faaecb463bcb5940ec0d62e09f5bd9508e465038f6077b28c1ab2eefab1a3
IEDL.DBID RSV
ISICitedReferencesCount 4
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000988486700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0168-7433
IngestDate Wed Nov 05 01:30:29 EST 2025
Tue Nov 18 21:06:44 EST 2025
Sat Nov 29 05:55:14 EST 2025
Fri Feb 21 02:43:34 EST 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords Automated proof
Coq
Security properties
Android
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c319t-f056faaecb463bcb5940ec0d62e09f5bd9508e465038f6077b28c1ab2eefab1a3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
PQID 2812890172
PQPubID 2028908
ParticipantIDs proquest_journals_2812890172
crossref_primary_10_1007_s10817_023_09666_2
crossref_citationtrail_10_1007_s10817_023_09666_2
springer_journals_10_1007_s10817_023_09666_2
PublicationCentury 2000
PublicationDate 20230600
2023-06-00
20230601
PublicationDateYYYYMMDD 2023-06-01
PublicationDate_xml – month: 6
  year: 2023
  text: 20230600
PublicationDecade 2020
PublicationPlace Dordrecht
PublicationPlace_xml – name: Dordrecht
PublicationTitle Journal of automated reasoning
PublicationTitleAbbrev J Autom Reasoning
PublicationYear 2023
Publisher Springer Netherlands
Springer Nature B.V
Publisher_xml – name: Springer Netherlands
– name: Springer Nature B.V
References CristiáMRossiGAn automatically verified prototype of the Tokeneer ID station specificationJ. Autom. Reason.202165811251151433042210.1007/s10817-021-09602-207461267
Cristiá, M., Rossi, G., Frydman, C.S.: {log}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{log\}$$\end{document} as a test case generator for the Test Template Framework. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM. Lecture Notes in Computer Science, vol. 8137, pp. 229–243. Springer, Berlin (2013)
Open Handset Alliance: Android Project. https://source.android.com. Accessed Jan 2023
The Coq Team: The Coq Proof Assistant Reference Manual—Version V8.12.0. LogiCal Project, Palaiseau, France (2020). LogiCal Project. http://coq.inria.fr
BagheriHKangEMalekSJacksonDA formal approach for detection of security flaws in the android permission systemFormal Aspects Comput.201830552554410.1007/s00165-017-0445-z
Cristiá, M., Rossi, G.: An automatically verified prototype of a landing gear system (2021). CoRR arXiv:2112.15147
KhanWUllahHAhmadASultanKAlzahraniAJKhanSDAlhumaidMAbdulazizSCrashsafe: a formal model for proving crash-safety of android applicationsHum. Centric Comput. Inf. Sci.201882110.1186/s13673-018-0144-7
Chlipala, A.: Certified Programming with Dependent Types—A Pragmatic Introduction to the Coq Proof Assistant. MIT Press. http://mitpress.mit.edu/books/certified-programming-dependent-types
De Luca, G., Luna, C.: Towards a certified reference monitor of the Android 10 permission system. In: de’Liguoro, U., Berardi, S., Altenkirch, T. (eds.) 26th International Conference on Types for Proofs and Programs, TYPES 2020, March 2–5, 2020, University of Turin, Italy. LIPIcs, vol. 188, pp. 3–1318. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.TYPES.2020.3
CzajkaLKaliszykCHammer for Coq: automation for dependent type theoryJ. Autom. Reason.2018611–4423453380650510.1007/s10817-018-9458-41448.68458
Android Developers: Application Fundamentals. http://developer.android.com/guide/components/fundamentals.html. Accessed Jan 2023
Shin, W., Kiyomoto, S., Fukushima, K., Tanaka, T.: A formal model to analyze the permission authorization and enforcement in the Android framework. In: Elmagarmid, A.K., Agrawal, D. (eds.) Proceedings of the 2010 IEEE Second International Conference on Social Computing, SocialCom/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010, Minneapolis, Minnesota, USA, August 20-22, 2010, pp. 944–951. IEEE Computer Society (2010). https://doi.org/10.1109/SocialCom.2010.140
Luca, G.D., Luna, C.: Formal verification of the security model of Android 10: Coq code. https://github.com/g-deluca/android-coq-model. Accessed Jan 2023
Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., Schonberg, E.: Programming with sets—an introduction to SETL. In: Texts and Monographs in Computer Science. Springer, New York (1986). https://doi.org/10.1007/978-1-4613-9575-1
AbrialJ-RThe B-Book: Assigning Programs to Meanings1996New YorkCambridge University Press10.1017/CBO97805116241620915.68015
Cristiá, M., Rossi, G.: A set solver for finite set relation algebra. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) Relational and Algebraic Methods in Computer Science—17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29–November 1, 2018. Proceedings of Lecture Notes in Computer Science, vol. 11194, pp. 333–349. Springer, Berlin (2018). https://doi.org/10.1007/978-3-030-02149-8_20
Rossi, G.: {log}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{log\}$$\end{document}. Accessed 2022
Cristiá, M., Rossi, G.: Integrating cardinality constraints into constraint logic programming with sets. Theory Pract Logic Program 1–33 (2021)
BlanchetteJCBöhmeSPaulsonLCExtending sledgehammer with SMT solversJ. Autom. Reason.2013511109128306348510.1007/s10817-013-9278-51314.68272
DovierAPiazzaCPontelliERossiGSets and constraint logic programmingACM Trans. Program. Lang. Syst.200022586193110.1145/365151.365169
Sbirlea, D., Burke, M.G., Guarnieri, S., Pistoia, M., Sarkar, V.: Automatic detection of inter-application permission leaks in Android applications. IBM J. Res. Dev.57(6). https://doi.org/10.1147/JRD.2013.2284403
CristiáMRossiGSolving quantifier-free first-order constraints over finite sets and binary relationsJ. Autom. Reason.2020642295330405843510.1007/s10817-019-09520-41468.03009
MammarALaleauRModeling a landing gear system in Event-BInt. J. Softw. Tools Technol. Transf.201719216718610.1007/s10009-015-0391-0
Cristiá, M., Rossi, G.: A set-theoretic decision procedure for quantifier-free, decidable languages extended with restricted quantifiers. CoRR abs/2208.03518 (2022). https://doi.org/10.48550/arXiv.2208.03518. Under consideration in Journal of Automated Reasoning
BetarteGCampoJDLunaCRomanoAFormal analysis of Android’s permission-based security modelSci. Ann. Comput. Sci.20162612768357095110.7561/SACS.2016.1.271424.68029
International Data Corporation: Smartphone market share. Technical report, International Data Corporation (IDC) (2022)
Bell, D.E., LaPadula, L.: Secure computer systems: mathematical model. ESD-TR 73-278, The MITRE Corporation (November 1973)
Leino, K.R.M.: Dafny: An automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning—16th International Conference, LPAR-16, Dakar, Senegal, April 25–May 1, 2010, Revised Selected Papers. Lecture Notes in Computer Science, vol. 6355, pp. 348–370. Springer, (2010). https://doi.org/10.1007/978-3-642-17511-4_20. https://doi.org/10.1007/978-3-642-17511-4_20
Cristiá, M., Rossi, G.: A decision procedure for a theory of finite sets with finite integer intervals. CoRR abs/2105.03005 (2021)
Cantone, D., Omodeo, E.G., Policriti, A.: Set theory for computing - from decision procedures to declarative programming with sets. In: Monographs in Computer Science. Springer, Berlin (2001). https://doi.org/10.1007/978-1-4757-3452-2
Chin, E., Felt, A.P., Greenwood, K., Wagner, D.A.: Analyzing inter-application communication in android. In: Agrawala, A.K., Corner, M.D., Wetherall, D. (eds.) Proceedings of the 9th International Conference on Mobile Systems, Applications, and Services (MobiSys 2011), Bethesda, MD, USA, June 28 - July 01, 2011, pp. 239–252. ACM (2011). https://doi.org/10.1145/1999995.2000018
CoquandTHuetGPThe calculus of constructionsInf. Comput.1988762/39512093589210.1016/0890-5401(88)90005-30654.03045
Boniol, F., Wiels, V.: The landing gear system case study. In: Boniol, F., Wiels, V., Ameur, Y.A., Schewe, K. (eds.) ABZ 2014: The Landing Gear Case Study—Case Study Track, Held at the 4th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, Toulouse, France, June 2–6, 2014. Proceedings. Communications in Computer and Information Science, vol. 433, pp. 1–18. Springer, Berlin (2014). https://doi.org/10.1007/978-3-319-07512-9_1
Betarte, G., Campo, J.D., Gorostiaga, F., Luna, C.: A certified reference validation mechanism for the permission model of Android. In: Fioravanti, F., Gallagher, J.P. (eds.) Logic-Based Program Synthesis and Transformation—27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10855, pp. 271–288. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-94460-9_16
Betarte, G., Campo, J.D., Luna, C.D., Romano, A.: Verifying Android’s permission model. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) Theoretical aspects of computing—ICTAC 2015—12th international colloquium Cali, Colombia, October 29–31, 2015. In: Proceedings. Lecture Notes in Computer Science, vol. 9399, pp. 485–504. Springer, Berlin (2015). https://doi.org/10.1007/978-3-319-25150-9_28
Bell, D.E., LaPadula, L.: Secure computer systems: mathematical foundations. MTR 2547, The MITRE Corporation (May 1973)
CantoneDFerroAOmodeoEComputable Set Theory1989OxfordClarendon Press0755.03024
Micinski, K.K., Fetter-Degges, J., Jeon, J., Foster, J.S., Clarkson, M.R.: Checking interaction-based declassification policies for android using symbolic execution. In: Pernul, G., Ryan, P.Y.A., Weippl, E.R. (eds.) Computer Security—ESORICS 2015—20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9327, pp. 520–538. Springer, Berlin (2015). https://doi.org/10.1007/978-3-319-24177-7_26
Sadeghi, A., Jabbarvand, R., Ghorbani, N., Bagheri, H., Malek, S.: A temporal permission analysis and enforcement framework for android. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, May 27–June 03, 2018, pp. 846–857. ACM (2018). https://doi.org/10.1145/3180155.3180172
Hawblitzel, C., Howell, J., Kapritsos, M., Lorch, J.R., Parno, B., Roberts, M.L., Setty, S.T.V., Zill, B.: Ironfleet: proving practical distributed systems correct. In: Miller, E.L., Hand, S. (eds.) Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015, Monterey, CA, USA, October 4-7, 2015, pp. 1–17. ACM (2015). https://doi.org/10.1145/2815400.2815428
CristiáMRossiGAutomated reasoning with restricted intensional setsJ. Autom. Reason.2021656809890427729710.1007/s10817-021-09589-w07432188
Coleman, J., Jones, C., Oliver, I., Romanovsky, A., E.Troubitsyna: RODIN (Rigorous open Development Environment for Complex Systems). In: Fifth European Dependable Computing Conference: EDCC-5 Supplementary Volume, pp. 23–26 (2005)
Fragkaki, E., Bauer, L., Jia, L., Swa
M Cristiá (9666_CR26) 2021; 65
T Coquand (9666_CR18) 1988; 76
9666_CR27
9666_CR28
A Mammar (9666_CR41) 2017; 19
9666_CR21
9666_CR22
9666_CR23
S Talegaon (9666_CR51) 2021; 23
9666_CR30
H Bagheri (9666_CR3) 2018; 30
L Czajka (9666_CR29) 2018; 61
J-R Abrial (9666_CR1) 1996
D Cantone (9666_CR12) 1989
9666_CR36
9666_CR38
9666_CR39
9666_CR33
9666_CR34
9666_CR35
9666_CR40
9666_CR42
M Cristiá (9666_CR24) 2021; 65
A Dovier (9666_CR31) 2000; 22
M Cristiá (9666_CR20) 2020; 64
9666_CR47
G Betarte (9666_CR8) 2016; 26
9666_CR48
9666_CR49
9666_CR43
9666_CR44
9666_CR45
9666_CR46
9666_CR50
9666_CR52
MA El-Zawawy (9666_CR32) 2022; 104
W Khan (9666_CR37) 2018; 8
M Cristiá (9666_CR25) 2021; 65
9666_CR19
9666_CR9
JC Blanchette (9666_CR10) 2013; 51
9666_CR7
9666_CR14
9666_CR15
9666_CR5
9666_CR16
9666_CR6
9666_CR17
9666_CR4
9666_CR11
9666_CR2
9666_CR13
References_xml – reference: Bell, D.E., LaPadula, L.: Secure computer systems: mathematical foundations. MTR 2547, The MITRE Corporation (May 1973)
– reference: BagheriHKangEMalekSJacksonDA formal approach for detection of security flaws in the android permission systemFormal Aspects Comput.201830552554410.1007/s00165-017-0445-z
– reference: Hawblitzel, C., Howell, J., Kapritsos, M., Lorch, J.R., Parno, B., Roberts, M.L., Setty, S.T.V., Zill, B.: Ironfleet: proving practical distributed systems correct. In: Miller, E.L., Hand, S. (eds.) Proceedings of the 25th Symposium on Operating Systems Principles, SOSP 2015, Monterey, CA, USA, October 4-7, 2015, pp. 1–17. ACM (2015). https://doi.org/10.1145/2815400.2815428
– reference: Chin, E., Felt, A.P., Greenwood, K., Wagner, D.A.: Analyzing inter-application communication in android. In: Agrawala, A.K., Corner, M.D., Wetherall, D. (eds.) Proceedings of the 9th International Conference on Mobile Systems, Applications, and Services (MobiSys 2011), Bethesda, MD, USA, June 28 - July 01, 2011, pp. 239–252. ACM (2011). https://doi.org/10.1145/1999995.2000018
– reference: CoquandTHuetGPThe calculus of constructionsInf. Comput.1988762/39512093589210.1016/0890-5401(88)90005-30654.03045
– reference: Leino, K.R.M.: Dafny: An automatic program verifier for functional correctness. In: Clarke, E.M., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning—16th International Conference, LPAR-16, Dakar, Senegal, April 25–May 1, 2010, Revised Selected Papers. Lecture Notes in Computer Science, vol. 6355, pp. 348–370. Springer, (2010). https://doi.org/10.1007/978-3-642-17511-4_20. https://doi.org/10.1007/978-3-642-17511-4_20
– reference: Betarte, G., Campo, J.D., Luna, C.D., Romano, A.: Verifying Android’s permission model. In: Leucker, M., Rueda, C., Valencia, F.D. (eds.) Theoretical aspects of computing—ICTAC 2015—12th international colloquium Cali, Colombia, October 29–31, 2015. In: Proceedings. Lecture Notes in Computer Science, vol. 9399, pp. 485–504. Springer, Berlin (2015). https://doi.org/10.1007/978-3-319-25150-9_28
– reference: Letouzey, P.: Programmation fonctionnelle certifiée – l’extraction de programmes dans l’assistant Coq. PhD thesis, Université Paris-Sud (July 2004)
– reference: The Coq Team: The Coq Proof Assistant Reference Manual—Version V8.12.0. LogiCal Project, Palaiseau, France (2020). LogiCal Project. http://coq.inria.fr
– reference: International Data Corporation: Smartphone market share. Technical report, International Data Corporation (IDC) (2022)
– reference: TalegaonSKrishnanRA formal specification of access control in android with URI permissionsInf. Syst. Front.202123484986610.1007/s10796-020-10066-9
– reference: Fragkaki, E., Bauer, L., Jia, L., Swasey, D.: Modeling and enhancing android’s permission system. In: Foresti, S., Yung, M., Martinelli, F. (eds.) Computer Security - ESORICS 2012 - 17th European Symposium on Research in Computer Security, Pisa, Italy, September 10–12, 2012. Proceedings. Lecture Notes in Computer Science, vol. 7459, pp. 1–18. Springer, Berlin (2012). https://doi.org/10.1007/978-3-642-33167-1_1
– reference: BetarteGCampoJDLunaCRomanoAFormal analysis of Android’s permission-based security modelSci. Ann. Comput. Sci.20162612768357095110.7561/SACS.2016.1.271424.68029
– reference: Sadeghi, A., Jabbarvand, R., Ghorbani, N., Bagheri, H., Malek, S.: A temporal permission analysis and enforcement framework for android. In: Chaudron, M., Crnkovic, I., Chechik, M., Harman, M. (eds.) Proceedings of the 40th International Conference on Software Engineering, ICSE 2018, Gothenburg, Sweden, May 27–June 03, 2018, pp. 846–857. ACM (2018). https://doi.org/10.1145/3180155.3180172
– reference: Micinski, K.K., Fetter-Degges, J., Jeon, J., Foster, J.S., Clarkson, M.R.: Checking interaction-based declassification policies for android using symbolic execution. In: Pernul, G., Ryan, P.Y.A., Weippl, E.R. (eds.) Computer Security—ESORICS 2015—20th European Symposium on Research in Computer Security, Vienna, Austria, September 21-25, 2015, Proceedings, Part II. Lecture Notes in Computer Science, vol. 9327, pp. 520–538. Springer, Berlin (2015). https://doi.org/10.1007/978-3-319-24177-7_26
– reference: Shin, W., Kiyomoto, S., Fukushima, K., Tanaka, T.: A formal model to analyze the permission authorization and enforcement in the Android framework. In: Elmagarmid, A.K., Agrawal, D. (eds.) Proceedings of the 2010 IEEE Second International Conference on Social Computing, SocialCom/IEEE International Conference on Privacy, Security, Risk and Trust, PASSAT 2010, Minneapolis, Minnesota, USA, August 20-22, 2010, pp. 944–951. IEEE Computer Society (2010). https://doi.org/10.1109/SocialCom.2010.140
– reference: CantoneDFerroAOmodeoEComputable Set Theory1989OxfordClarendon Press0755.03024
– reference: CristiáMRossiGAutomated proof of Bell-LaPadula security propertiesJ. Autom. Reason.2021654463478423356310.1007/s10817-020-09577-607356979
– reference: CristiáMRossiGAutomated reasoning with restricted intensional setsJ. Autom. Reason.2021656809890427729710.1007/s10817-021-09589-w07432188
– reference: Android Developers: Application Fundamentals. http://developer.android.com/guide/components/fundamentals.html. Accessed Jan 2023
– reference: Schwartz, J.T., Dewar, R.B.K., Dubinsky, E., Schonberg, E.: Programming with sets—an introduction to SETL. In: Texts and Monographs in Computer Science. Springer, New York (1986). https://doi.org/10.1007/978-1-4613-9575-1
– reference: Betarte, G., Campo, J.D., Gorostiaga, F., Luna, C.: A certified reference validation mechanism for the permission model of Android. In: Fioravanti, F., Gallagher, J.P. (eds.) Logic-Based Program Synthesis and Transformation—27th International Symposium, LOPSTR 2017, Namur, Belgium, October 10-12, 2017, Revised Selected Papers. Lecture Notes in Computer Science, vol. 10855, pp. 271–288. Springer, Berlin (2017). https://doi.org/10.1007/978-3-319-94460-9_16
– reference: DovierAPiazzaCPontelliERossiGSets and constraint logic programmingACM Trans. Program. Lang. Syst.200022586193110.1145/365151.365169
– reference: Rossi, G.: {log}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{log\}$$\end{document}. Accessed 2022
– reference: Boniol, F., Wiels, V.: The landing gear system case study. In: Boniol, F., Wiels, V., Ameur, Y.A., Schewe, K. (eds.) ABZ 2014: The Landing Gear Case Study—Case Study Track, Held at the 4th International Conference on Abstract State Machines, Alloy, B, TLA, VDM, and Z, Toulouse, France, June 2–6, 2014. Proceedings. Communications in Computer and Information Science, vol. 433, pp. 1–18. Springer, Berlin (2014). https://doi.org/10.1007/978-3-319-07512-9_1
– reference: Jackson, D.: Alloy: A logical modelling language. In: Bert, D., Bowen, J.P., King, S., Waldén, M.A. (eds.) ZB 2003: Formal Specification and Development in Z and B, Third International Conference of B and Z Users, Turku, Finland, June 4-6, 2003, Proceedings. Lecture Notes in Computer Science, vol. 2651, p. 1. Springer, Berlin (2003). https://doi.org/10.1007/3-540-44880-2_1
– reference: Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall International (UK) Ltd., Hertfordshire (1992)
– reference: AbrialJ-RThe B-Book: Assigning Programs to Meanings1996New YorkCambridge University Press10.1017/CBO97805116241620915.68015
– reference: BlanchetteJCBöhmeSPaulsonLCExtending sledgehammer with SMT solversJ. Autom. Reason.2013511109128306348510.1007/s10817-013-9278-51314.68272
– reference: Bertot, Y., Castéran, P.: Interactive Theorem Proving and Program Development—Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2004). https://doi.org/10.1007/978-3-662-07964-5
– reference: Cantone, D., Omodeo, E.G., Policriti, A.: Set theory for computing - from decision procedures to declarative programming with sets. In: Monographs in Computer Science. Springer, Berlin (2001). https://doi.org/10.1007/978-1-4757-3452-2
– reference: Sbirlea, D., Burke, M.G., Guarnieri, S., Pistoia, M., Sarkar, V.: Automatic detection of inter-application permission leaks in Android applications. IBM J. Res. Dev.57(6). https://doi.org/10.1147/JRD.2013.2284403
– reference: Bell, D.E., LaPadula, L.: Secure computer systems: mathematical model. ESD-TR 73-278, The MITRE Corporation (November 1973)
– reference: Cristiá, M., Rossi, G.: An automatically verified prototype of a landing gear system (2021). CoRR arXiv:2112.15147
– reference: Cristiá, M., Rossi, G.: A set-theoretic decision procedure for quantifier-free, decidable languages extended with restricted quantifiers. CoRR abs/2208.03518 (2022). https://doi.org/10.48550/arXiv.2208.03518. Under consideration in Journal of Automated Reasoning
– reference: Cristiá, M., Rossi, G.: A decision procedure for a theory of finite sets with finite integer intervals. CoRR abs/2105.03005 (2021)
– reference: Chlipala, A.: Certified Programming with Dependent Types—A Pragmatic Introduction to the Coq Proof Assistant. MIT Press. http://mitpress.mit.edu/books/certified-programming-dependent-types
– reference: Cristiá, M., Rossi, G., Frydman, C.S.: {log}\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\{log\}$$\end{document} as a test case generator for the Test Template Framework. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM. Lecture Notes in Computer Science, vol. 8137, pp. 229–243. Springer, Berlin (2013)
– reference: Coleman, J., Jones, C., Oliver, I., Romanovsky, A., E.Troubitsyna: RODIN (Rigorous open Development Environment for Complex Systems). In: Fifth European Dependable Computing Conference: EDCC-5 Supplementary Volume, pp. 23–26 (2005)
– reference: Paulin-Mohring, C.: Inductive definitions in the system coq - rules and properties. In: Bezem, M., Groote, J.F. (eds.) Typed Lambda Calculi and Applications, International Conference on Typed Lambda Calculi and Applications, TLCA ’93, Utrecht, The Netherlands, March 16-18, 1993, Proceedings. Lecture Notes in Computer Science, vol. 664, pp. 328–345. Springer, Berlin (1993). https://doi.org/10.1007/BFb0037116
– reference: Open Handset Alliance: Android Project. https://source.android.com. Accessed Jan 2023
– reference: CristiáMRossiGAn automatically verified prototype of the Tokeneer ID station specificationJ. Autom. Reason.202165811251151433042210.1007/s10817-021-09602-207461267
– reference: CzajkaLKaliszykCHammer for Coq: automation for dependent type theoryJ. Autom. Reason.2018611–4423453380650510.1007/s10817-018-9458-41448.68458
– reference: KhanWUllahHAhmadASultanKAlzahraniAJKhanSDAlhumaidMAbdulazizSCrashsafe: a formal model for proving crash-safety of android applicationsHum. Centric Comput. Inf. Sci.201882110.1186/s13673-018-0144-7
– reference: Luca, G.D., Luna, C.: Formal verification of the security model of Android 10: Coq code. https://github.com/g-deluca/android-coq-model. Accessed Jan 2023
– reference: De Luca, G., Luna, C.: Towards a certified reference monitor of the Android 10 permission system. In: de’Liguoro, U., Berardi, S., Altenkirch, T. (eds.) 26th International Conference on Types for Proofs and Programs, TYPES 2020, March 2–5, 2020, University of Turin, Italy. LIPIcs, vol. 188, pp. 3–1318. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2020). https://doi.org/10.4230/LIPIcs.TYPES.2020.3
– reference: Cristiá, M., Rossi, G.: A set solver for finite set relation algebra. In: Desharnais, J., Guttmann, W., Joosten, S. (eds.) Relational and Algebraic Methods in Computer Science—17th International Conference, RAMiCS 2018, Groningen, The Netherlands, October 29–November 1, 2018. Proceedings of Lecture Notes in Computer Science, vol. 11194, pp. 333–349. Springer, Berlin (2018). https://doi.org/10.1007/978-3-030-02149-8_20
– reference: Common Criteria Recognition Arrangement: common criteria for information technology security evaluation, part 1: introduction and general model, version 3.1. release 5. Technical report (2017). https://www.commoncriteriaportal.org/files/ccfiles/CCPART1V3.1R5.pdf
– reference: CristiáMRossiGSolving quantifier-free first-order constraints over finite sets and binary relationsJ. Autom. Reason.2020642295330405843510.1007/s10817-019-09520-41468.03009
– reference: Cristiá, M., Rossi, G.: Integrating cardinality constraints into constraint logic programming with sets. Theory Pract Logic Program 1–33 (2021)
– reference: El-ZawawyMAFarukiPContiMFormal model for inter-component communication and its security in androidComputing202210481839186510.1007/s00607-022-01069-2
– reference: MammarALaleauRModeling a landing gear system in Event-BInt. J. Softw. Tools Technol. Transf.201719216718610.1007/s10009-015-0391-0
– ident: 9666_CR21
  doi: 10.21203/rs.3.rs-2088594/v1
– volume: 65
  start-page: 1125
  issue: 8
  year: 2021
  ident: 9666_CR26
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-021-09602-2
– volume: 30
  start-page: 525
  issue: 5
  year: 2018
  ident: 9666_CR3
  publication-title: Formal Aspects Comput.
  doi: 10.1007/s00165-017-0445-z
– ident: 9666_CR14
  doi: 10.1145/1999995.2000018
– ident: 9666_CR2
– ident: 9666_CR36
  doi: 10.1007/3-540-44880-2_1
– ident: 9666_CR43
– ident: 9666_CR17
– volume: 51
  start-page: 109
  issue: 1
  year: 2013
  ident: 9666_CR10
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-013-9278-5
– ident: 9666_CR6
  doi: 10.1007/978-3-662-07964-5
– ident: 9666_CR19
  doi: 10.1007/978-3-030-02149-8_20
– ident: 9666_CR30
  doi: 10.4230/LIPIcs.TYPES.2020.3
– ident: 9666_CR40
– volume-title: The B-Book: Assigning Programs to Meanings
  year: 1996
  ident: 9666_CR1
  doi: 10.1017/CBO9780511624162
– ident: 9666_CR5
– volume: 19
  start-page: 167
  issue: 2
  year: 2017
  ident: 9666_CR41
  publication-title: Int. J. Softw. Tools Technol. Transf.
  doi: 10.1007/s10009-015-0391-0
– ident: 9666_CR50
– volume: 76
  start-page: 95
  issue: 2/3
  year: 1988
  ident: 9666_CR18
  publication-title: Inf. Comput.
  doi: 10.1016/0890-5401(88)90005-3
– ident: 9666_CR9
  doi: 10.1007/978-3-319-94460-9_16
– ident: 9666_CR16
– volume: 61
  start-page: 423
  issue: 1–4
  year: 2018
  ident: 9666_CR29
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-018-9458-4
– volume: 26
  start-page: 27
  issue: 1
  year: 2016
  ident: 9666_CR8
  publication-title: Sci. Ann. Comput. Sci.
  doi: 10.7561/SACS.2016.1.27
– ident: 9666_CR35
– ident: 9666_CR34
  doi: 10.1145/2815400.2815428
– ident: 9666_CR38
  doi: 10.1007/978-3-642-17511-4_20
– volume-title: Computable Set Theory
  year: 1989
  ident: 9666_CR12
– volume: 104
  start-page: 1839
  issue: 8
  year: 2022
  ident: 9666_CR32
  publication-title: Computing
  doi: 10.1007/s00607-022-01069-2
– ident: 9666_CR49
  doi: 10.1109/SocialCom.2010.140
– ident: 9666_CR23
  doi: 10.1017/S1471068421000521
– ident: 9666_CR4
– volume: 64
  start-page: 295
  issue: 2
  year: 2020
  ident: 9666_CR20
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-019-09520-4
– ident: 9666_CR33
  doi: 10.1007/978-3-642-33167-1_1
– ident: 9666_CR28
  doi: 10.1007/978-3-642-40561-7_16
– ident: 9666_CR11
  doi: 10.1007/978-3-319-07512-9_1
– ident: 9666_CR22
– ident: 9666_CR7
  doi: 10.1007/978-3-319-25150-9_28
– ident: 9666_CR45
– volume: 65
  start-page: 809
  issue: 6
  year: 2021
  ident: 9666_CR24
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-021-09589-w
– ident: 9666_CR46
  doi: 10.1145/3180155.3180172
– ident: 9666_CR15
– ident: 9666_CR44
  doi: 10.1007/BFb0037116
– ident: 9666_CR42
  doi: 10.1007/978-3-319-24177-7_26
– ident: 9666_CR47
  doi: 10.1147/JRD.2013.2284403
– volume: 22
  start-page: 861
  issue: 5
  year: 2000
  ident: 9666_CR31
  publication-title: ACM Trans. Program. Lang. Syst.
  doi: 10.1145/365151.365169
– volume: 65
  start-page: 463
  issue: 4
  year: 2021
  ident: 9666_CR25
  publication-title: J. Autom. Reason.
  doi: 10.1007/s10817-020-09577-6
– volume: 8
  start-page: 21
  year: 2018
  ident: 9666_CR37
  publication-title: Hum. Centric Comput. Inf. Sci.
  doi: 10.1186/s13673-018-0144-7
– ident: 9666_CR52
– ident: 9666_CR13
  doi: 10.1007/978-1-4757-3452-2
– ident: 9666_CR39
– ident: 9666_CR48
  doi: 10.1007/978-1-4613-9575-1
– ident: 9666_CR27
  doi: 10.48550/arXiv.2208.03518
– volume: 23
  start-page: 849
  issue: 4
  year: 2021
  ident: 9666_CR51
  publication-title: Inf. Syst. Front.
  doi: 10.1007/s10796-020-10066-9
SSID ssj0003109
Score 2.3779564
Snippet In a previous work we presented formal specifications of idealized formulations of the permission model of Android in the Coq proof assistant. This formal...
SourceID proquest
crossref
springer
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 17
SubjectTerms Access control
Algorithms
Artificial Intelligence
Automation
Coding
Computer Science
Formal specifications
Linux
Logic programming
Mathematical Logic and Formal Languages
Mathematical Logic and Foundations
Programming languages
Prototypes
Symbolic and Algebraic Manipulation
SummonAdditionalLinks – databaseName: Engineering Database
  dbid: M7S
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1NS8MwGA46PXhxfuJ0Sg7eNNgmbZqeZMiGBxkDP9itJGkCg9HOrRP89yZpuqKgF89pQ8j7mTdvngeA60AywgIiEMNCoijUBLE8D1CaYp5QmnIsHLr-UzIes-k0nfiC28q3VTY-0TnqvJS2Rn6HTSRiqT2x3C_ekWWNsrernkJjG-xYlITQte49bzyxRb2ssb0tZiYh_tGMfzrHjH82EQuZJJ5ShL8Hpjbb_HFB6uLOqPvfFR-AfZ9xwkGtIodgSxVHoNuwOUBv3MdgOCjgYF2VDsOVz-ef8M1opzYpKpwsy6q0xVpYamgyRmjbIMuZGbCtNLaPtljBGvv8BLyOhi8Pj8iTLCBprK9C2mRAmnMlRUSJkCJOo0DJIKdYBamORW5pYlVELWyMpkGSCMxkyAVWSnMRcnIKOkVZqDMAJREiJlFihmlktp6Z86-MZS6SQGsa0h4Imx3OpEcgt0QY86zFTrZSyYxUMieVDPfAzeafRY2_8efX_UYUmbfFVdbKoQduG2G2w7_Pdv73bBdgDzv9sSWZPuhUy7W6BLvyo5qtlldOE78AmajiVQ
  priority: 102
  providerName: ProQuest
Title An Automatically Verified Prototype of the Android Permissions System
URI https://link.springer.com/article/10.1007/s10817-023-09666-2
https://www.proquest.com/docview/2812890172
Volume 67
WOSCitedRecordID wos000988486700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAVX
  databaseName: SpringerLINK Contemporary 1997-Present
  customDbUrl:
  eissn: 1573-0670
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0003109
  issn: 0168-7433
  databaseCode: RSV
  dateStart: 19970101
  isFulltext: true
  titleUrlDefault: https://link.springer.com/search?facet-content-type=%22Journal%22
  providerName: Springer Nature
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1LS8QwEB58Hbz4FlfXJQdvGmiTNk2Pq-wiKMviY1m8lCZNQFha2a2C_95Jt3VVVNBLL3lQJpmZL8nMNwAnnpZcelxRyZSmgW85lVnm0ThmaSREnDJVsetfR4OBHI_jYZ0UNmui3ZsnycpSf0h2k2hR0cdQhN1CUDS8q-jupCvYcHM7ere_jutyzujtmDI5r1Nlvp_jsztaYMwvz6KVt-lv_u8_t2CjRpekO98O27Bk8h3YbCo3kFqRd6HXzUn3uSwqvtZ0MnklI9yJFuEoGU6LsnAXs6SwBNEhcSGPxSM2uLAZFzObz8ic53wP7vu9u4tLWhdUoBo1raQW0Y5NU6NVILjSKowDz2gvE8x4sQ1V5krCmkA4ihgrvChSTGo_VcwYmyo_5fuwkhe5OQCiuVIhDyJsFgEKXOJZV4c6U5FnrfBFC_xGromu2cZd0YtJsuBJdnJKUE5JJaeEteD0fczTnGvj197tZrmSWu9mCUO8ImN3rm3BWbM8i-afZzv8W_cjWGfVCrvrmDaslNNncwxr-qV8nE07sHreGwxvOrB8FdGOCye9xe8wfOhUO_UNztbcyA
linkProvider Springer Nature
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1LT9wwEB5RqFQuhb7ULS8f4NRaTeys4xwQWvEQaLcrDlBxS2PHlpBWCeyGVvwpfiMzebCiEtw4cHZiKZlvXvbMNwDbgdVSB9JwLYzlUegl13ke8CQRWaxUkglTs-uP4vFYX1wkpwtw1_XCUFllZxNrQ52Xls7Ifwr0RDqhjGXv6prT1Ci6Xe1GaDSwGLrbf5iyzXZPDlC-O0IcHZ7tH_N2qgC3CLeKe3T5PsucNZGSxpp-EgXOBrkSLkh83-Q0F9VFinhSvAri2Ahtw8wI53xmwkzivm9gKZI6Jr0axvzB8hPLZsMlThydUrZNOm2rnkZ_gB6SY9KgFBePHeE8uv3vQrb2c0crr-0PrcL7NqJmg0YFPsCCKz7CSjetgrXG6xMcDgo2uKnKmqM2m0xu2W_UPo8hODudllVJh9Gs9AwjYkZlnuUlLlCpENUJFzPWcLt_hvMX-ZgvsFiUhfsKzEpj-jKKcVlFKGqN-b3t29zEgfcqVD0IO4mmtmVYp0Efk3TODU0oSBEFaY2CVPTg-8M7Vw2_yLNPr3eiT1tbM0vncu_Bjw488-Wnd_v2_G5b8O747NcoHZ2Mh2uwLGrs0vHTOixW0xu3AW_t3-pyNt2stYDBn5cG1T3CGUFf
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1NT9wwEB0BRaiXUloQ20LxoT1Ri8ROHOdQoRWwKgKt9tBWiEuIHVtCWiV0N7Tir_XXdSYfrEAqNw49O7GU-HnejD3zBuBjYLXUgTRcC2N5FHrJdVEEPE1FniiV5sI06vrnyXisLy7SyRL86WthKK2yt4mNoS4qS2fkBwKZSKcUsRz4Li1icjw6vPnJqYMU3bT27TRaiJy5u98Yvs2_nB7jWn8SYnTy7egr7zoMcIvQq7lH-vd57qyJlDTWxGkUOBsUSrgg9bEpqEeqixRppngVJIkR2oa5Ec753IS5xHmX4UWCMSalE07iy3sWIMXNVlec9Dql7Ap2urI9jdyAbMkxgFCKi4ekuPB0H13ONpw3Wv-f_9ZreNV52mzYbo0NWHLlG1jvu1iwzqi9hZNhyYa3ddVo1-bT6R37gbvSo2vOJrOqruiQmlWeoafMKP2zusYBSiGi_OFyzlrN9034_iwfswUrZVW6bWBWGhPLKMFhFeGya4z7bWwLkwTeq1ANIOxXN7Od8jo1AJlmC81oQkSGiMgaRGRiAPv379y0uiNPPr3TwyDrbNA8W2BgAJ97IC2G_z3bu6dn24M1xFJ2fjo-ew8vRQNjOpXagZV6dut2YdX-qq_nsw_NhmBw9dyY-gv9LEqD
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+Automatically+Verified+Prototype+of+the+Android+Permissions+System&rft.jtitle=Journal+of+automated+reasoning&rft.au=Cristi%C3%A1%2C+Maximiliano&rft.au=De+Luca%2C+Guido&rft.au=Luna%2C+Carlos&rft.date=2023-06-01&rft.pub=Springer+Netherlands&rft.issn=0168-7433&rft.eissn=1573-0670&rft.volume=67&rft.issue=2&rft_id=info:doi/10.1007%2Fs10817-023-09666-2&rft.externalDocID=10_1007_s10817_023_09666_2
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0168-7433&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0168-7433&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0168-7433&client=summon