author | Christian Urban <christian dot urban at kcl dot ac dot uk> |
Sun, 17 Nov 2013 19:22:57 +0000 | |
changeset 134 | e4fda36422dd |
parent 133 | 3342571ec447 |
child 135 | e78af5feb655 |
hws/hw06.pdf | file | annotate | diff | comparison | revisions | |
hws/hw06.tex | file | annotate | diff | comparison | revisions |
--- a/hws/hw06.tex Tue Nov 12 21:15:23 2013 +0000 +++ b/hws/hw06.tex Sun Nov 17 19:22:57 2013 +0000 @@ -16,8 +16,6 @@ where $P$ is a principal and $F$ a formula. Give two inference rules of access-control logic involving $\textit{says}$. -\item (Removed) Was already used in HW 5 - \item Assume an access control logic with security levels, say top secret ({\it TS}), secret ({\it S}) and public ({\it P}), with