1 / 15

Summarizing Calling Contexts

Summarizing Calling Contexts. Prathmesh Prabhu. Looking up the peep hole. Tell them what you're going to tell them. Contextualize Function summaries Context summaries. Machinery WPDS Post star and pre star operations. Translation: the idea. The system in effect

tfancher
Download Presentation

Summarizing Calling Contexts

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Summarizing Calling Contexts Prathmesh Prabhu Looking up the peep hole

  2. Tell them what you're going to tell them

  3. Contextualize • Function summaries • Context summaries • Machinery • WPDS • Post star and pre star operations • Translation: the idea • The system in effect • Implementation & issues • Experiments & issues • Where do we go from here?

  4. Function Summaries mS c1 r1 mE mS pS pS p2 p3 pE c1 p1 p2 p1 Flow sensetive, Context sensetive, Path insensetive Analysis r1 p3 mE pE

  5. Function Summaries : recursion mS c1 r1 mE mS Summarize pS p1 pE pS Looking down The peep hole c1 c2 r2 p1 c2 pS p1 pE r1 r2 c2 r2 mE pE pS p1 pE c2 r2

  6. Context Summaries mS m1 c1 c3 pS p1 c2 r1 r3 r2 m2 pE mE

  7. Peep Up r3 c3 m2 mE m1 mS c1 r1 p1 pS pE pS p1 pE c2 r2 c2 r2 p1 pS pE up down pS p1 pE c2 r2 c2 r2

  8. Weighted Push Down Systems p1 p2 The Magic Slide!!! a / b (w) w (p1, a) (p2, b) Pre* Post*

  9. PDS - transformation Program mS Stack: program nodes pS c1 T(mS) (program, mS) (program, c1) p1 p2 T(c1) (program, c1) (program, pS . r1) T(pE) r1 p3 (program, pE) (program, * ) mE pE

  10. Collecting our paths up down T(mS) down down (down, mS ) (down, c1 ) Stack: T(c1) down down down (down, c1 ) (down, pS . r1 ) down mS T(pE) down c1 (down, pE ) (down, * ) mS T(mS) c1 c1 (up, mS ) (up, c1 )

  11. The reverse call T(pE) c1 # # (up, pE ) (up, r1 . pS ) c1 r1 T(c1) c1 (up, c1 ) (up, * ) pS pE And some more...

  12. Implementation • Affine Relations Analysis • TSL-VSA eax + 20 * edx = 0 esp + (-4) * ebp = 0 • EWPDS

  13. Experiments & Issues • TSL-VSA regression suite • Not representative • No promising results • Small real world binaries

  14. Future directions • Other simple analysis: live-flag-analysis, may-kill-use, L-ARA • Translation to application domain

  15. Thank you For your patience

More Related