| Document Date: 2004-04-22 02:37:00
Open Document File Size: 169,27 KBShare Result on Facebook
City Washington / DC / / Country United States / / Currency USD / / / Facility Practice John Kodumal Alex Aiken EECS Department University of California / / IndustryTerm polymorphic flow analysis applications / conceptual solution / reachability algorithms / least solution / call site / static call site / least solutions / function call site / partial online cycle elimination / generic algorithm / set constraint algorithms / closure algorithm / online cycle elimination / Demand-driven algorithms / particular solution / reachability algorithm / demand-driven algorithm / dual-processor / / Organization Ku Klux Klan / Practice John Kodumal Alex Aiken EECS Department University / Stanford University / University of California / Berkeley / / Person Dyck / Li Li / Robert Johnson / Oi / / Position type qualifier / tainted qualifier / qualifier / Programming Languages General / / ProgrammingLanguage C / / ProvinceOrState California / / SportsLeague Stanford University / / Technology set constraint algorithms / one processor / completely demand-driven algorithm / generic CFL algorithm / 2.2 Constraint Graphs Algorithms / naive CFL closure algorithm / generic algorithm / Demand-driven algorithms / closure algorithm / naive CFL reachability algorithm / generic CFL reachability algorithm / demand algorithms / DyckCFL reachability algorithms / /
SocialTag |
The Set Constraint/CFL Reachability Connection in Practice John Kodumal Alex Aiken