An efficient, parametric fixpoint algorithm forincremental analysis of java bytecode

摘要: Abstract interpretation has been widely used for the analysis of object-oriented languages and, more precisely, Java source and bytecode. However, while most existing work deals with problem finding expressive abstract domains that track accurately characteristics a particular concrete property, underlying fixpoint algorithms have received comparatively less attention. In fact, many (abstract based) fixpoint algorithms rely on relatively inefficient techniques to solve inter-procedural call graphs or are specific tied analyses. We argue design an efficient algorithm is pivotal support large programs. this paper we introduce novel bytecode which includes number optimizations in order reduce iterations. Also, parametric sense it independent domain can be applied different as "plug-ins". It also incremental that, if desired, data saved so only reduced amount reanalysis needed after small program change, instrumental The multivariant flowsensitive. Finally, another interesting characteristic based transformation, prior analysis, results highly uniform representation all features language therefore simplifies analysis. Detailed descriptions decompilation solutions provided discussed example.