Creative Commons Attribution 4.0 International license
We develop a fibred security language capable to express statements of the form
begin{center}
${x }varphi (x) says psi$
end{center}
where ${x}varphi (x)$ is the set of all $x$ that satisfy
$varphi$ and $psi$ is any formula. $varphi$ and $psi$ may
share several free variables.
For example, we can express the following: "A member $m$ of the Program Committee can not accept a paper $P_1$
in which one of its authors says that he has published a paper with him after 2007"
begin{center}
$
eg({m} [PC(m) wedge {y}author\_of(y,P_1) extbf{ says } exists p(paper(p) wedge author\_of(m,p) wedge author\_of(y,p) wedge year(p) geq 2007)] extbf{ says } accept(P_1))$
end{center}
@InProceedings{genovese_et_al:DagSemProc.09121.16,
author = {Genovese, Valerio and Gabbay, Dov M. and Boella, Guido and van der Torre, Leendert},
title = {{FSL – Fibred Security Language}},
booktitle = {Normative Multi-Agent Systems},
pages = {1--29},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2009},
volume = {9121},
editor = {Guido Boella and Pablo Noriega and Gabriella Pigozzi and Harko Verhagen},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.09121.16},
URN = {urn:nbn:de:0030-drops-19083},
doi = {10.4230/DagSemProc.09121.16},
annote = {Keywords: Access Control, Trust Management, Fibring Logics}
}