Memory efficient context-sensitive program analysis

doi:10.1016/j.jss.2021.110952

Return

Memory efficient context-sensitive program analysis

2021-07-01

Mathias Hedenborg *

Jonas Lundberg

Welf Löwe

DOI：10.1016/j.jss.2021.110952

Original

Save

View PDF

Abstract

En 中文

Static program analysis is in general more precise if it is sensitive to execution contexts (execution paths). But then it is also more expensive in terms of memory consumption. For languages with conditions and iterations, the number of contexts grows exponentially with the program size. This problem is not just a theoretical issue. Several papers evaluating inter-procedural context-sensitive data-flow analysis report severe memory problems, and the path-explosion problem is a major issue in program verification and model checking. In this paper we propose chi-terms as a means to capture and manipulate context-sensitive program information in a data-flow analysis. chi-terms are implemented as directed acyclic graphs without any redundant subgraphs. To show the efficiency of our approach we run experiments comparing the memory usage of x -terms with four alternative data structures. Our experiments show that x-terms clearly outperform all the alternatives in terms of memory efficiency. (C) 2021 Elsevier Inc. All rights reserved.

Keywords:

Static program analysis

Data-flow analysis

Context-sensitivity

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.