courcelle s theorem made dynamic
play

Courcelles Theorem Made Dynamic Patricia Bouyer-Decitre 1,2 , Vincent - PowerPoint PPT Presentation

Jan 03, 2024 •475 likes •1.38k views

Courcelles Theorem Made Dynamic Patricia Bouyer-Decitre 1,2 , Vincent Jug 1,2,3 & Nicolas Markey 1,2,4 1: CNRS 2: ENS Paris-Saclay (LSV) 3: UPEM (LIGM) 4: Rennes (IRISA) 03/10/2017 P. Bouyer-Decitre, V. Jug & N. Markey

  1. Courcelle’s Theorem Made Dynamic Patricia Bouyer-Decitre 1,2 , Vincent Jugé 1,2,3 & Nicolas Markey 1,2,4 1: CNRS — 2: ENS Paris-Saclay (LSV) — 3: UPEM (LIGM) — 4: Rennes (IRISA) 03/10/2017 P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  2. Contents Dynamic Complexity of Decision Problems 1 Courcelle’s Theorem 2 Making Courcelle’s Theorem Dynamic 3 P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  3. Dynamic Complexity of Decision Problems Modulo 3 Decision Input: Elements x 1 , x 2 , . . . , x n of F 3 Output: Yes if x 1 ` x 2 ` . . . ` x n “ 0 — No otherwise P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  4. Dynamic Complexity of Decision Problems Modulo 3 Decision Input: Elements x 1 , x 2 , . . . , x n of F 3 Output: Yes if x 1 ` x 2 ` . . . ` x n “ 0 — No otherwise Solving this problem. . . Static world : membership in a regular language P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  5. Dynamic Complexity of Decision Problems Modulo 3 Decision Input: Elements x 1 , x 2 , . . . , x n of F 3 Output: Yes if x 1 ` x 2 ` . . . ` x n “ 0 — No otherwise Solving this problem. . . Static world : membership in a regular language Dynamic world : what if some element x k changes? § Maintain predicates S i ” “ x 1 ` x 2 ` . . . ` x n “ i ” for i P F 3 § Update the values of S 0 , S 1 , S 2 when x k changes § Use the new value of S 0 and answer the problem P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  6. Dynamic Complexity of Decision Problems Modulo 3 Decision Input: Elements x 1 , x 2 , . . . , x n of F 3 Output: Yes if x 1 ` x 2 ` . . . ` x n “ 0 — No otherwise Solving this problem. . . Static world : membership in a regular language Dynamic world : what if some element x k changes? § Maintain predicates S i ” “ x 1 ` x 2 ` . . . ` x n “ i ” for i P F 3 § Update the values of S 0 , S 1 , S 2 when x k changes § Use the new value of S 0 and answer the problem How complex is it? Static world : linear time Dynamic world : § Easy initial instance p x 1 “ x 2 “ . . . “ x n “ 0 q : constant time § Each update: constant time P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  7. Dynamic Complexity of Decision Problems Reachability in DAGs Input: Directed acyclic graph G “ p V , E q & two vertices s , t P V Output: Yes if D path from s to t in G — No otherwise P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  8. Dynamic Complexity of Decision Problems Reachability in DAGs Input: Directed acyclic graph G “ p V , E q & two vertices s , t P V Output: Yes if D path from s to t in G — No otherwise Solving this problem. . . Static world : use your favorite graph exploration algorithm Dynamic world : what if edge u Ñ v is inserted/deleted? § Maintain a predicate R p x , y q ” pD path from x to y in G q for x , y P V § Update the values of R p x , y q when u Ñ v is inserted/deleted § Use the new value of R p s , t q and answer the problem P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  9. Dynamic Complexity of Decision Problems Reachability in DAGs Input: Directed acyclic graph G “ p V , E q & two vertices s , t P V Output: Yes if D path from s to t in G — No otherwise Solving this problem. . . Static world : use your favorite graph exploration algorithm Dynamic world : what if edge u Ñ v is inserted/deleted? § Maintain a predicate R p x , y q ” pD path from x to y in G q for x , y P V § Update the values of R p x , y q when u Ñ v is inserted/deleted § Use the new value of R p s , t q and answer the problem How complex is it? Static world : linear time Dynamic world : § Easy initial edgeless instance: FO formulæ § Each update: FO formulæ P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  10. Dynamic Complexity of Decision Problems Reachability in DAGs Input: Directed acyclic graph G “ p V , E q & two vertices s , t P V Output: Yes if D path from s to t in G — No otherwise Solving this problem. . . Static world : use your favorite graph exploration algorithm Dynamic world : what if edge u Ñ v is inserted/deleted? § Maintain a predicate R p x , y q ” pD path from x to y in G q for x , y P V § Update the values of R p x , y q when u Ñ v is inserted/deleted § Use the new value of R p s , t q and answer the problem How complex is it? Static world : linear time Dynamic world : § Easy initial edgeless instance: FO formulæ ( parallel constant time) § Each update: FO formulæ ( parallel constant time) P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  11. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  12. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q ψ p e 1 , e 1 q ψ p e 1 , e 2 q ψ p e 2 , e 1 q ψ p e 2 , e 2 q P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  13. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q ψ p e 1 , e 1 q ψ p e 1 , e 2 q ψ p e 2 , e 1 q ψ p e 2 , e 2 q P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  14. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q ψ p e 1 , e 1 q ψ p e 1 , e 2 q ψ p e 2 , e 1 q ψ p e 2 , e 2 q x “ e 1 x “ e 1 x “ e 2 x “ e 2 _ _ _ _ y “ e 1 y “ e 2 y “ e 1 y “ e 2 P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  15. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q ψ p e 1 , e 1 q ψ p e 1 , e 2 q ψ p e 2 , e 1 q ψ p e 2 , e 2 q x “ e 1 x “ e 1 x “ e 2 x “ e 2 _ _ _ _ y “ e 1 y “ e 2 y “ e 1 y “ e 2 ^ ^ x “ e 1 x “ e 2 P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  16. FO formulæ ñ parallel « constant time φ “ D x . @ y .ψ p x , y q_ ψ p y , x q ψ p e 1 , e 1 q ψ p e 1 , e 2 q ψ p e 2 , e 1 q ψ p e 2 , e 2 q x “ e 1 x “ e 1 x “ e 2 x “ e 2 _ _ _ _ y “ e 1 y “ e 2 y “ e 1 y “ e 2 ^ ^ x “ e 1 x “ e 2 _ φ P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  17. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � R p x , y q Ð p x “ y q R p x , y q Ð R p x , y q Ð R p x , y q Ð R p x , y q Ð P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  18. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v R p x , y q Ð R p x , y q u R p x , y q Ð v R p x , y q Ð x R p x , y q Ð y R p x , y q Ð P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  19. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v : � x R p x , y q Ð R p x , y q_ u p R p x , u q ^ R p v , y qq v R p x , y q Ð y R p x , y q Ð R p x , y q Ð P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  20. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v : � Update after deleting the edge u Ñ v R p x , y q Ð p R p x , y q ^ � R p x , u qq u R p x , y q Ð v R p x , y q Ð R p x , y q Ð y x R p x , y q Ð P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  21. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v : � Update after deleting the edge u Ñ v R p x , y q Ð p R p x , y q ^ � R p x , u qq_ u p R p x , y q ^ R p y , u qq y v R p x , y q Ð x R p x , y q Ð R p x , y q Ð P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  22. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v : � Update after deleting the edge u Ñ v : � R p x , y q Ð p R p x , y q ^ � R p x , u qq_ u p R p x , y q ^ R p y , u qq_ a v pD a . D b . R p x , a q ^ R p b , y q^ x b pp a Ñ b q ^ p a , b q ‰ p u , v q^ y p R p a , u q ^ � R p b , u qq P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

  23. Dynamic Complexity of Decision Problems Reachability in DAGs with FO formulæ Initialization (on the edgeless graph): � Update after inserting the edge u Ñ v : � Update after deleting the edge u Ñ v : � ñ You can even maintain paths from s to t ! P. Bouyer-Decitre, V. Jugé & N. Markey Courcelle’s Theorem Made Dynamic

