This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: in[x] ± subclasses(C)] T F out[1] = in[x & in[x] – subclasses(C) ] Limitations of intraproc analysis Profileguided class prediction Specialization 5 Flow insensitive interproc class analysis Example CHA algorithm • Compute appliestoset: for each method, determine the set of classes the method applies to. • At a message send a.m, take the set of classes inferred for a, and check if this set overlaps with the appliesto sets of all methods that implement m. • If only one set overlaps, then the message send should go to that method. Example Example Improvements 6 Flowsensitive interproc class analysis Algorithm Problem Partial transfer functions...
View
Full Document
 Fall '06
 Lerner
 Set Theory, Subroutine, class analysis, flow functions, Cousot

Click to edit the document details