automated complexity analysis of rewrite systems
play

Automated Complexity Analysis of Rewrite Systems Florian Frohn RWTH - PowerPoint PPT Presentation

Jan 31, 2024 •145 likes •1.61k views

Automated Complexity Analysis of Rewrite Systems Florian Frohn RWTH Aachen University, Germany December 11, 2018 Automated Complexity Analysis of Rewrite Systems 1 Automated Complexity Analysis of Rewrite Systems Florian Frohn RWTH Aachen

  1. What is Rewriting? Rule-Based Representation of Programs input: x, y ∈ N Example (Integer Transition System (ITS)) z = 0 while x > 0 do 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] x = x − 1 5 while ( x, y, z ) → − while ( x − 1 , y, z + y ) [ x > 0] z = z + y 1 while ( x, y, z ) → − return ( z ) [ x = 0] end return z Example (Term Rewrite System (TRS)) 0 � 0 1 s ( 0 ) � length ( cons ( x, x ′ )) − → s ( length ( x ′ )) 2 s ( s ( 0 )) � length ( nil ) − → 0 Automated Complexity Analysis of Rewrite Systems 4

  2. What is Rewriting? Rule-Based Representation of Programs input: x, y ∈ N Example (Integer Transition System (ITS)) z = 0 while x > 0 do 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] x = x − 1 5 while ( x, y, z ) → − while ( x − 1 , y, z + y ) [ x > 0] z = z + y 1 while ( x, y, z ) → − return ( z ) [ x = 0] end return z Example (Term Rewrite System (TRS)) 0 � 0 1 s ( 0 ) � length ( cons ( x, x ′ )) − → s ( length ( x ′ )) 2 s ( s ( 0 )) � length ( nil ) − → 0 . . . Automated Complexity Analysis of Rewrite Systems 4

  3. Upper, Lower, Worst Case, Best Case, ... runtime input size Automated Complexity Analysis of Rewrite Systems 5

  4. Upper, Lower, Worst Case, Best Case, ... runtime input size Automated Complexity Analysis of Rewrite Systems 5

  5. Upper, Lower, Worst Case, Best Case, ... runtime input size Automated Complexity Analysis of Rewrite Systems 5

  6. Upper, Lower, Worst Case, Best Case, ... runtime input size Automated Complexity Analysis of Rewrite Systems 5

  7. Upper, Lower, Worst Case, Best Case, ... runtime input size Automated Complexity Analysis of Rewrite Systems 5

  8. Outline 1 Introduction 2 Lower Bounds for ITSs 3 Lower Bounds for TRSs 4 Constant Upper Bounds for TRSs Automated Complexity Analysis of Rewrite Systems 6

  9. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 7

  10. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) Automated Complexity Analysis of Rewrite Systems 7

  11. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] Automated Complexity Analysis of Rewrite Systems 7

  12. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 Automated Complexity Analysis of Rewrite Systems 7

  13. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) Automated Complexity Analysis of Rewrite Systems 7

  14. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] Automated Complexity Analysis of Rewrite Systems 7

  15. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 Automated Complexity Analysis of Rewrite Systems 7

  16. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 5 − → while (0 , 2 , 4) Automated Complexity Analysis of Rewrite Systems 7

  17. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 5 − → while (0 , 2 , 4) [ x/ 0 , y/ 2 , z/ 4] Automated Complexity Analysis of Rewrite Systems 7

  18. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 5 − → while (0 , 2 , 4) [ x/ 0 , y/ 2 , z/ 4] �| = x > 0 Automated Complexity Analysis of Rewrite Systems 7

  19. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 5 − → while (0 , 2 , 4) [ x/ 0 , y/ 2 , z/ 4] | = x = 0 Automated Complexity Analysis of Rewrite Systems 7

  20. Evaluating ITSs Example (ITS) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Example (Evaluation) while (2 , 2 , 0) [ x/ 2 , y/ 2 , z/ 0] | = x > 0 5 − → while (1 , 2 , 2) [ x/ 1 , y/ 2 , z/ 2] | = x > 0 5 − → while (0 , 2 , 4) [ x/ 0 , y/ 2 , z/ 4] | = x = 0 1 − → return (4) Automated Complexity Analysis of Rewrite Systems 7

  21. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] Automated Complexity Analysis of Rewrite Systems 8

  22. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] Automated Complexity Analysis of Rewrite Systems 8

  23. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations Automated Complexity Analysis of Rewrite Systems 8

  24. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x − n : value of x after n iterations Automated Complexity Analysis of Rewrite Systems 8

  25. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x − n : value of x after n iterations z + y · n : value of z after n iterations Automated Complexity Analysis of Rewrite Systems 8

  26. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x − n : value of x after n iterations z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  27. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x − n : value of x after n iterations z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  28. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x : maximal number of loop iterations x − n : value of x after n iterations z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  29. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x : maximal number of loop iterations 2 , x − 1 , . . . would be fine, too x x − n : value of x after n iterations z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  30. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x : maximal number of loop iterations 2 , x − 1 , . . . would be fine, too x x − n : value of x after n iterations search for metering function z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  31. Loop Acceleration Example (Loop Acceleration) 5 while ( x, y, z ) − → while ( x − 1 , y, z + y ) [ x > 0] 5 · n � while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 5 · n : cost of n iterations x : maximal number of loop iterations 2 , x − 1 , . . . would be fine, too x x − n : value of x after n iterations search for metering function z + y · n : value of z after n iterations Example (Recurrence Equations) x ( n − 1) − 1 x ( n ) = y ( n ) y ( n − 1) = z ( n − 1) + y ( n − 1) z ( n ) = Automated Complexity Analysis of Rewrite Systems 8

  32. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · n while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  33. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · n while ( x, y, z ) − − → while ( x − n, y, z + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  34. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · n while ( x, y, 0) − − → while ( x − n, y, 0 + y · n ) [ x > 0 ∧ 0 < n ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  35. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · n while ( x, y, 0) − − → while ( x − n, y, y · n ) [ x > 0 ∧ 0 < n ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  36. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · n while ( x, y, 0) − − → while ( x − n, y, y · n ) [ x > 0 ∧ 0 < n ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  37. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while ( x − x, y, y · x ) [ x > 0 ∧ 0 < x ≤ x ] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  38. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] Automated Complexity Analysis of Rewrite Systems 9

  39. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] 5 · x +2 init ( x, y ) − − − → return ( y · x ) [ x > 0 ∧ y ≥ 0] � Automated Complexity Analysis of Rewrite Systems 9

  40. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] 5 · x +2 init ( x, y ) − − − → return ( y · x ) [ x > 0 ∧ y ≥ 0] � Automated Complexity Analysis of Rewrite Systems 9

  41. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) → − return ( z ) [ x = 0] 5 · x +2 init ( x, y ) − − − → return ( y · x ) [ x > 0 ∧ y ≥ 0] � � whole program compressed into a single rule Automated Complexity Analysis of Rewrite Systems 9

  42. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] 5 · x +2 init ( x, y ) − − − → return ( y · x ) [ x > 0 ∧ y ≥ 0] � � whole program compressed into a single rule � lower bound 5 · x + 2 for all x > 0 , y ≥ 0 Automated Complexity Analysis of Rewrite Systems 9

  43. Chaining Example 1 init ( x, y ) − → while ( x, y, 0) [ x ≥ 0 ∧ y ≥ 0] 5 · x while ( x, y, 0) − − → while (0 , y, y · x ) [ x > 0] 1 while ( x, y, z ) − → return ( z ) [ x = 0] 5 · x +2 init ( x, y ) − − − → return ( y · x ) [ x > 0 ∧ y ≥ 0] � � whole program compressed into a single rule � lower bound 5 · x + 2 for all x > 0 , y ≥ 0 Works for arbitrary programs! Automated Complexity Analysis of Rewrite Systems 9

  44. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs Automated Complexity Analysis of Rewrite Systems 10

  45. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration Automated Complexity Analysis of Rewrite Systems 10

  46. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration many other features, e.g.: Automated Complexity Analysis of Rewrite Systems 10

  47. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration many other features, e.g.: non-determinism Automated Complexity Analysis of Rewrite Systems 10

  48. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration many other features, e.g.: non-determinism asymptotic bounds Automated Complexity Analysis of Rewrite Systems 10

  49. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration many other features, e.g.: non-determinism asymptotic bounds recursive void functions SMT encodings . . . Automated Complexity Analysis of Rewrite Systems 10

  50. Lower Bounds for ITSs – Wrap-Up first technique to infer worst case lower bounds for ITSs key idea: loop acceleration many other features, e.g.: LoAT Ω( n 2 ) Ω( n 3 ) Ω( n 4 ) non-determinism rc ( n ) Ω(1) Ω( n ) EXP ∞ Best Upper Bound O (1) (132) – – – – – – asymptotic bounds O ( n ) 37 126 – – – – – recursive void functions O ( n 2 ) 8 14 35 – – – – SMT encodings O ( n 3 ) 2 – 2 1 – – – O ( n 4 ) 1 – – – 2 – – . . . EXP – – – – – 5 – ∞ 53 31 1 – – – 176 Automated Complexity Analysis of Rewrite Systems 10

  51. Outline 1 Introduction 2 Lower Bounds for ITSs 3 Lower Bounds for TRSs 4 Constant Upper Bounds for TRSs Automated Complexity Analysis of Rewrite Systems 11

  52. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Automated Complexity Analysis of Rewrite Systems 12

  53. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) Automated Complexity Analysis of Rewrite Systems 12

  54. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] Automated Complexity Analysis of Rewrite Systems 12

  55. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] − → cons ( 0 , inf ( s ( 0 ))) Automated Complexity Analysis of Rewrite Systems 12

  56. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] − → cons ( 0 , inf ( s ( 0 ))) [ y/ s ( 0 )] Automated Complexity Analysis of Rewrite Systems 12

  57. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] − → cons ( 0 , inf ( s ( 0 ))) [ y/ s ( 0 )] − → cons ( 0 , cons ( s ( 0 ) , inf ( s ( s ( 0 ))))) Automated Complexity Analysis of Rewrite Systems 12

  58. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] − → cons ( 0 , inf ( s ( 0 ))) [ y/ s ( 0 )] − → cons ( 0 , cons ( s ( 0 ) , inf ( s ( s ( 0 ))))) [ y/ s ( s ( 0 ))] Automated Complexity Analysis of Rewrite Systems 12

  59. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Example (Evaluation) inf ( 0 ) [ y/ 0 ] − → cons ( 0 , inf ( s ( 0 ))) [ y/ s ( 0 )] − → cons ( 0 , cons ( s ( 0 ) , inf ( s ( s ( 0 ))))) [ y/ s ( s ( 0 ))] − → . . . Automated Complexity Analysis of Rewrite Systems 12

  60. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Loop Automated Complexity Analysis of Rewrite Systems 12

  61. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( y ))) Loop = ⇒ Non-Termination Automated Complexity Analysis of Rewrite Systems 12

  62. Evaluating TRSs Example (TRS) inf ( y ) − → cons ( y, inf ( s ( 0 ))) Loop = ⇒ Non-Termination Automated Complexity Analysis of Rewrite Systems 12

  63. Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( x ′ )) Automated Complexity Analysis of Rewrite Systems 13

  64. Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( x ′ )) Loop Automated Complexity Analysis of Rewrite Systems 13

  65. Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( x ′ )) Decreasing Loop Loop Automated Complexity Analysis of Rewrite Systems 13

  66. Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( x ′ )) Decreasing Loop = ⇒ Linear Lower Bound Loop Automated Complexity Analysis of Rewrite Systems 13

  67. � Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( nil )) Decreasing Loop = ⇒ Linear Lower Bound Loop Automated Complexity Analysis of Rewrite Systems 13

  68. Decreasing Loops Example length ( cons ( x, x ′ )) − → s ( length ( x ′ )) Decreasing Loop = ⇒ Linear Lower Bound Loop Automated Complexity Analysis of Rewrite Systems 13

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

