• Publications
  • Influence
Relationship-based access control: its expression and enforcement through hybrid logic
This work identifies a fragment of hybrid logic to be used for expressing relationship-based access-control policies, shows that this fragment supports important policy idioms, and demonstrates that it removes an exponential penalty in existing attempts of specifying complex relationships such as "at least three friends".
Abstraction-Based Model Checking Using Modal Transition Systems
A framework for automatic program abstraction that can be used for model checking any formula of the modal mu-calculus, which can both prove and disprove any formula including arbitrarily nested path quantifiers is presented.
Quantitative analysis and model checking
It is established that the computation of fixed points may be restated as a conventional, and on average efficient, optimization problem in linear programming; this holds for a fragment of the modal mu-calculus which subsumes CTL.
Modal Transition Systems: A Foundation for Three-Valued Program Analysis
Two major applications, model checking partial state spaces and three-valued program shape analysis, are presented as evidence of the suitability of Kripke MTSs as a foundation for three- valued analyses.
Logic In Computer Science
Logic in computer science - modelling and reasoning about systems (2. ed.)
From the Publisher: Provides a simple and clear presentation, covering propositional and predicate logic and some specialized logics used for reasoning about the correctness of computer systems.
Access control via belnap logic: Intuitive, expressive, and analyzable policy composition
An expressive access-control policy language PBel is defined, having composition operators based on the operators of Belnap logic, and domain-specific and generic extensions of the policy language are discussed.
Access-Control Policies via Belnap Logic: Effective and Efficient Composition and Analysis
  • G. Bruns, M. Huth
  • Computer Science
    21st IEEE Computer Security Foundations Symposium
  • 23 June 2008
This work defines a query language in which policy analysis questions can be phrased, and establishes expressiveness results showing that all data independent policies can be expressed in the policy language.