当前位置: X-MOL 学术J. Log. Algebr. Methods Program. › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
A calculus for modeling floating authorizations
Journal of Logical and Algebraic Methods in Programming ( IF 0.9 ) Pub Date : 2019-06-18 , DOI: 10.1016/j.jlamp.2019.06.002
Ivan Prokić , Jovanka Pantović , Hugo Torres Vieira

Controlling resource usage in distributed systems is a challenging task given the dynamics involved in access granting. Consider, e.g., the setting of floating licenses where access can be granted if the request originates in a licensed domain and if the number of active users is within the license limits. Access granting in such scenarios is given in terms of floating authorizations, addressed in this paper as first class entities of a process calculus model, encompassing the notions of domain, accounting and delegation. We present the operational semantics of the model in two equivalent alternative ways, and report on a preliminary investigation of the behavioral semantics, addressing fundamental properties and informing on the specific nature of our authorizations. We also introduce a typing discipline to single out systems that never get stuck due to lacking authorizations, addressing configurations where authorization assignment is not statically prescribed in the system specification. Finally, we present a refinement of the type system which paves the way for obtaining a more efficient type checking procedure.



中文翻译:

用于对浮动授权进行建模的演算

考虑到访问授权中涉及的动态,控制分布式系统中的资源使用是一项艰巨的任务。考虑例如浮动许可证的设置,如果请求起源于许可域,并且活动用户数在许可证限制之内,则可以授予访问权限。在这种情况下,访问授权是以浮动授权的方式给出的,在本文中将其称为流程演算模型的一流实体,其中包括域,记帐和委托的概念。我们以两种等效的替代方式介绍了该模型的操作语义,并报告了对行为语义的初步调查,解决了基本属性并告知了我们授权的特定性质。我们还引入了一种类型化规则,以选出不会因缺少授权而陷入困境的系统,解决系统规范中未静态规定授权分配的配置。最后,我们提出了类型系统的改进,这为获得更有效的类型检查程序铺平了道路。

更新日期:2019-06-18
down
wechat
bug