We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Abstract. Termination analysis has received considerable attention, traditionally in the context of declarative programming, and recently also for imperative languages. In existing...
Elvira Albert, Puri Arenas, Michael Codish, Samir ...
This paperdescribes the use of a powerful graph query language for querying programs, and a novel combination of transformations for generating efficient implementations of the q...
K. Tuncay Tekle, Michael Gorbovitski, Yanhong A. L...
Exception analysis and points-to analysis are typically done in complete separation. Past algorithms for precise exception analysis (e.g., pairing throw clauses with catch stateme...
Program slicing is a potentially useful analysis for aiding program understanding. However, slices of even small programs are often too large to be generally useful. Imprecise poi...
Markus Mock, Darren C. Atkinson, Craig Chambers, S...