residual monitoring of safety properties
play

Residual Monitoring of Safety Properties Prove what you can and - PowerPoint PPT Presentation

Sep 14, 2023 •483 likes •1.84k views

Residual Monitoring of Safety Properties Prove what you can and monitor the leftovers Matthew Dwyer joint work with Rahul Purandare, Sebastian Elbaum, Madeline Diep, and Alex Kinneer Department of Computer Science and Engineering Reality Check

  1. Dynamic Typestate Analysis sc = …open() [1] close sc.connect(…) close [1] open connect sc.read(…) 1 2 3 [5] read, write read, write sc.write(…) [4] read, write, connect connect, close err sc != null sc.close(); return

  2. Dynamic Typestate Analysis sc = …open() [1] close sc.connect(…) close [1] open connect sc.read(…) 1 2 3 [5] read, write read, write sc.write(…) [4] read, write, connect connect, close err sc != null sc.close(); return

  3. Dynamic Typestate Analysis sc = …open() [1] close sc.connect(…) close [1] open connect sc.read(…) 1 2 3 [5] read, write read, write sc.write(…) [4] read, write, connect connect, close err sc != null sc.close(); [1] return

  4. Dynamic Typestate Analysis sc = …open() [1] close sc.connect(…) close [1] open connect sc.read(…) 1 2 3 [5] read, write read, write sc.write(…) [4] read, write, connect connect, close err sc != null sc.close(); [1] return

  5. Leveraging Static Typestate Analysis {1} sc = …open() {1} {2} sc.connect(…) {3} {2} sc.read(…) {3} {3} {3} sc.write(…) {3} {3} sc != null {1,2,3} {1,2,3} sc.close(); {1, err} return {1, 2, 3, err}

  6. Leveraging Static Typestate Analysis sc = …open() [1] sc.connect(…) [1] sc.read(…) [5] sc.write(…) [4] sc != null sc.close(); [1] return

  7. Leveraging Static Typestate Analysis sc = …open() [1] sc.connect(…) [1] sc.read(…) sc.write(…) sc != null sc.close(); [1] return

  8. Safe Region A single-entry region, , of a control flow graph such that where

  9. Safe Region A region of a control flow graph for which – all paths have the same cumulative effect on the typestate FSA – no transitions from a non-error state to error state

  10. Safe Region A region of a control flow graph for which – all paths have the same cumulative effect on the typestate FSA – no transitions from a non-error state to error state 1

  11. Safe Region A region of a control flow graph for which – all paths have the same cumulative effect on the typestate FSA – no transitions from a non-error state to error state 1 2

  12. Safe Region A region of a control flow graph for which – all paths have the same cumulative effect on the typestate FSA – no transitions from a non-error state to error state 1 2

  13. Safe Region A region of a control flow graph for which – all paths have the same cumulative effect on the typestate FSA – no transitions from a non-error state to error state 1 2

  14. Example of Safe Region err 1 2 3 r1 1 -> 3 r2 2 -> 1 3 -> 2 r3 err -> err r4

  15. Example of Safe Region err 1 2 3 r1 r2 r3 r4

  16. Reachably Safe Region Not all states of a property reach all program points in a typestate analysis Reachably Safe Region – A region of a control flow graph which is safe relative to the subset of the typestates that may reach its entry

  17. Example of Reachably Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  18. Example of Reachably Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  19. Example of Reachably Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  20. Example of Reachably Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  21. Example of Reachably Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  22. Identity Safe Region • Identity Safe Region – A special case of a (reachably) safe region that yields identity summary on the subset of the typestates that may reach its entry

  23. Example of Identity Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  24. Example of Identity Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  25. Example of Identity Safe Region err 1 2 3 public void simplifiedTransformData() { SocketChannel sc; open ByteBuffer buf; sc = SocketChannel.open(); connect sc.connect( new InetSocketAddress(…)); while while (sc.read(buf) != -1){ sc.write(buf); if } if (sc != null ) sc.close(); }

  26. Algorithm Basic Steps 1. Reduces a control flow graph region to a sequence of single entry regions 2. Calls static typestate analysis to calculate functional summaries of reachable program regions 3. Within a region, identify candidate safe regions by marking boundaries that cannot be crossed by any safe region 4. Identify safe regions inside candidate safe regions 5. Drop (and if required, add) FSA transitions for safe regions 6. Repeat the steps for all regions that lie outside safe regions

  27. Algorithm Basic Steps 1. Reduces a control flow graph region to a sequence of single entry regions 2. Calls static typestate analysis to calculate functional summaries of reachable program regions 3. Within a region, identify candidate safe regions by marking boundaries that cannot be crossed by any safe region 4. Identify safe regions inside candidate safe regions 5. Drop (and if required, add) FSA transitions for safe regions 6. Repeat the steps for all regions that lie outside safe regions

  28. Reduce Control Flow Graph public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); sc.read(…) sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ sc.write(…) sc.write(buf); } if (sc != null ) sc != null sc.close(); } sc.close(); return

  29. Reduce Control Flow Graph public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); sc.read(…) sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ sc.write(…) sc.write(buf); } if (sc != null ) sc != null sc.close(); } sc.close(); return

  30. Reduce Control Flow Graph public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); while … sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ sc != null sc.write(buf); } if (sc != null ) sc.close(); sc.close(); } return

  31. Reduce Control Flow Graph public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); while… sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ sc != null sc.write(buf); } if (sc != null ) sc.close(); sc.close(); } return

  32. Reduce Control Flow Graph public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); while… sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ if… sc.write(buf); } if (sc != null ) return sc.close(); }

  33. Algorithm Basic Steps 1. Reduces a control flow graph region to a sequence of single entry and single exit regions 2. Calls static typestate analysis to calculate functional summaries of reachable program regions 3. Within a region, identify candidate safe regions by marking boundaries that cannot be crossed by any safe region 4. Identify safe regions inside candidate safe regions 5. Drop (and if required, add) FSA transitions for safe regions 6. Repeat the steps for all regions that lie outside safe regions

  34. Calculate Functional Summary public void simplifiedTransformData() sc = …open() { SocketChannel sc; sc.connect(…) ByteBuffer buf; sc = SocketChannel.open(); while… 3->3 sc.connect( new InetSocketAddress(…)); while (sc.read(buf) != -1){ if… sc.write(buf); } if (sc != null ) return sc.close(); }

  35. Algorithm Basic Steps 1. Reduces a control flow graph region to a sequence of single entry regions 2. Calls static typestate analysis to calculate functional summaries of reachable program regions 3. Within a region, identify candidate safe regions by marking boundaries that cannot be crossed by any safe region 4. Identify safe regions inside candidate safe regions 5. Drop (and if required, add) FSA transitions for safe regions 6. Repeat the steps for all regions that lie outside safe regions

  36. Identify Candidate Safe Regions err 1 2 3 r1 r2 r3 r4 r5 r6

  37. Identify Candidate Safe Regions err 1 2 3 r1 r2 r3 r4 r5 r6

  38. Identify Candidate Safe Regions r1 err 1 2 3 r1 1->{1,2} 3->{3} r1 r2 r3 r4 r5 r6 Region Matrix

  39. Identify Candidate Safe Regions r1 err 1 2 3 r1 1->{1,2} 3->{3} r1 r2 r3 r4 r5 r6 Region Matrix

  40. Identify Candidate Safe Regions r1 r2 err 1 2 3 1->{1,2} 1->{2} r1 3->{3} 3->{3} r1 1->{2} r2 2->{2} r2 3->{3} r3 r4 r5 r6 Region Matrix

  41. Identify Candidate Safe Regions r1 r2 err 1 2 3 1->{1,2} 1->{2} r1 3->{3} 3->{3} r1 1->{2} r2 2->{2} r2 3->{3} r3 r4 r5 r6 Region Matrix

  42. Identify Candidate Safe Regions r1 r2 err 1 2 3 1->{1,2} 1->{2} r1 3->{3} 3->{3} r1 1->{2} r2 2->{2} r2 3->{3} r3 r4 r5 r6 Region Matrix

  43. Identify Candidate Safe Regions r1 r2 r3 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} r2 2->{2} 2->{1,2} r2 3->{3} 3->{3} r3 2->{1,2} r3 3->{3} r4 r5 r6 Region Matrix

  44. Identify Candidate Safe Regions r1 r2 r3 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} r2 2->{2} 2->{1,2} r2 3->{3} 3->{3} r3 2->{1,2} r3 3->{3} r4 r5 r6 Region Matrix

  45. Identify Candidate Safe Regions r1 r2 r3 r4 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} r4 1->{2} 2->{1} r4 r5 3->{3} r6 Region Matrix

  46. Identify Candidate Safe Regions r1 r2 r3 r4 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} r4 1->{2} 2->{1} r4 r5 3->{3} r6 Region Matrix

  47. Identify Candidate Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  48. Identify Candidate Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  49. Identify Candidate Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  50. Algorithm Basic Steps 1. Reduces a control flow graph region to a sequence of single entry regions 2. Calls static typestate analysis to calculate functional summaries of reachable program regions 3. Within a region, identify candidate safe regions by marking boundaries that cannot be crossed by any safe region 4. Identify safe regions inside candidate safe regions 5. Drop (and if required, add) FSA transitions for safe regions 6. Repeat the steps for all regions that lie outside safe regions

  51. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  52. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  53. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  54. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  55. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  56. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  57. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  58. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  59. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  60. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  61. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

  62. Identify Safe Regions r1 r2 r3 r4 r5 err 1 2 3 1->{1,2} 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r1 3->{3} 3->{3} 3->{3} 3->{3} 3->{3} r1 1->{2} 1->{1,2} 1->{1,2} 1->{1,2} r2 2->{2} 2->{1,2} 2->{1,2} 2->{1,2} r2 safe 3->{3} 3->{3} 3->{3} 3->{3} r3 2->{1,2} 2->{1,2} 2->{1,2} r3 3->{3} 3->{3} 3->{3} r4 1->{2} 1->{1} 2->{1} 2->{2} r4 identity r5 3->{3} 3->{3} 1->{2} r6 Region Matrix r5 2->{1} 3->{3}

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

Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual?

Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual?

