policy monitoring in first order temporal logic
play

Policy Monitoring in First-order Temporal Logic David Basin ETH - PowerPoint PPT Presentation

Dec 10, 2022 •34 likes •704 views

Policy Monitoring in First-order Temporal Logic David Basin ETH Zurich Joint work with Felix Klaedtke and Samuel M uller Modern problems 2 Modern problems What do these topics have to do with each other? 2 Modern problems What do these

  1. Policy Monitoring in First-order Temporal Logic David Basin ETH Zurich Joint work with Felix Klaedtke and Samuel M¨ uller

  2. Modern problems 2

  3. Modern problems What do these topics have to do with each other? 2

  4. Modern problems What do these topics have to do with each other? Are they theoretically interesting? 2

  5. Technical issues Processes to monitor and control proceses � Controlling access My medical data should only be accessible to my care givers. � Controlling usage ... and then used for intended purpose, e.g., improving healthcare � Corporate governance and regulatory compliance Implement controls to reduce risks. 3

  6. Technical issues Processes to monitor and control proceses � Controlling access My medical data should only be accessible to my care givers. � Controlling usage ... and then used for intended purpose, e.g., improving healthcare � Corporate governance and regulatory compliance Implement controls to reduce risks. Core problems are theoretically interesting! 3

  7. Focus policies � Setting: security and compliance • Business processes • Policies regulating data and processes

  8. Focus ❄ Compliance events ✲ Checker during runtime or audit � Setting: security and compliance • Business processes • Policies regulating data and processes � Monitoring ( � = enforcement) 4

  9. Focus ❄ Compliance events ✲ Checker during runtime or audit � Setting: security and compliance • Business processes • Policies regulating data and processes � Monitoring ( � = enforcement) � General solution using metric first-order temporal logic and an associated monitoring algorithm 4

  10. Focus ❄ Compliance events ✲ Checker during runtime or audit � Setting: security and compliance • Business processes • Policies regulating data and processes � Monitoring ( � = enforcement) � General solution using metric first-order temporal logic and an associated monitoring algorithm � Practical experience across a wide range of application areas 4

  11. Road map 1. An example 2. Metric First-order Temporal Logic 3. Formalization examples 4. Monitoring 5. Performance 6. Conclusion 5

  12. Road map 1. An example 2. Metric First-order Temporal Logic 3. Formalization examples 4. Monitoring 5. Performance 6. Conclusion 5

  13. Example � Consider a financial or research institute: • Employees write and publish reports • Reports may contain confidential data � Report approval policy 1. Reports must be approved before they are published. 2. Approvals must happen at most 10 days before publication. 3. The employees’ managers must approve the reports. � IT system logs events 2010-03-03 publish report (Charlie, #234) 2010-03-04 archive report (Alice, #104) . . . . . . . . . . . . . . . . . . 2010-03-09 approve report (Alice, #248) 2010-03-13 publish report (Bob, #248) . . . . . . . . . . . . . . . . . . � Are executions policy conform? 6

  14. Policy elements 1. Reports must be approved before they are published. 2. Approvals must happen at most 10 days before publication. 3. The employees’ managers must approve the reports. 7

  15. Policy elements q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q Subjects q q q q q q q q q q q q q q q q q q q q q q q q q q q q qq q q q q q q q q q q q q q q q q q q qq q q q q q q q q � reports and employees q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q qqqqqqq q � unbounded over time q q q q q qqqqqqqq q q q q qqqqq q qqqqqqqqq qqqqqq qqqqqqq qq qqqqqq qqqq qqqqq qqqqqq qqqqqqqq qqqqqqq qqqqqqqq qqqqqqqqq qqqqqqqqqq qqqqqqqqqq qqqqqqqqq qqqqqqqqqqqq qqqqqqqqqqqqq qqqqqqqqqqqqqq qqqqqqqqqqqqq qqqqqqqqqqqq 1. Reports must be approved before they are published. r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r 2. Approvals must happen at most 10 days before publication. 3. The employees’ managers must approve the reports. r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r 7

  16. Policy elements Subjects � reports and employees � unbounded over time 1. Reports must be approved before they are published. rr r r r r r r r r r r r r r r r r r r r r r r r rr r r r r r r r r r 2. Approvals must happen at most 10 days before publication. r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r 3. The employees’ managers must approve the reports. q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q Temporal aspects q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q qq q q q q q q q q q q qq � qualitative: before and always q q q q q q q q q qq q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q � quantitative: at most 10 days q q q q q qqqqqqq q q q q q q qqqqqqq q q qqqqq qqqqqq qqqqqqqqq qqqqqqq qqqqqqqq qq qqqq qqqqq qqqqqqq qqqqqq qqqqqq qqqqqqqq qqqqqqqqqq qqqqqqqq qqqqqqqqq qqqqqqqqqq qqqqqqqqqqqq qqqqqqqqqqqqq qqqqqqqqqqqqqq qqqqqqqqqqqqqq qqqqqqqqqqqq qqqqqqqqqqq 7

  17. Policy elements q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q Subjects q q Event predicates q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q q � approving and publishing a report q q q q q q � reports and employees q q q q q q q q qq q q q q q q q qq q q q q q q q q q q q q q q q q q q q � happen at a time point q q q � unbounded over time q q q q q q q q q q qqqqq q q q q qqqqqq q q q q qqqq qq q q qqqqq q qqqqqq q qqqqqqq q q � logged with time stamps qqqqqqqqq q qqqqqqqqqq q q q qqqqqqqqqqq q q qqqqqqqqqqqq q q q qqqqqqqqqqqqqq q q q qqqqqqqqqqqqqqq q q qqqqqqqqqqqqqq q q qqqq qqqqq qqqqqqqqqqqqq qqqqqqq qqqqqqqq qqqqqqqqqqqq qqqqqqqqq qqqqqqqqqq qqqqqqqqq qqqqqqqqqq qqqqqqqqqqqq qqqqqqqqqqqqq qqqqqqqqqqqqqq qqqqqqqq 1. Reports must be approved before they are published. r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r r 2. Approvals must happen at most 10 days before publication. 3. The employees’ managers must approve the reports. Temporal aspects � qualitative: before and always � quantitative: at most 10 days 7

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Temporal and Modal Logic Based on paper: E.A. Emerson. Temporal and Modal Logic J. van Leeuwen,

Temporal and Modal Logic Based on paper: E.A. Emerson. Temporal and Modal Logic J. van Leeuwen,

Temporal and Modal Logic Based on paper: E.A. Emerson. Temporal and Modal Logic J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, pages 9951072, Elsevier, 1990. Temporal and Modal

554 views • 27 slides
Lecture Slides for MAT-60556 PART V: Temporal logic, with applications to program verification

Lecture Slides for MAT-60556 PART V: Temporal logic, with applications to program verification

Lecture Slides for MAT-60556 PART V: Temporal logic, with applications to program verification (and other sciences!) Henri Hansen October 10, 2013 1 Modal logics We have seen first order logic as an extension of propositional logic, to

373 views • 26 slides
Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University

Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University

Advanced Logic Linear Temporal Logic Computation Tree Logic Daniel Gebler VU University Amsterdam March 11, 2013 Overview Linear temporal logic (LTL): describes properties of paths (individual executions) no modalities to

1.26k views • 107 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic

Logic as a Tool Chapter 3: Understanding First-order Logic 3.2 Semantics of first-order logic Valentin Goranko Stockholm University October 2016 Goranko Translation from first-order logic to natural language: examples in the structure of real

994 views • 20 slides
Temporal Logic of Actions Advanced Topics in Distributed Computing Dominik Grewe Saarland

Temporal Logic of Actions Advanced Topics in Distributed Computing Dominik Grewe Saarland

Temporal Logic of Actions Temporal Logic of Actions Advanced Topics in Distributed Computing Dominik Grewe Saarland University March 20, 2008 Temporal Logic of Actions Outline Basic Concepts Transition Systems Temporal Operators Fairness

480 views • 32 slides
First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic

First-order logic Whereas propositional logic assumes world contains facts , first-order logic (like natural language) assumes the world contains First-order logic Objects: people, houses, numbers, theories, Ronald McDonald, colors, baseball

245 views • 6 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

451 views • 26 slides
Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects

Using first order logic (Ch. 8-9) Review: First order logic In first order logic, we have objects and relations between objects The relations are basically a list of all valid tuples that satisfy the relation We can also have variables that

382 views • 24 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak

188 views • 14 slides
From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard

From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard

Motivation FO-LTL f Slicing Slicability Usable Fragment Translation Conclude From First-order Temporal Logic to Parametric Trace Slicing Giles Reger David Rydeheard University of Manchester, Manchester, UK September 25, 2015 Motivation

590 views • 40 slides
Between two- and three-variable logic over word models Kamal Lodaya with Andreas Krebs, Paritosh

Between two- and three-variable logic over word models Kamal Lodaya with Andreas Krebs, Paritosh

Between two- and three-variable logic over word models Kamal Lodaya with Andreas Krebs, Paritosh Pandya, Howard Straubing The Institute of Mathematical Sciences, Chennai July 2017 First-order and temporal logic First-order logic FO is

632 views • 28 slides
Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and

Logic as a Tool Chapter 3: Understanding First-order Logic 3.1 First-order structures and languages. Terms and formulae of first-order logic. Valentin Goranko Stockholm University October 2016 Goranko Propositional logic is too weak Goranko

1.69k views • 109 slides
Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Why higher-order logic? Higher-Order logic Expressive Mathematics Verification

Extending SMT solvers to higher-order logic Haniel Barbosa Andrew Reynolds Daniel El Ouraoui Clark Barrett Cesare Tinelli SMT 2019 20190707, Lisbon, PT To be published in the proceedings of CADE 2019 Why higher-order logic?

569 views • 25 slides
Introduction to Temporal Logic Sanjit A. Seshia EECS, UC Berkeley Plan for Todays Lecture

Introduction to Temporal Logic Sanjit A. Seshia EECS, UC Berkeley Plan for Todays Lecture

EECS 294-98: Introduction to Temporal Logic Sanjit A. Seshia EECS, UC Berkeley Plan for Todays Lecture Linear Temporal Logic Signal Temporal Logic (by Alex Donze) S. A. Seshia 2 Behavior, Run, Computation Path Define in

767 views • 28 slides
First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in

First-Order Logic over Active Domain We consider First-Order Logic (FOL) exactly as used in relational database queries. This requires to drop functions except for constants. In particuar we assume to have a countably infinite set of constants

542 views • 5 slides
Introduction to Temporal Logic Mehdi Dastani BBL-521 M.M.Dastani@uu.nl Modal Logic Modal logic

Introduction to Temporal Logic Mehdi Dastani BBL-521 M.M.Dastani@uu.nl Modal Logic Modal logic

Introduction to Temporal Logic Mehdi Dastani BBL-521 M.M.Dastani@uu.nl Modal Logic Modal logic is developed to model various concepts and phenomena. Logic of and (necessity / possibility) Various flavours: epistemic /

547 views • 18 slides
The Uniform Martin Conjecture and Wadge Degrees Takayuki Kihara Joint Work with Antonio Montalb

The Uniform Martin Conjecture and Wadge Degrees Takayuki Kihara Joint Work with Antonio Montalb

The Uniform Martin Conjecture and Wadge Degrees Takayuki Kihara Joint Work with Antonio Montalb an Department of Mathematics, University of California, Berkeley, USA Algorithmic Randomness Interacts with Analysis and Ergodic Theory, Oaxaca,

608 views • 46 slides
Active Automata Learning: From DFA to Interface Programs and Beyond or From Languages to Program

Active Automata Learning: From DFA to Interface Programs and Beyond or From Languages to Program

Active Automata Learning: From DFA to Interface Programs and Beyond or From Languages to Program Executions or (more technically) The Power of Counterexample Analysis Bernhard Steffen, Falk Howar, Malte Isberner TU Dortmund /CMU B. Steffen

962 views • 71 slides
The Complexity of Semiautomatic Structures Sanjay Jain, Singapore Bakhadyr Khoussainov, Auckland

The Complexity of Semiautomatic Structures Sanjay Jain, Singapore Bakhadyr Khoussainov, Auckland

The Complexity of Semiautomatic Structures Sanjay Jain, Singapore Bakhadyr Khoussainov, Auckland Frank Stephan, Singapore Dan Teng, Singapore Siyuan Zou, Singapore The Complexity ofSemiautomatic Structures p. 1 Finite Automata

357 views • 19 slides
Reverse Mathematics and Field Extensions Preliminary Report ois Dorais, Jeff Hirst 1 , Paul

Reverse Mathematics and Field Extensions Preliminary Report ois Dorais, Jeff Hirst 1 , Paul

Reverse Mathematics and Field Extensions Preliminary Report ois Dorais, Jeff Hirst 1 , Paul Shafer Franc Appalachian State University Boone, NC These slides are available at: www.mathsci.appstate.edu/jlh April 1, 2012 ASL 2012 North

146 views • 10 slides
Unification in modal logic Philippe Balbiani CNRS Toulouse University Institut de recherche

Unification in modal logic Philippe Balbiani CNRS Toulouse University Institut de recherche

Unification in modal logic Philippe Balbiani CNRS Toulouse University Institut de recherche en informatique de Toulouse ICLA 2019 Indian Institute of Technology Delhi Introduction Unification problem in a logical system L Given a

1.65k views • 106 slides
The genus of regular languages and other ideas from low-dimensional topology Florian Deloup

The genus of regular languages and other ideas from low-dimensional topology Florian Deloup

A short overview of topology and languages interactions Introduction Crash course on regular languages Genus of a regular language Genus and size The genus of regular languages and other ideas from low-dimensional topology Florian Deloup

891 views • 72 slides
An automaton model for forest algebras. Internship conditions Goals and context Forest algebras

An automaton model for forest algebras. Internship conditions Goals and context Forest algebras

An automaton model for forest algebras. Antoine Delignat-Lavaud An automaton model for forest algebras. Internship conditions Goals and context Forest algebras Antoine Delignat-Lavaud Forest automata Algebraic model Advised by Howard

1.38k views • 117 slides
Finite MTL-algebras J.L. Castiglioni W. J. Zuluaga Botero Universidad Nacional de La Plata

Finite MTL-algebras J.L. Castiglioni W. J. Zuluaga Botero Universidad Nacional de La Plata

Preliminaries Finite Labeled Forests Forest Products From finite MTL-algebras to Forest Products The duality Theorem Finite MTL-algebras J.L. Castiglioni W. J. Zuluaga Botero Universidad Nacional de La Plata CONICET TACL 2017 Prague, June

899 views • 87 slides

More recommend