.png){kind=icon}
返回
Program analysis via graph reachability
.png){kind=icon}
OA
AI
DOI：10.1016/S0950-5849(98)00093-7.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper describes how a number of program-analysis problems can be solved by transforming them to graph-reachability problems. Some of the program-analysis problems that are amenable to this treatment include program slicing, certain dataflow-analysis problems, one version of the problem of approximating the possible shapes that heap-allocated structures in a program can take on, and flow-insensitive points-to analysis. Relationships between graph reachability and other approaches to program analysis are described. Some techniques that go beyond pure graph reachability are also discussed. (C) 1998 Elsevier Science B.V. All rights reserved.
Keyword:
program-analysis
graph-reachability
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4.3
论文数:
3.8K
被引数:
7.7K
机构
暂无机构信息
引用论文
Seasonal Variations in Canada Thistle (Cirsium arvense) Root Bud Growth and Root Carbohydrate Reserves.png)
Weed Science
Weed ScienceIF0
PREAI
分享收藏The solar absolute spectral irradiance 1150–3173 Å: May 17, 1982太阳绝对光谱辐照度1150-3173 Å: 1982年5月17日
PREAI
分享收藏The efficacy of the appetite suppressant, diethylpropion, is dependent on both when it is given (day vs. night) and under conditions of high fat dietary restrictionAppetite
AppetiteIF0
PREAI
分享收藏分享收藏
查看更多内容