Summary: Partial Online Cycle Elimination in Inclusion Constraint Graphs
Manuel F¨ahndrich \Lambda Jeffrey S. Foster \Lambda Zhendong Su \Lambda Alexander Aiken \Lambda
EECS Department
University of California, Berkeley
387 Soda Hall #1776
Berkeley, CA 94720­1776
fmanuel,jfoster,zhendong,aikeng@cs.berkeley.edu
Abstract
Many program analyses are naturally formulated and im­
plemented using inclusion constraints. We present new re­
sults on the scalable implementation of such analyses based
on two insights: first, that online elimination of cyclic con­
straints yields orders­of­magnitude improvements in analy­
sis time for large problems; second, that the choice of con­
straint representation affects the quality and efficiency of
online cycle elimination. We present an analytical model
that explains our design choices and show that the model's
predictions match well with results from a substantial ex­
periment.
1 Introduction

Source: Aiken, Alex - Department of Computer Science, Stanford University
Diwan, Amer - Department of Computer Science, University of Colorado at Boulder

Collections: Computer Technologies and Information Sciences