作者: Maximiliano Cristiá , Gianfranco Rossi
DOI: 10.1007/S10817-020-09577-6
关键词:
摘要: Almost 50 years ago, D. E. Bell and L. LaPadula published the first formal model of a secure system, known today as Bell–LaPadula (BLP) model. BLP is described state machine by means first-order logic set theory. The authors also formalize two invariants security condition *-property. prove that all transitions preserve these invariants. In this paper we present fully automated proof *-property for operations. proofs are coded in $$\{log\}$$ tool. As far know time such automated. Besides, show an executable prototype. Therefore providing automatically verified prototype BLP.