Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Didier Villevalois"'
Publikováno v:
PPDP
PPDP 2016
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom. pp.Pages 62-75
PPDP 2016
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming
Proceedings of the 18th International Symposium on Principles and Practice of Declarative Programming, Sep 2016, Edinburgh, United Kingdom. pp.Pages 62-75
International audience; Administration of access control policies is a difficult task, especially in large organizations. We consider the problem of detecting whether administrative actions can yield in policies where some security goals are compromi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b13bcc4d9a5c4782c7593a2c4684213d
https://hal.science/hal-01452928
https://hal.science/hal-01452928
Publikováno v:
Lecture Notes in Computer Science
Lecture Notes in Computer Science-Foundations of Software Science and Computation Structures
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017)
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Apr 2017, Uppsala, Sweden
Lecture Notes in Computer Science ISBN: 9783662544570
FoSSaCS
Lecture Notes in Computer Science-Foundations of Software Science and Computation Structures
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017)
20th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2017), Apr 2017, Uppsala, Sweden
Lecture Notes in Computer Science ISBN: 9783662544570
FoSSaCS
Weighted automata (WA) are an important formalism to describe quantitative properties. Obtaining equivalent deterministic machines is a longstanding research problem. In this paper we consider WA with a set semantics, meaning that the semantics is gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::28c9fc55a59c731f23d1b4bc033afb94