program analysis via graph reachability.pptVIP

Program Analysis via Graph Reachability Thomas Reps University of Wisconsin PLDI ?00 Registration Form PLDI ?00: …………………….. $ ____ Tutorial (morning): …………… $ ____ Tutorial (afternoon): ………….. $ ____ Tutorial (evening): ……………. $ – 0 – Applications Program optimization Program-understanding and software-reengineering Security information flow Verification model checking security of crypto-based protocols for distributed systems . . . As Well As . . . Flow-insensitive points-to analysis Complexity results Linear . . . cubic . . . undecidable variants PTIME-completeness Model checking of recursive hierarchical finite-state machines “infinite”-state systems linear-time and cubic-time algorithms . . . And Also Analysis of attribute grammars Security of crypto-based protocols for distributed systems [Dolev, Even, Karp 83] Formal-language problems CFL-recognition (given G and ?, is ? ? L(G)?) 2DPDA- and 2NPDA-simulation Given M and ?, is ? ? L(M)? String-matching problems Unifying Conceptual Modelfor Dataflow-Analysis Literature Linear-time gen-kill [Hecht 76], [Kou 77] Path-constrained DFA [Holley Rosen 81] Linear-time GMOD [Cooper Kennedy 88] Flow-sensitive MOD [Callahan 88] Linear-time interprocedural gen-kill [Knoop Steffen 93] Linear-time bidirectional gen-kill [Dhamdhere 94] Relationship to interprocedural DFA [Sharir Pneuli 81], [Knoop Steffen 92] Collaborators Susan Horwitz Mooly Sagiv Genevieve Rosay David Melski David Binkley Michael Benedikt Patrice Godefroid Themes Harnessing CFL-reachability Relationship to other analysis paradigms Exhaustive alg. ? Demand alg. Understanding complexity Linear . . . cubic . . . undecidable Beyond CFL-reachability Program Slicing Backward Slice Backward Slice Slice Extraction Forward Slice Forward Slice Who Cares About Slices? Understanding programs Restructuring Programs Program Specialization and Reuse Program Differencing Testing (and Retesting) Year 2000 Problem Automatic Differentiation What Are Slices Useful