Termination of Rewrite Systems (Overview) 15ai Q: Why should we want terminating rewrite systems?

Termination of Rewrite Systems (Overview) 15ai Q: Why should we want terminating rewrite systems?

Termination of Rewrite Systems (Overview) 15ai Q: Why should we want terminating rewrite systems? A: Weve seen that to be useful a set of rewrite rules should be complete; to check completeness uses the Knuth Bendix procedure; AUTOMATED

189 views • 6 slides
Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems Naohi Eguchi Chiba

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems Naohi Eguchi Chiba

Complexity Analysis of Precedence Terminating Infinite Graph Rewrite Systems Naohi Eguchi Chiba University, Japan University of Innsbruck, Austria September 27, 2014 41st TRS meeting, Jozankei, Sapporo, Japan Introduction Complexity

392 views • 16 slides
Improved Certification of Complexity Proofs for Term Rewrite Systems Ren Thiemann IFIP WG 1.6,

Improved Certification of Complexity Proofs for Term Rewrite Systems Ren Thiemann IFIP WG 1.6,

Improved Certification of Complexity Proofs for Term Rewrite Systems Ren Thiemann IFIP WG 1.6, Dortmund, June 26 Supported by the Austrian Science Fund (FWF) project Y757 Overview IsaFoR + CeTA: Certifying Termination and Complexity