The Perpetual Pipeline Strategies and conversations behind securing a Residual Bequest Agenda 1. Why Residual? 2. Structured for Residual 3. Residual Results 4. Residual Strategy 5. Residual Relationships 6. Residual Data 7.

1.17k views • 43 slides
Monitoring Minimal Residual Disease in AML with molecular markers Giuseppe Saglio University of

Monitoring Minimal Residual Disease in AML with molecular markers Giuseppe Saglio University of

Monitoring Minimal Residual Disease in AML with molecular markers Giuseppe Saglio University of Turin, Italy 23 genes recurrently mutated in AML The Cancer Genome Atlas Research Network, New Engl J Med 2013;368:20592074. Challenges to

679 views • 48 slides
STATISTICAL PROPERTIES OF QUIET SPACE WEATHER NOTRHERN ADRIATIC RESIDUAL GPS IONOSPHERIC DELAY

STATISTICAL PROPERTIES OF QUIET SPACE WEATHER NOTRHERN ADRIATIC RESIDUAL GPS IONOSPHERIC DELAY

NAV08/ILA37 Conference, Westminster, London, UK 28 - 30 October 2008 STATISTICAL PROPERTIES OF QUIET SPACE WEATHER NOTRHERN ADRIATIC RESIDUAL GPS IONOSPHERIC DELAY Renato Filjar 1 , Josip Kasum 2 , Serdjo Kos 3, Marko evrovi 4 1 The Royal

