Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version)

Details Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version) Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version)

2012-03-09

arxiv.org/abs/1203.1986v1

Computer Science

Programming Languages

Scientific paper

Interprocedural flow analysis can be used to eliminate otherwise unnecessary heap allocated objects (unboxing), and in previous work we have shown how to do so while maintaining correctness with respect to the garbage collector. In this paper, we extend the notion of flow analysis to incorporate types, enabling analysis and optimization of typed programs. We apply this typed analysis to specify a type preserving interprocedural unboxing optimization, and prove that the optimization preserves both type and GC safety along with program semantics. We also show that the unboxing optimization can be applied independently to separately compiled program modules, and prove via a contextual equivalence result that unboxing a module in isolation preserves program semantics.

Affiliated with

Also associated with

No associations

Rating

Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version) does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version), we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Type-Preserving Flow Analysis and Interprocedural Unboxing (Extended Version) will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-301714