Work

Approximating Context-Sensitive Program Information

Year: 2015

Type: conference-paper

Abstract: Static program analysis is in general more precise if it is sensitive to execution contexts (execution paths). In this paper we propose χ-terms as a mean to capture and manipulate context-sensitive program information in a data-flow analysis. We introduce finite k-approximation and loop approximation that limit the size of the context-sensitive information. These approximated χ-terms form a lattice with a finite depth, thus guaranteeing every data-flow analysis to reach a fixed point.

Source: KTH Publication Database DiVA (KTH Royal Institute of Technology)

Authors: Mathias Hedenborg, Jonas Lundberg, Welf Löwe, Martin Trapp

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W2554027698

FWCI:

Cites: 5

Cited by: 1

Related to: 10