quantified differential invariants
play

Quantified Differential Invariants Andr e Platzer Carnegie Mellon - PowerPoint PPT Presentation

Aug 10, 2023 •455 likes •1.57k views

Quantified Differential Invariants Andr e Platzer Carnegie Mellon University, Pittsburgh, PA 0.5 0.4 0.3 0.2 1.0 0.1 0.8 0.6 0.4 0.2 Andr e Platzer (CMU) Quantified Differential Invariants HSCC 1 / 21 Outline Motivation 1

  1. Model for Distributed Hybrid Systems Q: How to model distributed hybrid systems Model (Distributed Hybrid Systems) Continuous dynamics (differential equations) ∀ i x ( i ) ′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) x ( j ) Discrete dynamics (control decisions) c ∀ i ω ( i ) := if .. then 0 else 2 Structural dynamics x ( i ) (communication/coupling) c ( i ) := negotiate(i,j) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 6 / 21

  2. Model for Distributed Hybrid Systems Q: How to model distributed hybrid systems A: Quantified Hybrid Programs Model (Distributed Hybrid Systems) Continuous dynamics x ( n ) (differential equations) ∀ i x ( i ) ′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) x ( j ) Discrete dynamics (control decisions) c ∀ i ω ( i ) := if .. then 0 else 2 Structural dynamics x ( i ) (communication/coupling) c ( i ) := negotiate(i,j) Dimensional dynamics (appearance) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 6 / 21

  3. Model for Distributed Hybrid Systems Q: How to model distributed hybrid systems A: Quantified Hybrid Programs Model (Distributed Hybrid Systems) Continuous dynamics x ( n ) (differential equations) ∀ i x ( i ) ′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) x ( j ) Discrete dynamics (control decisions) c ∀ i ω ( i ) := if .. then 0 else 2 Structural dynamics x ( i ) (communication/coupling) c ( i ) := negotiate(i,j) Dimensional dynamics (appearance) n := new Aircraft Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 6 / 21

  4. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Quantified hybrid program α ) ∀ i : C x ( i ) ′ = θ (quantified ODE) � ∀ i : C x ( i ) := θ (quantified assignment) jump & test ? χ (conditional execution) α ; β (seq. composition) � α ∪ β (nondet. choice) Kleene algebra α ∗ (nondet. repetition) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  5. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Quantified hybrid program α ) ∀ i : C x ( i ) ′ = θ (quantified ODE) � ∀ i : C x ( i ) := θ (quantified assignment) jump & test ? χ (conditional execution) α ; β (seq. composition) � α ∪ β (nondet. choice) Kleene algebra α ∗ (nondet. repetition) DATC ≡ ( ctrl ; fly ) ∗ x ( n ) ctrl ≡ ∀ i : A ω ( i ) := if ∀ j : A far ( i , j ) then 0 else 2 x ( j ) fly ≡ ∀ i : A x ( i ) ′′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) c x ( i ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  6. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Quantified hybrid program α ) ∀ i : C x ( i ) ′ = θ (quantified ODE) � ∀ i : C x ( i ) := θ (quantified assignment) jump & test ? χ (conditional execution) α ; β (seq. composition) � α ∪ β (nondet. choice) Kleene algebra α ∗ (nondet. repetition) DATC ≡ ( appear ; ctrl ; fly ) ∗ appear ≡ n := new A ; ?( ∀ j : A far ( j , n )) x ( n ) ctrl ≡ ∀ i : A ω ( i ) := if ∀ j : A far ( i , j ) then 0 else 2 x ( j ) fly ≡ ∀ i : A x ( i ) ′′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) c x ( i ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  7. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Quantified hybrid program α ) ∀ i : C x ( i ) ′ = θ (quantified ODE) � ∀ i : C x ( i ) := θ (quantified assignment) jump & test ? χ (conditional execution) α ; β (seq. composition) � α ∪ β (nondet. choice) Kleene algebra α ∗ (nondet. repetition) DATC ≡ ( appear ; ctrl ; fly ) ∗ appear ≡ n := new A ; ?( ∀ j : A far ( j , n )) x ( n ) ctrl ≡ ∀ i : A ω ( i ) := if ∀ j : A far ( i , j ) then 0 else 2 x ( j ) fly ≡ ∀ i : A x ( i ) ′′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) c new A is definable! x ( i ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  8. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Quantified hybrid program α ) ∀ i : C x ( i ) ′ = θ (quantified ODE) � ∀ i : C x ( i ) := θ (quantified assignment) jump & test ? χ (conditional execution) α ; β (seq. composition) � α ∪ β (nondet. choice) Kleene algebra α ∗ (nondet. repetition) DATC ≡ ( appear ; ctrl ; fly ) ∗ appear ≡ n := new A ; ?( ∀ j : A far ( j , n )) x ( n ) ctrl ≡ ∀ i : A ω ( i ) := if ∀ j : A far ( i , j ) then 0 else 2 x ( j ) fly ≡ ∀ i : A x ( i ) ′′ = d ( i ) , d ( i ) ′ = f ( ω ( i ) , d ( i )) c x ( i ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  9. Quantified Differential Dynamic Logic Qd L : Syntax Definition (Qd L Formula φ ) ¬ , ∧ , ∨ , → , ∀ x , ∃ x , = , ≤ , + , · ( R -first-order part) [ α ] φ, � α � φ (dynamic part) ∀ i , j : A far ( i , j ) → [( appear ; ctrl ; fly ) ∗ ] ∀ i , j : A ( i = j ∨ ( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) − x 2 ( j )) 2 ≥ p 2 ) x ( n ) x ( j ) c x ( i ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 7 / 21

  10. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) ∀ i : C x ( i ) := θ v w Details x if w ( x )( v e ]) = v e i [ [ i ] i [ [ θ ] ] (for all e ) w and otherwise unchanged v t 0 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  11. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) ∀ i : C x ( i ) ′ = θ v w Details x ϕ ( t ) d ϕ ( t ) e w i [ [ x ( i )] ] ( ζ ) = ϕ ( ζ ) e i [ [ θ ] ] (for all e ) d t v t ∀ i x ( i ) ′ = θ Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  12. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) α ; β v s w α β Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  13. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) α ; β v s w α β Details x s w v t Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  14. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) α ; β v s w α β Details x s v w t Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  15. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) α ∗ v s 1 s 2 s n w α α α Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  16. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) α ∗ v s 1 s 2 s n w α α α Details x v w t Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  17. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) w 1 α v α ∪ β β w 2 Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  18. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) w 1 α v α ∪ β β w 2 Details x v w 1 w 2 t Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  19. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) ? χ if v | = χ v Details x no change if v | = χ v otherwise no transition t 0 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  20. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Quantified hybrid program α : transition semantics ) if v �| = χ v Details x no change if v | = χ v otherwise no transition t 0 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 8 / 21

  21. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) φ v φ [ α ] φ φ Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  22. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) v φ � α � φ Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  23. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) [ α ] φ α -span v Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  24. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) [ α ] φ α -span v � β � φ β -span Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  25. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) � β � [ α ]-span [ α ] φ α -span v � β � φ β -span Details Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  26. Quantified Differential Dynamic Logic Qd L : Semantics Definition (Qd L Formula φ ) � β � [ α ]-span [ α ] φ α -span v � β � φ β -span Details compositional semantics ⇒ compositional calculus! Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  27. Outline (Verification Approach) Motivation 1 Quantified Differential Dynamic Logic Qd L 2 Design Syntax Semantics Proof Calculus for Distributed Hybrid Systems 3 Compositional Verification Calculus Air Traffic Control Derivations and Differentiation Soundness and Completeness Conclusions 4 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 9 / 21

  28. Proof Calculus for Quantified Differential Dynamic Logic ∀ i ( i = u → φ ( θ )) φ ([ ∀ i x ( i ) := θ ] x ( u )) φ ∀ i x ( i ) := θ v w Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 10 / 21

  29. Proof Calculus for Quantified Differential Dynamic Logic ∀ i ( i = [ ∀ i x ( i ) := θ ] u → φ ( θ )) φ ([ ∀ i x ( i ) := θ ] x ( u )) φ ∀ i x ( i ) := θ v w Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 10 / 21

  30. Proof Calculus for Quantified Differential Dynamic Logic ∀ i ( i = [ ∀ i x ( i ) := θ ] u → φ ( θ )) φ ([ ∀ i x ( i ) := θ ] x ( u )) φ ∀ i x ( i ) := θ v w ∀ i x ( i ) ′ = θ v w ∃ t ≥ 0 �∀ i S ( t ) � φ �∀ i x ( i ) ′ = θ � φ φ Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 10 / 21

  31. Proof Calculus for Quantified Differential Dynamic Logic ∀ i ( i = [ ∀ i x ( i ) := θ ] u → φ ( θ )) φ ([ ∀ i x ( i ) := θ ] x ( u )) φ ∀ i x ( i ) := θ v w ∀ i x ( i ) ′ = θ v w ∃ t ≥ 0 �∀ i S ( t ) � φ �∀ i x ( i ) ′ = θ � φ φ ∀ i S ( t ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 10 / 21

  32. Proof Calculus for Quantified Differential Dynamic Logic ∀ i ( i = [ ∀ i x ( i ) := θ ] u → φ ( θ )) φ ([ ∀ i x ( i ) := θ ] x ( u )) φ ∀ i x ( i ) := θ v w ∀ i x ( i ) ′ = θ v w ∃ t ≥ 0 �∀ i S ( t ) � φ �∀ i x ( i ) ′ = θ � φ φ ∀ i S ( t ) solve infinite-dimensional diff. eqn.? Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 10 / 21

  33. Proof Calculus for Quantified Differential Dynamic Logic compositional semantics ⇒ compositional rules! Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 11 / 21

  34. Proof Calculus for Quantified Differential Dynamic Logic w 1 φ α [ α ] φ ∧ [ β ] φ v α ∪ β [ α ∪ β ] φ β w 2 φ Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 11 / 21

  35. Proof Calculus for Quantified Differential Dynamic Logic w 1 φ α [ α ] φ ∧ [ β ] φ v α ∪ β [ α ∪ β ] φ β w 2 φ α ; β [ α ][ β ] φ v s w [ α ; β ] φ α β [ α ][ β ] φ [ β ] φ φ Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 11 / 21

  36. Proof Calculus for Quantified Differential Dynamic Logic w 1 φ α [ α ] φ ∧ [ β ] φ v α ∪ β [ α ∪ β ] φ β w 2 φ α ; β [ α ][ β ] φ v s w [ α ; β ] φ α β [ α ][ β ] φ [ β ] φ φ α ∗ φ ( φ → [ α ] φ ) φ φ φ → [ α ] φ [ α ∗ ] φ v w α α α Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 11 / 21

  37. Air Traffic Control Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  38. Air Traffic Control Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  39. Air Traffic Control Verification? looks correct Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  40. Air Traffic Control Verification? looks correct NO! Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  41. Air Traffic Control ς y 2 ̺ ω e x 2 d x 1 y 1  x ′  1 = − v 1 + v 2 cos ϑ + ω x 2 x ′ 2 = v 2 sin ϑ − ω x 1     ϑ ′ = ̟ − ω Verification? looks correct NO! Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  42. Air Traffic Control ς y 2 ̺ ω e x 2 d x 1 y 1  x ′  1 = − v 1 + v 2 cos ϑ + ω x 2 x ′ 2 = v 2 sin ϑ − ω x 1     ϑ ′ = ̟ − ω Example (“Solving” differential equations) 1 � x 1 ( t ) = x 1 ω̟ cos t ω − v 2 ω cos t ω sin ϑ + v 2 ω cos t ω cos t ̟ sin ϑ − v 1 ̟ sin t ω ω̟ 1 − sin ϑ 2 sin t ω � + x 2 ω̟ sin t ω − v 2 ω cos ϑ cos t ̟ sin t ω − v 2 ω � + v 2 ω cos ϑ cos t ω sin t ̟ + v 2 ω sin ϑ sin t ω sin t ̟ . . . Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  43. Air Traffic Control ς y 2 ̺ ω e x 2 d x 1 y 1  x ′  1 = − v 1 + v 2 cos ϑ + ω x 2 x ′ 2 = v 2 sin ϑ − ω x 1     ϑ ′ = ̟ − ω Example (“Solving” differential equations) 1 � ∀ t ≥ 0 x 1 ω̟ cos t ω − v 2 ω cos t ω sin ϑ + v 2 ω cos t ω cos t ̟ sin ϑ − v 1 ̟ sin t ω ω̟ 1 − sin ϑ 2 sin t ω � + x 2 ω̟ sin t ω − v 2 ω cos ϑ cos t ̟ sin t ω − v 2 ω � + v 2 ω cos ϑ cos t ω sin t ̟ + v 2 ω sin ϑ sin t ω sin t ̟ . . . Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 12 / 21

  44. Differential Invariants for Differential Equations Idea (Differential Invariant) Formula that remains true in the direction of the dynamics Andr´ e Platzer. Differential-algebraic dynamic logic for differential-algebraic programs. J. Log. Comput. , 35(1): 309–352, 2010. Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 13 / 21

  45. Differential Invariants for Differential Equations Idea (Differential Invariant) Formula that remains true in the direction of the dynamics Andr´ e Platzer. Differential-algebraic dynamic logic for differential-algebraic programs. J. Log. Comput. , 35(1): 309–352, 2010. Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 13 / 21

  46. Differential Invariants for Differential Equations Idea (Differential Invariant) Formula that remains true in the direction of the dynamics Andr´ e Platzer. Differential-algebraic dynamic logic for differential-algebraic programs. J. Log. Comput. , 35(1): 309–352, 2010. Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 13 / 21

  47. Differential Invariants for Differential Equations Idea (Differential Invariant) Formula that remains true in the direction of the dynamics R 2 but R ∞ ?? Andr´ e Platzer. Differential-algebraic dynamic logic for differential-algebraic programs. J. Log. Comput. , 35(1): 309–352, 2010. Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 13 / 21

  48. Differential Induction: Local Dynamics w/o Solutions Definition (Differential Invariant) F closed under total differentiation with respect to differential constraints ¬ F F Details ( χ → F ′ ) χ → F → [ x ′ = θ ∧ χ ] F Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 14 / 21

  49. Differential Induction: Local Dynamics w/o Solutions Definition (Differential Invariant) F closed under total differentiation with respect to differential constraints ¬ F F Details ( χ → F ′ ) χ → F → [ x ′ = θ ∧ χ ] F Total differential F ′ of formulas ? Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 14 / 21

  50. Quantified Differential Invariants Definition (Quantified Differential Invariant) Quantified formula F closed under total differentiation with respect to quantified differential constraints Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 15 / 21

  51. Derivations and Differentiation Definition (Syntactic total derivation D ) D ( r ) = 0 if r a number symbol D ( x ( i )) = x ( i ) ′ if x : C → R , C � = R D ( a + b ) = D ( a ) + D ( b ) D ( a · b ) = D ( a ) · b + a · D ( b ) D ( a / b ) = ( D ( a ) · b − a · D ( b )) / b 2 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 16 / 21

  52. Derivations and Differentiation Definition (Syntactic total derivation D ) D ( r ) = 0 if r a number symbol D ( x ( i )) = x ( i ) ′ if x : C → R , C � = R D ( a + b ) = D ( a ) + D ( b ) D ( a · b ) = D ( a ) · b + a · D ( b ) D ( a / b ) = ( D ( a ) · b − a · D ( b )) / b 2 D ( a ≥ b ) ≡ D ( a ) ≥ D ( b ) accordingly for >, = D ( F ∧ G ) ≡ D ( F ) ∧ D ( G ) D ( ∀ i F ) ≡ ∀ i D ( F ) Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 16 / 21

  53. Derivations and Differentiation Definition (Syntactic total derivation D ) D ( r ) = 0 if r a number symbol D ( x ( i )) = x ( i ) ′ if x : C → R , C � = R D ( a + b ) = D ( a ) + D ( b ) D ( a · b ) = D ( a ) · b + a · D ( b ) D ( a / b ) = ( D ( a ) · b − a · D ( b )) / b 2 D ( a ≥ b ) ≡ D ( a ) ≥ D ( b ) accordingly for >, = D ( F ∧ G ) ≡ D ( F ) ∧ D ( G ) D ( ∀ i F ) ≡ ∀ i D ( F ) i = j ∨ ( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) − x 2 ( j )) 2 ≥ p 2 � � P ≡ ∀ i , j : A i ′ = j ′ ∧ 2( x 1 ( i ) − x 1 ( j ))( x 1 ( i ) ′ − x 1 ( j ) ′ ) � ⇒ D ( P ) ≡ ∀ i , j : A + 2( x 2 ( i ) − x 2 ( j ))( x 2 ( i ) ′ − x 2 ( j ) ′ ) ≥ 0 � Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 16 / 21

  54. Derivations and Differentiation Definition (Syntactic total derivation D ) D ( r ) = 0 if r a number symbol D ( x ( i )) = x ( i ) ′ if x : C → R , C � = R D ( a + b ) = D ( a ) + D ( b ) D ( a · b ) = D ( a ) · b + a · D ( b ) D ( a / b ) = ( D ( a ) · b − a · D ( b )) / b 2 D ( a ≥ b ) ≡ D ( a ) ≥ D ( b ) accordingly for >, = D ( F ∧ G ) ≡ D ( F ) ∧ D ( G ) D ( ∀ i F ) ≡ ∀ i D ( F ) i = j ∨ ( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) − x 2 ( j )) 2 ≥ p 2 � � P ≡ ∀ i , j : A i ′ = j ′ ∧ 2( x 1 ( i ) − x 1 ( j ))( x 1 ( i ) ′ − x 1 ( j ) ′ ) � ⇒ D ( P ) ≡ ∀ i , j : A + 2( x 2 ( i ) − x 2 ( j ))( x 2 ( i ) ′ − x 2 ( j ) ′ ) ≥ 0 � Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 16 / 21

  55. Derivations and Differentiation Syntactic derivation D ( · ) coincides with analytic differentiation: Lemma (Derivation lemma) Valuation is a differential homomorphism: for all flows ϕ all ζ ∈ [0 , r ] d ϕ ( t )[ [ θ ] ] ( ζ ) = ¯ ϕ ( ζ )[ [ D ( θ )] ] d t Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 17 / 21

  56. Derivations and Differentiation Syntactic derivation D ( · ) coincides with analytic differentiation: Lemma (Derivation lemma) Valuation is a differential homomorphism: for all flows ϕ all ζ ∈ [0 , r ] d ϕ ( t )[ [ θ ] ] ( ζ ) = ¯ ϕ ( ζ )[ [ D ( θ )] ] d t Locally understand QDE as quantified assignments: Lemma (Quantified differential substitution principle) = ∀ i : C f ( i ) ′ = θ ∧ χ , then ϕ | = υ = [ ∀ i : C f ( i ) ′ := θ ] υ for all υ . If ϕ | Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 17 / 21

  57. Derivations and Differentiation Syntactic derivation D ( · ) coincides with analytic differentiation: Lemma (Derivation lemma) Valuation is a differential homomorphism: for all flows ϕ all ζ ∈ [0 , r ] d ϕ ( t )[ [ θ ] ] ( ζ ) = ¯ ϕ ( ζ )[ [ D ( θ )] ] d t Locally understand QDE as quantified assignments: Lemma (Quantified differential substitution principle) = ∀ i : C f ( i ) ′ = θ ∧ χ , then ϕ | = υ = [ ∀ i : C f ( i ) ′ := θ ] υ for all υ . If ϕ | Theorem (Quantified Differential Invariant) χ → [ ∀ i : C f ( i ) ′ := θ ] D ( F ) ( QDI ) is sound F → [ ∀ i : C f ( i ) ′ = θ ∧ χ ] F Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 17 / 21

  58. A Simple Proof with Quantified Differential Invariants ∀ i : C 2 x ( i ) 3 ≥ 1 → [ ∀ i : C x ( i ) ′ = x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2 x ( i ) 3 ≥ 1 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 18 / 21

  59. A Simple Proof with Quantified Differential Invariants [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2( x ( i ) 3 ) ′ ≥ 0 ∀ i : C 2 x ( i ) 3 ≥ 1 → [ ∀ i : C x ( i ) ′ = x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2 x ( i ) 3 ≥ 1 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 18 / 21

  60. A Simple Proof with Quantified Differential Invariants [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 6 x ( i ) 2 x ( i ) ′ ≥ 0 [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2( x ( i ) 3 ) ′ ≥ 0 ∀ i : C 2 x ( i ) 3 ≥ 1 → [ ∀ i : C x ( i ) ′ = x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2 x ( i ) 3 ≥ 1 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 18 / 21

  61. A Simple Proof with Quantified Differential Invariants ∀ i : C 6 x ( i ) 2 ( x ( i ) 2 + x ( i ) 4 + 2) ≥ 0 [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 6 x ( i ) 2 x ( i ) ′ ≥ 0 [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2( x ( i ) 3 ) ′ ≥ 0 ∀ i : C 2 x ( i ) 3 ≥ 1 → [ ∀ i : C x ( i ) ′ = x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2 x ( i ) 3 ≥ 1 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 18 / 21

  62. A Simple Proof with Quantified Differential Invariants true ∀ i : C 6 x ( i ) 2 ( x ( i ) 2 + x ( i ) 4 + 2) ≥ 0 [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 6 x ( i ) 2 x ( i ) ′ ≥ 0 [ ∀ i : C x ( i ) ′ := x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2( x ( i ) 3 ) ′ ≥ 0 ∀ i : C 2 x ( i ) 3 ≥ 1 → [ ∀ i : C x ( i ) ′ = x ( i ) 2 + x ( i ) 4 + 2] ∀ i : C 2 x ( i ) 3 ≥ 1 Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 18 / 21

  63. Differential Induction for Aircraft Roundabouts [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y c x Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  64. Differential Induction for Aircraft Roundabouts i ′ = j ′ ∧ 2( x 1 ( i ) − x 1 ( j ))( x 1 ( i ) ′ − x 1 ( j ) ′ ) + 2( x 2 ( i ) − x 2 ( j ))( x 2 ( i ) ′ − x 2 ( j ) ′ ) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y c x Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  65. Differential Induction for Aircraft Roundabouts i ′ = j ′ ∧ 2( x 1 ( i ) − x 1 ( j ))( x 1 ( i ) ′ − x 1 ( j ) ′ ) + 2( x 2 ( i ) − x 2 ( j ))( x 2 ( i ) ′ − x 2 ( j ) ′ ) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y c x Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  66. Differential Induction for Aircraft Roundabouts 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y c x Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  67. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y c x Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  68. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  69. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  70. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  71. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d d 1 ( i ) ′ − d 1 ( j ) ′ = − ω ( x 2 ( i ) ′ − x 2 ( j ) ′ ) [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  72. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d d 1 ( i ) ′ − d 1 ( j ) ′ = − ω ( x 2 ( i ) ′ − x 2 ( j ) ′ ) [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  73. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d − ω d 2 ( i ) − − ω d 2 ( j ) = − ω ( d 2 ( i ) − d 2 ( j )) [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  74. Differential Induction for Aircraft Roundabouts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) y e y − c x e x d − e d − ω d 2 ( i ) + ω d 2 ( j ) = − ω ( d 2 ( i ) − d 2 ( j )) − ω d 2 ( i ) − − ω d 2 ( j ) = − ω ( d 2 ( i ) − d 2 ( j )) [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

  75. Differential Induction & Differential Cuts 2( x 1 ( i ) − x 1 ( j ))( − ω ( x 2 ( i ) − x 2 ( j ))) + 2( x 2 ( i ) − x 2 ( j )) ω ( x 1 ( i ) − x 1 ( j )) ≥ 0 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 0 = 0 ∧ 2( x 1 ( i ) − x 1 ( j ))( d 1 ( i ) − d 1 ( j )) + 2( x 2 ( i ) − x 2 ( j ))( d 2 ( i ) − d 2 ( j )) ≥ 0 [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )]( x 1 ( i ) − x 1 ( j )) 2 + ( x 2 ( i ) Proposition (Differential cut) F differential invariant of [ ∀ i x ( i ) ′ = θ ∧ H ] φ , then [ ∀ i x ( i ) ′ = θ ∧ H ] φ [ ∀ i x ( i ) ′ = θ ∧ H ∧ F ] φ iff − ω d 2 ( i ) + ω d 2 ( j ) = − ω ( d 2 ( i ) − d 2 ( j )) − ω d 2 ( i ) − − ω d 2 ( j ) = − ω ( d 2 ( i ) − d 2 ( j )) [ ∀ ix 1 ( i ) ′ = d 1 ( i ) , d 1 ( i ) ′ = − ω d 2 ( i ) , x 2 ( i ) ′ = d 2 ( i ) , d 2 ( i ) ′ = ω d 1 ( i )] d 1 ( i ) − d 1 ( j ) = − ω ( x 2 ( i Andr´ e Platzer (CMU) Quantified Differential Invariants HSCC 19 / 21

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

Differential Dynamic Logic and Differential Invariants for Hybrid Systems Andr e Platzer

Differential Dynamic Logic and Differential Invariants for Hybrid Systems Andr e Platzer

Differential Dynamic Logic and Differential Invariants for Hybrid Systems Andr e Platzer aplatzer@cs.cmu.edu Computer Science Department Carnegie Mellon University, Pittsburgh, PA http://symbolaris.com/ 0.5 0.4 0.3 0.2 1.0 0.1 0.8

1.69k views • 164 slides
Characterizing Algebraic Invariants by Differential Radical Invariants Khalil Ghorbal Carnegie

Characterizing Algebraic Invariants by Differential Radical Invariants Khalil Ghorbal Carnegie

Characterizing Algebraic Invariants by Differential Radical Invariants Khalil Ghorbal Carnegie Mellon university Joint work with Andr e Platzer CMACS AVACS November 21st, 2013 K. Ghorbal (CMU) CMACS AVACS 1 CMACS 1 / 31 Introduction

575 views • 33 slides
Quantified Differential Dynamic Logic for Distributed Hybrid Systems Andr e Platzer Carnegie

Quantified Differential Dynamic Logic for Distributed Hybrid Systems Andr e Platzer Carnegie

Quantified Differential Dynamic Logic for Distributed Hybrid Systems Andr e Platzer Carnegie Mellon University, Pittsburgh, PA 0.5 0.4 0.3 0.2 1.0 0.1 0.8 0.6 0.4 0.2 Andr e Platzer (CMU) Quantified Differential Dynamic Logic

1.38k views • 88 slides
e t u b i r t s i D - e R Generating Microdata with Complex Invariants under

e t u b i r t s i D - e R Generating Microdata with Complex Invariants under

e t u b i r t s i D - e R Generating Microdata with Complex Invariants under Differential Privacy Philip Leclerc, Mathematical Statistician t Center for Enterprise Dissemination-Disclosure Avoidance United States Census Bureau o

443 views • 28 slides
CS 528 Mobile and Ubiquitous Computing Lecture 8a: Wearables, Quantified Self &

CS 528 Mobile and Ubiquitous Computing Lecture 8a: Wearables, Quantified Self &

CS 528 Mobile and Ubiquitous Computing Lecture 8a: Wearables, Quantified Self & Physiological Sensing Emmanuel Agu Tracking Health, Wellness & Quantified Self Quantified Self (QS) QS: Community of People who want to measure, log,

512 views • 38 slides
CS 528 Mobile and Ubiquitous Computing Lecture 9a: Wearables, Quantified Self &

CS 528 Mobile and Ubiquitous Computing Lecture 9a: Wearables, Quantified Self &

CS 528 Mobile and Ubiquitous Computing Lecture 9a: Wearables, Quantified Self & Physiological Sensing Emmanuel Agu Tracking Health, Wellness & Quantified Self Quantified Self (QS) QS: Community of People who want to measure, log,

1.33k views • 38 slides
CS 4518 Mobile and Ubiquitous Computing Lecture 11: Quantified Self, Smartwatches, Android Wear,

CS 4518 Mobile and Ubiquitous Computing Lecture 11: Quantified Self, Smartwatches, Android Wear,

CS 4518 Mobile and Ubiquitous Computing Lecture 11: Quantified Self, Smartwatches, Android Wear, Energy Efficiency, Security Emmanuel Agu Quantified Self Quantified Self (QS) QS: Community of People who want to measure, log, share metrics

840 views • 82 slides
Searching for Program Invariants using Genetic Programming and Mutation Testing Sam Ratcliff,

Searching for Program Invariants using Genetic Programming and Mutation Testing Sam Ratcliff,

Searching for Program Invariants using Genetic Programming and Mutation Testing Sam Ratcliff, David R. White and John A. Clark. The 13th CREST Open Workshop Thursday 12 May 2011 Outline Invariants Using GP to find Invariants Identifying

417 views • 38 slides
GENERATING INVARIANTS IN POSITIVE CHARACTERISTIC VISU MAKAM Abstract. The ring of invariants for a

GENERATING INVARIANTS IN POSITIVE CHARACTERISTIC VISU MAKAM Abstract. The ring of invariants for a

GENERATING INVARIANTS IN POSITIVE CHARACTERISTIC VISU MAKAM Abstract. The ring of invariants for a rational representation of a reductive group is finitely generated by the results of Hilbert, Nagata and Haboush. However, the proof is not

482 views • 3 slides
Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan

Solving Quantified Bit-Vector Formulas Using Binary Decision Diagrams Martin Jon a s Jan Strej cek Masaryk University, Brno, Czech Republic Brussels September 7, 2016 1 / 13 Quantified bit-vector formulas x 32 y 32 ( y

208 views • 20 slides
Local invariants of maps between 3-manifolds Victor Goryunov University of Liverpool Conference

Local invariants of maps between 3-manifolds Victor Goryunov University of Liverpool Conference

Introduction Generic critical value sets Integer invariants mod2 invariants Local invariants of maps between 3-manifolds Victor Goryunov University of Liverpool Conference Legacy of Vladimir Arnold Fields Institute, Toronto 25 November

1.37k views • 84 slides
Optimising Quantified Expressions in Constraint Models Ian P. Gent, Ian Miguel and Andrea Rendl

Optimising Quantified Expressions in Constraint Models Ian P. Gent, Ian Miguel and Andrea Rendl

Optimising Quantified Expressions Optimising Quantified Expressions in Constraint Models Ian P. Gent, Ian Miguel and Andrea Rendl University of St Andrews, UK AIT Austrian Institute of Technology, Austria September 2010 Workshop on Modelling

1.16k views • 88 slides
Reasoning Engines for Rigorous System Engineering Block 3: Quantified Boolean Formulas and DepQBF

Reasoning Engines for Rigorous System Engineering Block 3: Quantified Boolean Formulas and DepQBF

Reasoning Engines for Rigorous System Engineering Block 3: Quantified Boolean Formulas and DepQBF 2. Basic Deduction Concepts for Quantified Boolean Formulas Uwe Egly Florian Lonsing Knowledge-Based Systems Group Institute of Information

617 views • 49 slides
Differential equations Programming of Differential Equations A differential equation (ODE)

Differential equations Programming of Differential Equations A differential equation (ODE)

5mm. Differential equations Programming of Differential Equations A differential equation (ODE) written in generic form: (Appendix E) u ( t ) = f ( u ( t ) , t ) The solution of this equation is a function u ( t ) Hans Petter Langtangen To

332 views • 8 slides
Differential equations Programming of Differential Equations A differential equation (ODE)

Differential equations Programming of Differential Equations A differential equation (ODE)

5mm. Differential equations Programming of Differential Equations A differential equation (ODE) written in generic form: (Appendix E) u ( t ) = f ( u ( t ) , t ) Hans Petter Langtangen The solution of this equation is a function u ( t ) To

219 views • 4 slides
CPSC 121: Models of Computation Determine the negation of any quantified statement. Given a

CPSC 121: Models of Computation Determine the negation of any quantified statement. Given a

Pre-Class Learning Goals By the start of class, you should be able to: CPSC 121: Models of Computation Determine the negation of any quantified statement. Given a quantified statement and an equivalence rule, apply the rule to create

267 views • 8 slides
Charon: linear algebra made easy G. M. Crosswhite Department of Physics University of Washington

Charon: linear algebra made easy G. M. Crosswhite Department of Physics University of Washington

The Vision Components Charon: linear algebra made easy G. M. Crosswhite Department of Physics University of Washington Thursday, April 16, 2009 G. M. Crosswhite Charon: linear algebra made easy The Vision Components My story Quantum

990 views • 81 slides
HybridUML Profile for UML 2.0 Kirsten Berkenktter Stefan Bisanz Ulrich Hannemann Jan

HybridUML Profile for UML 2.0 Kirsten Berkenktter Stefan Bisanz Ulrich Hannemann Jan

HybridUML Profile for UML 2.0 Kirsten Berkenktter Stefan Bisanz Ulrich Hannemann Jan Peleska University of Bremen } Introduction } Motivation } CHARON at a Glance } HybridUML Profile } Future Work Introduction } hybrid systems discrete

548 views • 20 slides
Pluto and Charon From SINFONI Observations Francesca DeMeo and Christophe Dumas June 17, 2008

Pluto and Charon From SINFONI Observations Francesca DeMeo and Christophe Dumas June 17, 2008

Pluto and Charon From SINFONI Observations Francesca DeMeo and Christophe Dumas June 17, 2008 My Project at ESO PhD student at the Paris Observatory DCDG student at ESO for 3 months to work with Christophe Dumas Model Pluto and

722 views • 24 slides
Quantum Monte Carlo calculations for light nuclei using chiral forces Joel Lynn Theoretical

Quantum Monte Carlo calculations for light nuclei using chiral forces Joel Lynn Theoretical

Quantum Monte Carlo calculations for light nuclei using chiral forces Joel Lynn Theoretical Division, Los Alamos National Laboratory March 19, 2014 Outline 1 Motivation Ab-initio calculations for nuclei Nuclear interactions Phenomenology

703 views • 35 slides
The Moon 2 1 Earths Moon is the largest in size in relation to its object, except for

The Moon 2 1 Earths Moon is the largest in size in relation to its object, except for

1 The Moon 2 1 Earths Moon is the largest in size in relation to its object, except for Pluto/Charon The Moon is radius of Earth 1/80 the mass of Earth 3 4 2 5 Light from Moon takes 1.3 seconds to reach Earth 6 3

441 views • 15 slides
HRML: a hybrid relational modelling language He Jifeng + + 2 + Hybrid

HRML: a hybrid relational modelling language He Jifeng + + 2 + Hybrid

1 + HRML: a hybrid relational modelling language He Jifeng + + 2 + Hybrid Systems Systems are composed by continuous physical component and discrete control component The system state evoles over time

968 views • 51 slides
Factors Impacting Performance of Multithreaded Triangular Solve Sandia National Laboratories is a

Factors Impacting Performance of Multithreaded Triangular Solve Sandia National Laboratories is a

Factors Impacting Performance of Multithreaded Triangular Solve Sandia National Laboratories is a multi-program laboratory operated by Sandia Corporation, a wholly owned subsidiary of Lockheed Martin company, for the U.S. Department of Energys

644 views • 25 slides
Model-Checking Acknowledgment Formal Verification Formal verification means to apply

Model-Checking Acknowledgment Formal Verification Formal verification means to apply

Model-Checking Acknowledgment Formal Verification Formal verification means to apply mathematical arguments to prove the correctness of systems Systems have bugs Formal verification aims to find and correct such bugs Why? Computer systems

1.42k views • 122 slides

More recommend