Communications of the ACM
First-order logic and automated theorem proving
First-order logic and automated theorem proving
SETHEO: a high-performance theorem prover
Journal of Automated Reasoning
An Efficient Unification Algorithm
ACM Transactions on Programming Languages and Systems (TOPLAS)
CADE-12 Proceedings of the 12th International Conference on Automated Deduction
Connections in nonclassical logics
Handbook of automated reasoning
Model elimination and connection tableau procedures
Handbook of automated reasoning
Specifying a security policy: a case study
CSFW '96 Proceedings of the 9th IEEE workshop on Computer Security Foundations
Security Policy System: Status and Perspective
ICON '00 Proceedings of the 8th IEEE International Conference on Networks
leanCoP: lean connection-based theorem proving
Journal of Symbolic Computation - Special issue: First order theorem proving
Active Vulnerability Assessment of Computer Networks by Simulation of Complex Remote Attacks
ICCNMC '03 Proceedings of the 2003 International Conference on Computer Networks and Mobile Computing
Best-Practice Patterns and Tool Support for Configuring Secure Web Services Messaging
ICWS '04 Proceedings of the IEEE International Conference on Web Services
Abstract behavior types: a foundation model for components and their composition
Science of Computer Programming - Formal methods for components and objects pragmatic aspects and applications
Using First-Order Logic to Reason about Policies
ACM Transactions on Information and System Security (TISSEC)
IJCAR '08 Proceedings of the 4th international joint conference on Automated Reasoning
The TPTP Problem Library and Associated Infrastructure
Journal of Automated Reasoning
Restricting backtracking in connection calculi
AI Communications - Practical Aspects of Automated Reasoning
The 5th IJCAR automated theorem proving system competition - CASC-J5
AI Communications
Modelling mobility aspects of security policies
CASSIS'04 Proceedings of the 2004 international conference on Construction and Analysis of Safe, Secure, and Interoperable Smart Devices
Journal of Visual Languages and Computing
Hi-index | 0.00 |
In certain critical cases the data flow between business departments in banking organizations has to respect security policies known as Chinese Wall or Bell-La Padula. We show that these policies can be represented by formal requirements and constraints in first-order logic. By additionally providing a formal model for the flow of data between business departments we demonstrate how security policies can be applied to a concrete organizational setting and checked with a first-order theorem prover. Our approach can be applied without requiring a deep formal expertise and it therefore promises a high potential of usability in the business.