Recommend

Infinite transducers on terms denoting graphs Ir` ene Durand and Bruno Courcelle LaBRI,

Infinite transducers on terms denoting graphs Ir` ene Durand and Bruno Courcelle LaBRI,

Infinite transducers on terms denoting graphs Ir` ene Durand and Bruno Courcelle LaBRI, Universit e de Bordeaux June, 2013 European Lisp Symposium, ELS2013 Objectives What : Compute information about finite graphs Verify properties

683 views • 30 slides
Static Analysis and Interactive Theorem Proving - A Match Made in Heaven ? Jael E. Kriener

Static Analysis and Interactive Theorem Proving - A Match Made in Heaven ? Jael E. Kriener

Introduction Static Analysis by Example Interactive Theorem Proving in Coq Bliss? - Not Quite Yet... Static Analysis and Interactive Theorem Proving - A Match Made in Heaven ? Jael E. Kriener University of Kent, Canterbury November 18, 2011

429 views • 25 slides
31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the

31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the

31. Stokes Theorem Stokes theorem is to Greens theorem, for the work done, as the divergence theorem is to Greens theorem, for the flux. Both are 3D generalisations of 2D theorems. Theorem 31.1 (Stokes Theorem) . Let C be any closed

406 views • 3 slides
29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a

29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a

29. The divergence theorem Theorem 29.1 (Divergence Theorem; Gauss, Ostrogradsky) . Let S be a closed surface bounding a solid D , oriented outwards. Let F be a vector field with continuous partial derivatives. Then F d

471 views • 3 slides
Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over

Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over

Griffith University 3130CIT Theory of Computation (Based on slides by Harald Sndergaard of The University of Melbourne) Kleenes Theorem 4-0 Kleenes Theorem Theorem For every language L (over a finite

422 views • 17 slides
Combinat orics Definition 1 (Combinatorics). Combinatorics is the science of counting. Theorem 1

Combinat orics Definition 1 (Combinatorics). Combinatorics is the science of counting. Theorem 1

Combinat orics Definition 1 (Combinatorics). Combinatorics is the science of counting. Theorem 1 (Fundamental Principle of Count- ing). If a sequence of choices are made and the first choice can be made in n 1 ways, the sec- ond in n 2 ways, the

300 views • 5 slides
Lecture 12: Dynamic Choice and Time-Inconsistency Alexander Wolitzky MIT 14.121 1 Dynamic Choice

Lecture 12: Dynamic Choice and Time-Inconsistency Alexander Wolitzky MIT 14.121 1 Dynamic Choice

Lecture 12: Dynamic Choice and Time-Inconsistency Alexander Wolitzky MIT 14.121 1 Dynamic Choice Most important economic choices are made over time, or affect later decisions. Standard approach: Decision-maker has atemporal preferences over

583 views • 23 slides
EFA Dynamic Trade Finance Fund Q4 2016 Key Investment Considerations EFA Dynamic Trade Finance

EFA Dynamic Trade Finance Fund Q4 2016 Key Investment Considerations EFA Dynamic Trade Finance

EFA Dynamic Trade Finance Fund Q4 2016 Key Investment Considerations EFA Dynamic Trade Finance Fund A diversified portfolio of short-term loans made to companies doing business in the global supply chain of goods, aimed at generating 4

499 views • 36 slides
PCP Theorem [PCP Theorem is] the most important result in complexity theory since Cooks

PCP Theorem [PCP Theorem is] the most important result in complexity theory since Cooks

PCP Theorem [PCP Theorem is] the most important result in complexity theory since Cooks Theorem. Ingo Wegener, 2005 Computational Complexity, by Fu Yuxi PCP Theorem 1 / 119 S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof

1.53k views • 120 slides
Product Presentation BANTAM Made for para-mountaineers. Small, compact, dynamic the

Product Presentation BANTAM Made for para-mountaineers. Small, compact, dynamic the

Product Presentation BANTAM Made for para-mountaineers. Small, compact, dynamic the BANTAM is the perfect miniwing for all mountaineers who prefer a flight with plenty of speed to a descent on foot. Its excellent glide was demonstrated at

339 views • 16 slides
On Theorem Proving for Program Checking Historical perspective and recent developments Maria

On Theorem Proving for Program Checking Historical perspective and recent developments Maria

Outline Introduction Where is theorem proving in program checking Inside theorem proving Big and little engines together: a new theorem proving style Decision procedures with speculative inferences Current and future challenges On Theorem

944 views • 69 slides
made in Toronto Employing dynamic risk-management for Leveraging AI to optimize digital asset

made in Toronto Employing dynamic risk-management for Leveraging AI to optimize digital asset

Able to move real world assets into Multi-purpose blockchain firm blockchains through sophisticated asset tokenization made in Toronto Employing dynamic risk-management for Leveraging AI to optimize digital asset Canadas crypto pioneers,

306 views • 7 slides
Fundamental Principle of Counting Theorem 1 (Fundamental Principle of Counting) . If we have to

Fundamental Principle of Counting Theorem 1 (Fundamental Principle of Counting) . If we have to

Fundamental Principle of Counting Theorem 1 (Fundamental Principle of Counting) . If we have to make a sequence of choices for which the first choice can be made in n 1 ways, the second choice can be made in n 2 ways, the third choice can be made in

43 views • 3 slides
The Replacement Theorem Theorem (Theorem 1.10) Let V be a vector space and suppose G and L are

The Replacement Theorem Theorem (Theorem 1.10) Let V be a vector space and suppose G and L are

The Replacement Theorem Theorem (Theorem 1.10) Let V be a vector space and suppose G and L are finite subsets of V such that V = Span ( G ) , |G| = n , L is linearly independent, and |L| = m . Then m n and there is a set H G , such that

468 views • 36 slides
1 What is a Theorem Prover? What is a Theorem? Theorem: A formalizable statement which is

1 What is a Theorem Prover? What is a Theorem? Theorem: A formalizable statement which is

Prerequisites Course 2D1453, 2006-07 Undergraduate logic and discrete maths CS literacy Advanced Formal Methods Some functional programming experience useful The theorem prover Isabelle is programming in SML Some SML

644 views • 4 slides
22. Greens Theorem Theorem 22.1 (Greens Theorem) . If C is a positively oriented closed curve

22. Greens Theorem Theorem 22.1 (Greens Theorem) . If C is a positively oriented closed curve

22. Greens Theorem Theorem 22.1 (Greens Theorem) . If C is a positively oriented closed curve enclosing a region R then curl F d r = F d A. C R The circle in the centre of the integral sign is simply to emphasize

355 views • 4 slides
Generalized Intermediate Value Theorem Intermediate Value Theorem Theorem Intermediate Value

Generalized Intermediate Value Theorem Intermediate Value Theorem Theorem Intermediate Value

Generalized Intermediate Value Theorem Intermediate Value Theorem Theorem Intermediate Value Theorem Suppose f is continuous on [ a , b ] and let N be any number between f ( a ) and f ( b ) , where f ( a ) = f ( b ) . Then there exists a

59 views • 4 slides
From Shang Gao Magic 15 If a 2 + b 2 = c 2 , then ( a , b , c ) is called to be a Background

From Shang Gao Magic 15 If a 2 + b 2 = c 2 , then ( a , b , c ) is called to be a Background

Magic 15 Magic 15 Background Two Square Theorem Galois Finite Fields Magic 15: A STORY OVER 380 YEARS Proofs of 2-Square Theorem Three Square Theorem Four Square Theorem Universal Polynomials Magic 15 Proof of Fifteen Theorem 15

1.31k views • 97 slides
A short proof of Rayleighs Theorem Olivier Bernardi (MIT) Microsoft Research, January 2011

A short proof of Rayleighs Theorem Olivier Bernardi (MIT) Microsoft Research, January 2011

A short proof of Rayleighs Theorem Olivier Bernardi (MIT) Microsoft Research, January 2011 Spitzers walks in the plane Walks made of n unit steps. Direction of each step is uniformly random. Spitzers walks in the plane Walks made of n

307 views • 9 slides
Amdahl s Law 18 Amdahl s Law The fundamental theorem of performance optimization

Amdahl s Law 18 Amdahl s Law The fundamental theorem of performance optimization

Amdahl s Law 18 Amdahl s Law The fundamental theorem of performance optimization Made by Amdahl! One of the designers of the IBM 360 Gave FUD it s modern meaning Optimizations do not (generally) uniformly

372 views • 19 slides
Ch04. Maximum Theorem, Implicit Function Theorem and Envelope Theorem Ping Yu Faculty of

Ch04. Maximum Theorem, Implicit Function Theorem and Envelope Theorem Ping Yu Faculty of

Ch04. Maximum Theorem, Implicit Function Theorem and Envelope Theorem Ping Yu Faculty of Business and Economics The University of Hong Kong Ping Yu (HKU) MIFE 1 / 27 The Maximum Theorem 1 The Implicit Function Theorem 2 The Envelope

599 views • 28 slides
Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without

Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without

Interactive Theorem Proving, Nancy August 22, 2016 Joachim Breitner Karlsruhe Institute of Technology University of Pennsylvania, Philadelphia Visual theorem proving with the Incredible Proof Machine The idea Theorem Proving without Syntax

579 views • 43 slides
The Bellows Theorem (Proof) Giovanni Viglietta JAIST July 5, 2018 The Bellows Theorem

The Bellows Theorem (Proof) Giovanni Viglietta JAIST July 5, 2018 The Bellows Theorem

The Bellows Theorem (Proof) Giovanni Viglietta JAIST July 5, 2018 The Bellows Theorem (Proof) Bellows theorem: statement Theorem (Sabitov, 1996) The volume V of a polyhedron (of any genus) with edge lengths 1 , , e

1.22k views • 93 slides
AITP 2019 Obergurgl, Austria April 9, 2019 Outline Introduction Dynamic Fault Trees

AITP 2019 Obergurgl, Austria April 9, 2019 Outline Introduction Dynamic Fault Trees

Using Machine Learning to Minimize User Intervention in Theorem Proving based Dynamic Fault Tree Analysis Yassmeen Elderhalli, Osman Hasan and Sofine Tahar Concordia University Montreal, QC, Canada AITP 2019 Obergurgl, Austria April 9, 2019

613 views • 33 slides

More recommend