points_to_by_type_inference_slides

# points_to_by_type_inference_slides - Points-to Analysis by...

This preview shows pages 1–7. Sign up to view the full content.

Points-to Analysis by Type Inference of Programs with Structures and Unions Bjarne Steensgaard

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Language S ::= x = S y | x = S &y | x = S *y | x = S allocate(y) | x = S op(y 1 …y n ) | x = S &y->n | x = S fun(f 1 …f n )->(r 1 …r m ) S* | x 1 …x m = S1…Sm p(y 1 …y n )
Types τ ::= | simple simple ( α , λ ,s,p) | struct struct (m,s,p) | object object object object ( α , λ ,s,p) | blank blank blank blank (s,p) Tracking Size s = SIZE | Offset α=τ×ο Struct elements m = [ID τ ] map Inconsistent usage

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Types object object object object simple simple simple simple struct struct struct blank blank blank blank 1 ×ο 1 29 2 ×ο 2 29 s a S b Partial ordering tracks information flow between assigned-from location and assigned-to location. Sizes and offsets must be accommodated.
Expressiveness Aggregates Unions Data size

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
int * a; struct { int b, int c } * d; a = &d->c; Algorithm starts off with Input:
This is the end of the preview. Sign up to access the rest of the document.

## This note was uploaded on 02/24/2012 for the course CSE 503 taught by Professor Davidnotikin during the Winter '11 term at University of Washington.

### Page1 / 13

points_to_by_type_inference_slides - Points-to Analysis by...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online