'Flow insensitive' diaporamas de présentation

Pointer analysis

Pointer analysis. p. t. l. S1. S2. Flow insensitive loss of precision. S1: l := new Cons. Flow-insensitive Soln (Andersen). Flow-sensitive Soln. p := l. p. t. l. S1. S2. S2: t := new Cons. p. t. l. S1. S2. *p := t. p. t. l. S1. S2. p := t. p. t. l. S1. S2.

916 views • 90 slides

CMPUT680 - Winter 2006

591 views • 59 slides

Interprocedural Analysis and Optimization

Interprocedural Analysis and Optimization. Chapter 11, through Section 11.2.4. Introduction. Interprocedural Analysis Gathering information about the whole program instead of a single procedure Interprocedural Optimization

434 views • 42 slides

Intraprocedural Points-to Analysis

Intraprocedural Points-to Analysis. Flow functions:. Pointers to dynamically-allocated memory. Handle statements of the form: x := new T One idea: generate a new variable each time the new statement is analyzed to stand for the new location:. Example. l := new Cons. p := l. t := new Cons.

363 views • 36 slides

Flow insensitivity and imprecision

Flow insensitivity and imprecision. If you ignore flow, then you lose precision. main() { x := &y; ... x := &z; }. Flow insensitive analysis tells us that x may point to z here!. But, insensitivity may alleviate two bottlenecks: (1) space : mem exhausted by large programs

327 views • 23 slides

Flow insensitive pointer analysis: fixed

268 views • 19 slides