Zobrazeno 1 - 10
of 31
pro vyhledávání: '"Ranise A."'
Lazy abstraction with interpolation-based refinement has been shown to be a powerful technique for verifying imperative programs. In presence of arrays, however, the method suffers from an intrinsic limitation, due to the fact that invariants needed
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::07afa408e8392c74063cfb2d12c20d9e
http://doc.rero.ch/record/326403/files/10703_2014_Article_209.pdf
http://doc.rero.ch/record/326403/files/10703_2014_Article_209.pdf
Publikováno v:
International Journal on Software Tools for Technology Transfer. 18:559-573
We explain how a parameterized model checking technique can be exploited to mechanize the analysis of access control policies. The main advantage of the approach is to reason regardless of the number of users of the system in which the policy is enfo
Publikováno v:
SACMAT
SACMAT, Jun 2018, Indianapolis IN, United States
SACMAT 2018-Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies, 117-128
STARTPAGE=117;ENDPAGE=128;TITLE=SACMAT 2018-Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies
SACMAT, Jun 2018, Indianapolis IN, United States
SACMAT 2018-Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies, 117-128
STARTPAGE=117;ENDPAGE=128;TITLE=SACMAT 2018-Proceedings of the 23rd ACM Symposium on Access Control Models and Technologies
Security-sensitive workflows impose constraints on the controlflow and authorization policies that may lead to unsatisfiable instances. In these cases, it is still possible to find "least bad" executions where costs associated to authorization violat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eb8dfa0065dc18c35fab5750a7dba8a7
https://doi.org/10.1145/3205977.3205982
https://doi.org/10.1145/3205977.3205982
Publikováno v:
EPiC Series in Computing.
Timed networks are parametrized systems of timed au\-to\-ma\-ta. Solving reachability problems (e.g., whether a set of unsafe states can ever be reached from the set of initial states) for this class of systems allows one to prove safety properties r
Publikováno v:
Software Engineering and Formal Methods ISBN: 9783319661964
SEFM
SEFM
In previous work, we showed how to use an SMT-based model checker to synthesize run-time enforcement mechanisms for business processes augmented with access control policies and authorization constraints, such as Separation of Duties. The synthesized
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d590a2138fcecdf2eee929b7342228c9
https://doi.org/10.1007/978-3-319-66197-1_13
https://doi.org/10.1007/978-3-319-66197-1_13
Publikováno v:
International Journal of Foundations of Computer Science. 24:211-232
We identify sufficient conditions to automatically establish the termination of a backward reachability procedure for infinite state systems by using well-quasi-orderings. Besides showing that backward reachability succeeds on many instances of probl
Autor:
Silvio Ranise, Alessandro Armando
Publikováno v:
Journal of Computer Security. 20:309-352
Administrative Role Based Access Control ARBAC is one of the most widespread framework for the management of access-control policies. Several automated analysis techniques have been proposed to help maintaining desirable security properties of ARBAC
Autor:
Anh Truong, Silvio Ranise
Publikováno v:
Future Data and Security Engineering ISBN: 9783319480565
FDSE
FDSE
Access Control is becoming increasingly important for today’s ubiquitous systems. In access control models, the administration of access control policies is an important task that raises a crucial analysis problem: if a set of administrators can gi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::34928f2d7757af967b0228a99a54ea0d
https://doi.org/10.1007/978-3-319-48057-2_19
https://doi.org/10.1007/978-3-319-48057-2_19
Publikováno v:
Tools and Algorithms for the Construction and Analysis of Systems ISBN: 9783662496732
TACAS
TACAS
Cerberus is a tool to automatically synthesize run-time enforcement mechanisms for security-sensitive Business Processes BPs. The tool is capable of guaranteeing that the execution constraints $$EC $$ on the tasks together with the authorization poli
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::dbe693d64e87be56e79522e817580c06
https://doi.org/10.1007/978-3-662-49674-9_36
https://doi.org/10.1007/978-3-662-49674-9_36
Publikováno v:
Università degli Studi di Milano-IRIS
Model Checking Modulo Theories is a recent approach for the automated verication of safety properties of a class of innite