%0 Conference Proceedings
%T Verifying Security Policies Using Host Attributes
%+ Technische Universität Munchen - Technical University Munich - Université Technique de Munich (TUM)
%+ Airbus Group Innovations [Suresnes]
%A Diekmann, Cornelius
%A Posselt, Stephan-A.
%A Niedermayer, Heiko
%A Kinkelin, Holger
%A Hanka, Oliver
%A Carle, Georg
%Z Part 3: Security Analysis
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 34th Formal Techniques for Networked and Distributed Systems (FORTE)
%C Berlin, Germany
%Y Erika Ábrahám
%Y Catuscia Palamidessi
%I Springer
%3 Formal Techniques for Distributed Objects, Components, and Systems
%V LNCS-8461
%P 133-148
%8 2014-06-03
%D 2014
%R 10.1007/978-3-662-43613-4_9
%Z Computer Science [cs]
%Z Computer Science [cs]/Networking and Internet Architecture [cs.NI]Conference papers
%X For the formal verification of a network security policy, it is crucial to express the verification goals. These formal goals, called security invariants, should be easy to express for the end user. Focusing on access control and information flow security strategies, this work discovers and proves universal insights about security invariants. This enables secure and convenient auto-completion of host attribute configurations. We demonstrate our results in a civil aviation scenario. All results are machine-verified with the Isabelle/HOL theorem prover.
%G English
%Z TC 6
%Z WG 6.1
%2 https://inria.hal.science/hal-01398013/document
%2 https://inria.hal.science/hal-01398013/file/978-3-662-43613-4_9_Chapter.pdf
%L hal-01398013
%U https://inria.hal.science/hal-01398013
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-WG
%~ IFIP-TC6
%~ IFIP-WG6-1
%~ IFIP-FORTE
%~ IFIP-LNCS-8461