610 views • 40 slides
Automated Reasoning Rewrite Rules Jacques Fleuriot Automated Reasoning Rewrite Rules Lecture

Automated Reasoning Rewrite Rules Jacques Fleuriot Automated Reasoning Rewrite Rules Lecture

Automated Reasoning Rewrite Rules Jacques Fleuriot Automated Reasoning Rewrite Rules Lecture 8, page 1 Term Rewriting Rewriting is a technique for replacing terms in an expression with equivalent terms useful for simplification, e.g.

485 views • 23 slides
Termination of Rewrite Systems (I) 15ai (based on Dershowitz, JSC, 3, 87) Some basic properties

Termination of Rewrite Systems (I) 15ai (based on Dershowitz, JSC, 3, 87) Some basic properties

Termination of Rewrite Systems (I) 15ai (based on Dershowitz, JSC, 3, 87) Some basic properties relevant for termination: (note: s t means s&gt;t or s=t) AUTOMATED REASONING Monotonicity: if t&gt;u then f(t) &gt; f(u).

214 views • 4 slides
Towards Safety Analysis of Interactions Between Human Users and Automated Driving Systems

Towards Safety Analysis of Interactions Between Human Users and Automated Driving Systems

10th European Congress on Embedded Real-Time Systems - ERTS 2020 Towards Safety Analysis of Interactions Between Human Users and Automated Driving Systems Fredrik Warg Stig Ursing Martin Kaalhus Richard Wiik Safety of Automated Driving