161 views • 14 slides
Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for

Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for

Efficient Model Checking of Safety Properties Timo Latvala timo.latvala@hut.fi Laboratory for Theoretical Computer Science Helsinki University of Technology Finland Spin 2003 p.1/16 Introduction Safety properties properties

669 views • 44 slides
An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning

An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning

An Overview of Deep Residual Learning Semih Yagcioglu 01.03.2016 Deep Residual Learning Microsoft Research Asia (MSRA) Kaiming He, Xiangyu Zhang, Shaoqing Ren, & Jian Sun. Deep Residual Learning for Image Recognition. arXiv

1.32k views • 54 slides
Content Variations on CUSUM tests for flutter monitoring Introduction Mich` ele Basseville,

Content Variations on CUSUM tests for flutter monitoring Introduction Mich` ele Basseville,

Content Variations on CUSUM tests for flutter monitoring Introduction Mich` ele Basseville, Laurent Mevel, Rafik Zouari Subspace-based residual for modal monitoring IRISA (CNRS & INRIA), Rennes, France CUSUM test for monitoring a scalar

700 views • 5 slides
Modeling of thermal properties of peat soil Dyukarev E.A. Institute of monitoring of climatic

Modeling of thermal properties of peat soil Dyukarev E.A. Institute of monitoring of climatic

Modeling of thermal properties of peat soil Dyukarev E.A. Institute of monitoring of climatic and ecological systems SB RAS, Tomsk n Peat deposit is a complex organic-mineral system with specific properties. Peat layers has high porosity,

672 views • 31 slides
Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s

Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s

Clarifying Residual Flow s for Surface Water Takes August 2017 Clarifying Residual Flow s Purpose of consultation is to clarify: The difference between residual and minimum flows Purpose of the plan change Who may be affected

517 views • 16 slides
COVID-19 vaccine safety monitoring Tom Shimabukuro, MD, MPH, MBA CDC COVID-19 Vaccine Planning

COVID-19 vaccine safety monitoring Tom Shimabukuro, MD, MPH, MBA CDC COVID-19 Vaccine Planning

National Center for Immunization & Respiratory Diseases COVID-19 vaccine safety monitoring Tom Shimabukuro, MD, MPH, MBA CDC COVID-19 Vaccine Planning Unit (VPU) Vaccine Safety Team On behalf of: August 26, 2020 Safety is a priority

643 views • 32 slides
Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2017 1 Residual

Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2017 1 Residual

Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2017 1 Residual Analysis 2 3 Atmospheric CO 2 (ppm) from Mauna Loa 360 co2 350 1988 1992 1996 date Where to start? Well, it looks like stuff is going up on

821 views • 44 slides
Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2018 1 Residual

Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2018 1 Residual

Lecture 3 Residual Analysis + Generalized Linear Models Colin Rundel 1/23/2018 1 Residual Analysis 2 3 Atmospheric CO 2 (ppm) from Mauna Loa 360 co2 350 1988 1992 1996 date Where to start? Well, it looks like stuff is going up on

509 views • 47 slides
Residual Flows for Invertible Generative Modeling Ricky T. Q. Chen, Jens Behrmann, David

Residual Flows for Invertible Generative Modeling Ricky T. Q. Chen, Jens Behrmann, David

Residual Flows for Invertible Generative Modeling Ricky T. Q. Chen, Jens Behrmann, David Duvenaud, Jrn-Henrik Jacobsen Invertible Residual Networks (i-ResNet) It can be shown that residual blocks can be inverted by fixed-point iteration and

442 views • 16 slides
Lecture 9: Residual Analysis Instructor: Prof. Shuai Huang Industrial and Systems Engineering

Lecture 9: Residual Analysis Instructor: Prof. Shuai Huang Industrial and Systems Engineering

Lecture 9: Residual Analysis Instructor: Prof. Shuai Huang Industrial and Systems Engineering University of Washington Residual Analysis (a.k.a. Model Diagnostics) Residual versus fitted values The residuals, by definition, form the

352 views • 10 slides
DYNAMICS : THE RESIDUAL DISTRIBUTION POINT OF VIEW . A PPLICATION TO LAMINAR AND TURBULENT FLOWS

DYNAMICS : THE RESIDUAL DISTRIBUTION POINT OF VIEW . A PPLICATION TO LAMINAR AND TURBULENT FLOWS

Motivating example Residual distribution schemes (RDS) The viscous case Application to NS equations Conclusion-Perspectives N ON OSCILLATORY FEM- LIKE SCHEMES FOR COMPRESSIBLE FLUID DYNAMICS : THE RESIDUAL DISTRIBUTION POINT OF VIEW . A

1.27k views • 124 slides
SPOT Farm East (Elveden) 2016 Residual Herbicide Demonstration Report Background The urea

SPOT Farm East (Elveden) 2016 Residual Herbicide Demonstration Report Background The urea

SPOT Farm East (Elveden) 2016 Residual Herbicide Demonstration Report Background The urea based selective residual herbicide active linuron has been the major residual herbicide applied to the potato crop of the UK on loamy and sandy loam

724 views • 45 slides
Making Runtime Monitoring of Parametric Properties Practical - PhD Thesis Defense - Dongyun Jin

Making Runtime Monitoring of Parametric Properties Practical - PhD Thesis Defense - Dongyun Jin

Making Runtime Monitoring of Parametric Properties Practical - PhD Thesis Defense - Dongyun Jin Department of Computer Science University of Illinois at Urbana-Champaign Thesis Advisor Grigore Rosu Committee Members Klaus Havelund Gul Agha

662 views • 49 slides
Application of Differential Algebra to the Quasi-Steady State Approximation in Biology and Physics

Application of Differential Algebra to the Quasi-Steady State Approximation in Biology and Physics

Application of Differential Algebra to the Quasi-Steady State Approximation in Biology and Physics Franois Lemaire Universit de Lille I (France) Symbolic Computation Team (Boulier, Oussous, Petitot, Sedoglavic) Differential Algebra and

751 views • 60 slides
Chemical Thermodynamics Example Assume vapor pressure of the components in solution can be

Chemical Thermodynamics Example Assume vapor pressure of the components in solution can be

Chemical Thermodynamics Example Assume vapor pressure of the components in solution can be represented by a 2 * X P X P e 2 1 1 1 a 2 * X P X P e 1 2 2 2 What is the relationship between a and b ?

602 views • 8 slides
Strong Turing Completeness of Continuous Chemical Reaction Networks Amaury Pouly Joint work with

Strong Turing Completeness of Continuous Chemical Reaction Networks Amaury Pouly Joint work with

Strong Turing Completeness of Continuous Chemical Reaction Networks Amaury Pouly Joint work with Olivier Bournez, Franois Fages, Guillaume Le Guludec and Daniel Graa 10 october 2018 1 / 20 Chemical Reaction Networks A reaction system is

1.06k views • 89 slides
Reconstructing Chemical Reaction Networks by Solving Boolean Polynomial Systems Chenqi Mou Wei

Reconstructing Chemical Reaction Networks by Solving Boolean Polynomial Systems Chenqi Mou Wei

Reconstructing Chemical Reaction Networks by Solving Boolean Polynomial Systems Chenqi Mou Wei Niu LMIB-School of Mathematics Ecole Centrale P ekin and Systems Science Beihang University, Beijing 100191, China chenqi.mou,

351 views • 23 slides
FATAL ACCIDENT INQUIRIES AND PUBLIC INQUIRIES: A NEW LANDSCAPE? Murdo MacLeod QC Barney Ross,

FATAL ACCIDENT INQUIRIES AND PUBLIC INQUIRIES: A NEW LANDSCAPE? Murdo MacLeod QC Barney Ross,

FATAL ACCIDENT INQUIRIES AND PUBLIC INQUIRIES: A NEW LANDSCAPE? Murdo MacLeod QC Barney Ross, Advocate Compass Conference 18 th November 2016 Background Creatures of statute: Fatal Accidents Inquiry (Scotland) Act 1895 Fatal Accidents

1.08k views • 44 slides
ELECTROCHEMICAL OXIDATION: Direct And Indirect Electrochemical Oxidation, Electrode Materials

ELECTROCHEMICAL OXIDATION: Direct And Indirect Electrochemical Oxidation, Electrode Materials

CEE 597T Electrochemical Water and Wastewater Treatment UNIT 4 ELECTROCHEMICAL OXIDATION: Direct And Indirect Electrochemical Oxidation, Electrode Materials ELE LECT CTROO OOXI XIDATION ON OF OF OR ORGAN ANIC IC MA MATER TERIALS

867 views • 41 slides
EMBRACE STEMI A phase 2a, randomized, double-blind, placebo- controlled trial to evaluate the

EMBRACE STEMI A phase 2a, randomized, double-blind, placebo- controlled trial to evaluate the

EMBRACE STEMI A phase 2a, randomized, double-blind, placebo- controlled trial to evaluate the safety, tolerability, and efficacy of intravenous Bendavia on reperfusion injury in patients treated with standard therapy including primary

1.26k views • 27 slides
OSA and Cancer?! Robert L. Owens, MD February 2018 Outline OSA and Cancer?! Potential

OSA and Cancer?! Robert L. Owens, MD February 2018 Outline OSA and Cancer?! Potential

2/13/2018 OSA and Cancer?! Robert L. Owens, MD February 2018 Outline OSA and Cancer?! Potential Mechanisms? Limitations of the Data OSA and Cancer occur all the time 1 2/13/2018 Thoracic pressure swings (LV aerload) 2

502 views • 17 slides

More recommend