Back to Search Start Over

Verifying Policy Enforcers

Authors :
Leonardo Mariani
Daniela Micucci
Yliès Falcone
Oliviero Riganelli
Università degli Studi di Milano-Bicocca = University of Milano-Bicocca (UNIMIB)
Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Compiler Optimization and Run-time Systems (CORSE)
Inria Grenoble - Rhône-Alpes
Institut National de Recherche en Informatique et en Automatique (Inria)-Institut National de Recherche en Informatique et en Automatique (Inria)-Laboratoire d'Informatique de Grenoble (LIG )
Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])-Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Laboratoire d'Informatique de Grenoble (LIG )
Institut polytechnique de Grenoble - Grenoble Institute of Technology (Grenoble INP )-Centre National de la Recherche Scientifique (CNRS)-Université Grenoble Alpes [2016-2019] (UGA [2016-2019])
Università degli Studi di Milano-Bicocca [Milano] (UNIMIB)
Riganelli, O
Micucci, D
Mariani, L
Falcone, Y
Source :
RV 2017-17th International Conference on Runtime Verification, RV 2017-17th International Conference on Runtime Verification, Sep 2017, Seattle, United States, Lecture Notes in Computer Science, Lecture Notes in Computer Science-Runtime Verification, Proceedings of the International Conference on Runtime Verification (RV), Runtime Verification ISBN: 9783319675305, RV
Publication Year :
2017
Publisher :
HAL CCSD, 2017.

Abstract

Policy enforcers are sophisticated runtime components that can prevent failures by enforcing the correct behavior of the software. While a single enforcer can be easily designed focusing only on the behavior of the application that must be monitored, the effect of multiple enforcers that enforce different policies might be hard to predict. So far, mechanisms to resolve interferences between enforcers have been based on priority mechanisms and heuristics. Although these methods provide a mechanism to take decisions when multiple enforcers try to affect the execution at a same time, they do not guarantee the lack of interference on the global behavior of the system. In this paper we present a verification strategy that can be exploited to discover interferences between sets of enforcers and thus safely identify a-priori the enforcers that can co-exist at run-time. In our evaluation, we experimented our verification method with several policy enforcers for Android and discovered some incompatibilities.<br />Comment: Oliviero Riganelli, Daniela Micucci, Leonardo Mariani, and Yli\`es Falcone. Verifying Policy Enforcers. Proceedings of 17th International Conference on Runtime Verification (RV), 2017. (to appear)

Details

Language :
English
ISBN :
978-3-319-67530-5
978-3-319-67531-2
ISSN :
03029743 and 16113349
ISBNs :
9783319675305 and 9783319675312
Database :
OpenAIRE
Journal :
RV 2017-17th International Conference on Runtime Verification, RV 2017-17th International Conference on Runtime Verification, Sep 2017, Seattle, United States, Lecture Notes in Computer Science, Lecture Notes in Computer Science-Runtime Verification, Proceedings of the International Conference on Runtime Verification (RV), Runtime Verification ISBN: 9783319675305, RV
Accession number :
edsair.doi.dedup.....b076b3d59db4ca47e4e00916bd5d63db