Ovidiu Gheorghioiu

  • Citations Per Year
Learn More
We present an interprocedural and compositional algorithm for finding pairs of <i>compatible</i> allocation sites, which have the property that no object allocated at one site is live at the same time as any object allocated at the other site. If an allocation site is compatible with itself, it is said to be <i>unitary</i>: at most one object allocated at(More)
  • 1