TABLEAUX 2011 Workshops , Tutorials , and Short Papers

In security and compliance, it is often necessary to ensure that agents and systems comply to complex policies. An example of such a policy from financial reporting is the requirement that every transaction t of a customer c, who has within the last 30 days been involved in a suspicious transaction t′, must be reported as suspicious within 2 days. In this talk, I will give an overview of our approach to automated compliance checking. In particular, I will present our monitoring algorithm for checking properties specified in a fragment of metric first-order temporal logic. I will also report on case studies in security and compliance monitoring and use these to evaluate both the suitability of this fragment for expressing complex, realistic policies and the efficiency of the monitoring algorithm. Joint work with David Basin, Matúš Harvan, Samuel Müller, and Eugen Zălinescu.