762 views • 19 slides
Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University,

Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University,

Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany VTSA 12, Saarbr ucken, Germany Overview I. Termination of Term Rewriting 1 Termination of Term Rewrite Systems 2 Non-Termination of Term

1.47k views • 133 slides
Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University,

Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University,

Automated Termination Analysis J urgen Giesl LuFG Informatik 2, RWTH Aachen University, Germany VTSA 12, Saarbr ucken, Germany Overview I. Termination of Term Rewriting 1 Termination of Term Rewrite Systems 2 Non-Termination of Term

1.93k views • 148 slides
Confluence of Layered Rewrite Systems Jean-Pierre Jouannaud Jiaxiang Liu and Mizuhito Ogawa 24th

Confluence of Layered Rewrite Systems Jean-Pierre Jouannaud Jiaxiang Liu and Mizuhito Ogawa 24th

Confluence of Layered Rewrite Systems Jean-Pierre Jouannaud Jiaxiang Liu and Mizuhito Ogawa 24th CSL, Berlin, September 6, 2015 Outline 1 Problem and Result 2 Layered rewrite systems 3 Sub-rewriting 4 Cyclic unification 5 Decreasing diagrams 6

437 views • 39 slides
Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking

Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking

Automated Reasoning LTL Model Checking Alan Bundy Automated Reasoning LTL Model Checking Lecture 9, page 1 Introduction So far we have looked at theorem proving Powerful, especially where good sets of rewrite rules or decision procedures

639 views • 26 slides
Rewrite Rules Automated Reasoning Recall: Equation used from lhs to rhs For example, for a e

Rewrite Rules Automated Reasoning Recall: Equation used from lhs to rhs For example, for a e

329 views • 5 slides
Safety Analysis of Systems Aaron R. Bradley Stanford University Safety Analysis of Systems

Safety Analysis of Systems Aaron R. Bradley Stanford University Safety Analysis of Systems

