Event-Flow Graphs for Efficient Path-Sensitive Analyses

Abstract

Efficient and accurate path-sensitive analyses pose the challenges of: (a) analyzing an exponentially-increasing number of paths in a control-flow graph (CFG), and (b) checking feasibility of paths in a CFG. We address these challenges by introducing an equivalence relation on the CFG paths to partition them into equivalence classes. It is then sufficient… (More)

Topics

10 Figures and Tables

Slides referencing similar topics