Studia Logica 92 (3):395 - 436 (2009)
AbstractWe study access control policies based on the says operator by introducing a logical framework called Fibred Security Language (FSL) which is able to deal with features like joint responsibility between sets of principals and to identify them by means of first-order formulas. FSL is based on a multimodal logic methodology. We first discuss the main contributions from the expressiveness point of view, we give semantics for the language (both for classical and intuitionistic fragment), we then prove that in order to express well-known properties like 'speaks-for' or 'hand- off', defined in terms of says, we do not need second-order logic (unlike previous approaches) but a decidable fragment of first-order logic suffices. We propose a model-driven study of the says axiomatization by constraining the Kripke models in order to respect desirable security properties, we study how existing access control logics can be translated into FSL and we give completeness for the logic.
Similar books and articles
Fibred semantics for feature-based grammar logic.Jochen Dörre, Esther König & Dov Gabbay - 1996 - Journal of Logic, Language and Information 5 (3-4):387-422.
An Event-Based Fragment of First-Order Logic over Intervals.Savas Konur - 2011 - Journal of Logic, Language and Information 20 (1):49-68.
On a decidable generalized quantifier logic corresponding to a decidable fragment of first-order logic.Natasha Alechina - 1995 - Journal of Logic, Language and Information 4 (3):177-189.
Guards, Bounds, and generalized semantics.Johan van Benthem - 2005 - Journal of Logic, Language and Information 14 (3):263-279.
Pure Second-Order Logic with Second-Order Identity.Alexander Paseau - 2010 - Notre Dame Journal of Formal Logic 51 (3):351-360.
Linguistic applications of first order intuitionistic linear logic.Richard Moot & Mario Piazza - 2001 - Journal of Logic, Language and Information 10 (2):211-232.
Grafted frames and S1 -completeness.Beihai Zhou - 1999 - Journal of Symbolic Logic 64 (3):1324-1338.
The undecidability of second order linear logic without exponentials.Yves Lafont - 1996 - Journal of Symbolic Logic 61 (2):541-548.
Deciding regular grammar logics with converse through first-order logic.Stéphane Demri & Hans De Nivelle - 2005 - Journal of Logic, Language and Information 14 (3):289-329.
Added to PP
Historical graph of downloads
Citations of this work
Analysis of the Talmudic Argumentum A Fortiori Inference Rule using Matrix Abduction.M. Abraham, Dov M. Gabbay & U. Schild - 2009 - Studia Logica 92 (3):281-364.
A Meta-model of Access Control in a Fibred Security Language.Steve Barker, Guido Boella, Dov M. Gabbay & Valerio Genovese - 2009 - Studia Logica 92 (3):437-477.