Safety Analysis of Systems Aaron R. Bradley Stanford University Safety Analysis of Systems 1/39 Why Analyze Systems? Two trends: increasing prominence in controlling and decision-making roles rising complexity (multi-core

1.16k views • 86 slides
AI powered automated imaging and analysis workflows for EM systems Jrme Hummel, Guilhem

AI powered automated imaging and analysis workflows for EM systems Jrme Hummel, Guilhem

AI powered automated imaging and analysis workflows for EM systems Jrme Hummel, Guilhem Preti, David Tourais, Rmi Blanc, Quentin Lavigne, Eric Goergen* The world leader in serving science Introducing Avizo2D with AI Blurring the line

573 views • 20 slides
Nominal Completion for Rewrite Systems with Binders Maribel Fern andez Kings College

Nominal Completion for Rewrite Systems with Binders Maribel Fern andez Kings College

Nominal Completion for Rewrite Systems with Binders Maribel Fern andez Kings College London July 2012 Joint work with Albert Rubio M. Fern andez Nominal Completion for Rewrite Systems with Binders Summary Motivations Nominal

791 views • 44 slides
Automated Reasoning for Systems Engineering Laura Kov acs Vienna University of Technology

Automated Reasoning for Systems Engineering Laura Kov acs Vienna University of Technology

Automated Reasoning for Systems Engineering Laura Kov acs Vienna University of Technology Future and Our Motivation 1. Automated reasoning, in particular theorem proving will remain central in software verification and program analysis.

881 views • 69 slides
Proof Systems and Proof Complexity Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/

Proof Systems and Proof Complexity Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/

Proof Systems and Proof Complexity Marijn J.H. Heule http://www.cs.cmu.edu/~mheule/15816-f19/ Automated Reasoning and Satisfiability, September 24, 2019 Certificates What makes a problem hard? Certificate angle: can one efficiently check an

1.11k views • 107 slides
Efficient Graph Rewriting York Semigroup Graham Campbell May 2019 Graham Campbell Efficient

Efficient Graph Rewriting York Semigroup Graham Campbell May 2019 Graham Campbell Efficient

Graphs and Labelling Graph Transformation Efficient Rewriting Confluence Analysis Efficient Graph Rewriting York Semigroup Graham Campbell May 2019 Graham Campbell Efficient Graph Rewriting Graphs and Labelling Graph Transformation

1.09k views • 70 slides
A Rho calculus for graph rewriting Clara Bertolissi joint work with Horatiu Cirstea, and Claude

A Rho calculus for graph rewriting Clara Bertolissi joint work with Horatiu Cirstea, and Claude

EX &amp; P 4 L T A A Rho calculus for graph rewriting Clara Bertolissi joint work with Horatiu Cirstea, and Claude Kirchner (LORIA) &amp; Paolo Baldan, and Furio Honsell (Univ.UDINE/VENEZIA) Clara Bertolissi RHO WORKSHOP, March 12, 2004

862 views • 17 slides
B ohm Reduction in Infinitary Term Graph Rewriting Systems Patrick Bahr IT University of

B ohm Reduction in Infinitary Term Graph Rewriting Systems Patrick Bahr IT University of

B ohm Reduction in Infinitary Term Graph Rewriting Systems Patrick Bahr IT University of Copenhagen Overview 1. Motivation Why term graphs? Why infinitary term graph rewriting? Why B ohm reduction? 2. B ohm Reduction on

1.27k views • 115 slides
O mputational gic L Complexity Analysis by Graph Rewriting Martin Avanzini and Georg Moser

O mputational gic L Complexity Analysis by Graph Rewriting Martin Avanzini and Georg Moser

C O mputational gic L Complexity Analysis by Graph Rewriting Martin Avanzini and Georg Moser Computational Logic Faculty of Computer Science, University of Innsbruck FLOPS 2010 MA&amp; GM (ICS @ UIBK) Complexity Analysis of Graph Rewriting

1.28k views • 95 slides
Rewriting structured cospans Daniel Cicala SYCO 4 22 May 2019 outline motivation part i.

Rewriting structured cospans Daniel Cicala SYCO 4 22 May 2019 outline motivation part i.

Rewriting structured cospans Daniel Cicala SYCO 4 22 May 2019 outline motivation part i. part ii. structured cospans rewriting structured cospans part iii. inductive rewriting part iv. part i. motivation motivation Systems abound.

841 views • 42 slides
Prefix Rewriting and the Pushdown Hierarchy Wolfgang Thomas Francqui Lecture, Mons, April 2013

Prefix Rewriting and the Pushdown Hierarchy Wolfgang Thomas Francqui Lecture, Mons, April 2013

Prefix Rewriting and the Pushdown Hierarchy Wolfgang Thomas Francqui Lecture, Mons, April 2013 Reachability Problem Wolfgang Thomas Overview 1. Prefix Rewriting and the reachability problem 2. Interpretations 3. Unfoldings and Muchniks

501 views • 39 slides
Structural counter abstraction Proving fair-termination of depth bounded systems Kshitij Bansal 1

Structural counter abstraction Proving fair-termination of depth bounded systems Kshitij Bansal 1

Structural counter abstraction Proving fair-termination of depth bounded systems Kshitij Bansal 1 with Eric Koskinen 1 , Thomas Wies 1 , Damien Zufferey 2 1 New York University 2 IST Austria March 18, 2013 TACAS, Rome, Italy Introduction

714 views • 32 slides
Formalizing CyberPhysical System Model Transformation via Abstract Interpretation Natasha

Formalizing CyberPhysical System Model Transformation via Abstract Interpretation Natasha

Formalizing CyberPhysical System Model Transformation via Abstract Interpretation Natasha Jarus, Sahra Sedigh Sarvestani, and Ali Hurson Department of Electrical and Computer Engineering Missouri University of Science and Technology Rolla,

432 views • 21 slides

More recommend