کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
434293 689714 2014 21 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
A framework for linear authorization logics
ترجمه فارسی عنوان
یک چارچوب منطقی منطق مجوز
کلمات کلیدی
منطق مجوز منطقی، پیچیدگی منطق، تئوری اثبات
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
چکیده انگلیسی

Linear authorization logics (LALs) are logics based on linear logic that can be used for modeling effect-based authentication policies. LALs have been used in the context of the Proof-Carrying Authorization framework, where formal proofs must be constructed in order for a principal to gain access to some resource elsewhere. This paper investigates the complexity of the provability problem, that is, determining whether a formula is provable in a linear authorization logic. We show that the multiplicative propositional fragment of LAL is already undecidable in the presence of two principals. On the other hand, we also identify a first-order fragment of LAL for which provability is PSPACE-complete. Finally, we argue by example that the latter fragment is natural and can be used in practice.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Theoretical Computer Science - Volume 536, 29 May 2014, Pages 21–41
نویسندگان
,