Static analysis with demand-driven value refinement
نویسندگان
چکیده
منابع مشابه
Demand-Driven Pointer Analysis with Strong Updates via Value-Flow Refinement
We present a new demand-driven flowand context-sensitive pointer analysis with strong updates for C programs, called SUPA, that enables computing points-to information via value-flow refinement, in environments with small time and memory budgets such as IDEs. We formulate SUPA by solving a graphreachability problem on an inter-procedural value-flow graph representing a program’s def-use chains,...
متن کاملHigher-Order Demand-Driven Program Analysis (Artifact)
This artifact is a proof-of-concept implementation of DDPA, an on-demand program analysis for higherorder functional programs. The implementation, written in OCaml, includes a parser, evaluator, and DDPA analysis for the language defined in the companion paper (including the proper record semantics extension). The analysis may be performed using different levels of precision as specified by the...
متن کاملHigher-Order Demand-Driven Program Analysis
We explore a novel approach to higher-order program analysis that brings ideas of on-demand lookup from first-order CFL-reachability program analyses to higher-order programs. The analysis needs to produce only a control-flow graph; it can derive all other information including values of variables directly from the graph. Several challenges had to be overcome, including how to build the control...
متن کاملStatic Analysis of Value-Passing Process Calculi
Standard approaches to providing a semantics for value passing process calculi involve an expansion into a basic calculus which only involves pure synchroni-sation. When the semantics is intended to provide a basis for static analysis of properties of the values, this expansion leads to an unacceptable loss of information. In this paper we present a model of value passing process calculi based ...
متن کاملExecution cost interval refinement in static software analysis
Embedded system software timing and power consumption or, in general, execution costs are state and input data dependent. Therefore, formal analysis of such dependencies leads to execution cost intervals rather than single values. These intervals depend on system concurrency, execution paths and process states, as well as on target architecture properties. This paper presents an approach to mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360566